The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces

DOI10.1016/j.ipl.2012.12.010zbMath1259.68211OpenAlexW2103723796MaRDI QIDQ1943631

Yong-Jin Liu, Kai Tang

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.12.010

zbMATH Keywords

Voronoi diagramcomputational geometrycombinatorial complexitytriangulated surfaces

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (2)

Approximate Delaunay mesh reconstruction and quality estimation from point samples ⋮ A distance function for computing on finite subsets of Euclidean spaces

This page was built for publication: The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces