The probabilistic complexity of the Voronoi diagram of points on a polyhedron

DOI10.1145/513400.513426zbMath1414.68121OpenAlexW1984732102MaRDI QIDQ4557556

Hyeon-Suk Na, Mordecai J. Golin

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513400.513426

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

A tight bound for the Delaunay triangulation of points on a polyhedron

This page was built for publication: The probabilistic complexity of the Voronoi diagram of points on a polyhedron