Farthest-Polygon Voronoi Diagrams
Otfried Cheong (KAIST CS), Hazel Everett (INRIA Lorraine - LORIA),, Marc Glisse (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Joachim, Gudmundsson (NICTA), Samuel Hornus (INRIA Lorraine - LORIA), Sylvain Lazard, (INRIA Lorraine - LORIA), Mira Lee (KAIST CS)

TL;DR
This paper studies the farthest-site Voronoi diagram for polygonal sites, proving its linear complexity, providing an efficient algorithm for its construction, and exploring its structural properties.
Contribution
It establishes the linear complexity of the diagram, presents an O(n log^3 n) construction algorithm, and analyzes key structural features.
Findings
The diagram's complexity is O(n).
An O(n log^3 n) algorithm computes the diagram.
Structural properties of the diagram are characterized.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Digital Image Processing Techniques · Optimization and Packing Problems
