Sciweavers

COMPGEOM
1993
ACM

A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon

13 years 7 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and only if v is the closest vertex of P visible from p. We present a randomized algorithm that builds the bounded Voronoi diagram of a simple polygon in linear expected time. Among other applications, we can construct within the same time bound the generalized Delaunay triangulation of P and the minimal spanning tree on P’s vertices that is contained in P.
Rolf Klein, Andrzej Lingas
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1993
Where COMPGEOM
Authors Rolf Klein, Andrzej Lingas
Comments (0)