Efficient computation of the geodesic Voronoi diagram of points in a simple polygon

1995 ◽  
pp. 238-251 ◽  
Author(s):  
Evanthia Papadopoulou ◽  
D. T. Lee
Keyword(s):  
Voronoi Diagram ◽  
Simple Polygon ◽  
Efficient Computation

scholarly journals Efficient computation of clipped Voronoi diagram for mesh generation

2013 ◽  
Vol 45 (4) ◽  
pp. 843-852 ◽  
Author(s):  
Dong-Ming Yan ◽  
Wenping Wang ◽  
Bruno Lévy ◽  
Yang Liu
Keyword(s):  
Voronoi Diagram ◽  
Mesh Generation ◽  
Efficient Computation

A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON

1996 ◽  
Vol 06 (03) ◽  
pp. 263-278 ◽  
Author(s):  
ROLF KLEIN ◽  
ANDRZEJ LINGAS
Keyword(s):  
Voronoi Diagram ◽  
Delaunay Triangulation ◽  
Spanning Tree ◽  
Linear Time ◽  
Randomized Algorithm ◽  
Simple Polygon ◽  
Minimal Spanning Tree ◽  
Expected Time

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.

scholarly journals The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon

Algorithmica ◽  
2019 ◽  
Vol 82 (5) ◽  
pp. 1434-1473
Author(s):  
Eunjin Oh ◽  
Luis Barba ◽  
Hee-Kap Ahn
Keyword(s):  
Voronoi Diagram ◽  
Simple Polygon ◽  
Farthest Point

Representing the Voronoi diagram of a simple polygon using rational quadratic Bézier curves

1995 ◽  
Vol 27 (8) ◽  
pp. 605-614 ◽  
Author(s):  
Deok-Soo Kim ◽  
Il-Kyu Hwang ◽  
Bum-Joo Park
Keyword(s):  
Voronoi Diagram ◽  
Simple Polygon ◽  
Bezier Curves ◽  
Bézier Curves
Sign in / Sign up

Export Citation Format

Share Document