Farthest-Polygon Voronoi Diagrams

Details Farthest-Polygon Voronoi Diagrams Farthest-Polygon Voronoi Diagrams

2010-01-20

arxiv.org/abs/1001.3593v2

Computational Geometry (2010)

Computer Science

Computational Geometry

Scientific paper

Given a family of k disjoint connected polygonal sites in general position and 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 log^3 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.

Affiliated with

Also associated with

No associations

Rating

Farthest-Polygon Voronoi Diagrams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Farthest-Polygon Voronoi Diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Farthest-Polygon Voronoi Diagrams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129021