Farthest-Polygon Voronoi Diagrams

13 years 10 months ago

Download www.loria.fr

Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(n log3 n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k − 1 connected components, but if one component is bounded, then it is equal to the entire region.

Otfried Cheong, Hazel Everett, Marc Glisse, Joachi

Real-time Traffic

ESA 2007 | Farthest-site Voronoi Diagram | Polygonal Sites | Total Complexity |

claim paper

» Arrangements of geodesic arcs on the sphere

» Regionexpansion for the Voronoi diagram of 3D spheres

» Estimation of the necessary number of points in Riemannian Voronoi

» A provably complete exploration strategy by constructing Voronoi diagrams

» Anisotropic diagrams Labelle Shewchuk approach revisited

» The Hausdorff Voronoi Diagram of Point Clusters in the Plane

» A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model

» Bregman Voronoi Diagrams

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	ESA
Authors	Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na

Comments (0)

Sciweavers

Farthest-Polygon Voronoi Diagrams

ESA 2007 | Farthest-site Voronoi Diagram | Polygonal Sites | Total Complexity |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers