Please use this identifier to cite or link to this item:

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

Authors Na, Hyeon-Suk
Golin, Mordecai J.
Issue Date 2001-12-08
Summary It is well known that the complexity, i.e., the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n2). Interest has recently arisen as to what happens, both in deterministic and probabilistic situations, when the three dimensional points are restricted to lie on the surface of a 2-dimensional object. In this paper we consider the situation when the points are drawn from a 2-dimensional Poisson distribution with rate n over a fixed union of triangles in R3. We show that with high probability the complexity of their Voronoi diagram is Õ(n). This implies, for example, that the complexity of the Voronoi diagram of points chosen from the surface of a general fixed polyhedron in R3 will also be Õ(n) with high probability.
Language English
Format Technical report
Files in this item:
File Description Size Format
200111.pdf 288639 B Adobe PDF