Computational geometry: an introduction
Computational geometry: an introduction
Heuristics for minimum decompositions of polygons
Heuristics for minimum decompositions of polygons
Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
Voronoi diagrams with barriers and the shortest diagonal problem
Information Processing Letters
Fast algorithms for greedy triangulation
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Computational Geometry: Theory and Applications
Manhattonian proximity in a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Computing a threaded quadtree from the Delaunay triangulation in linear time
Nordic Journal of Computing
| Hi-index | 0.00 |
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.