Farthest-polygon Voronoi diagrams

Authors:
Otfried Cheong;Hazel Everett;Marc Glisse;Joachim Gudmundsson;Samuel Hornus;Sylvain Lazard;Mira Lee;Hyeon-Suk Na
Affiliations:
Dept. of Computer Science, KAIST, Daejeon, Korea;LORIA, INRIA Lorraine, Université Nancy 2, Nancy, France;LORIA, INRIA Lorraine, Université Nancy 2, Nancy, France;National ICT Australia Ltd., Sydney, Australia;Dept. of Computer Science, KAIST, Daejeon, Korea;LORIA, INRIA Lorraine, Université Nancy 2, Nancy, France;Dept. of Computer Science, KAIST, Daejeon, Korea;School of Computing, Soongsil University, Seoul, Korea
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 6
Cited 4

Optimal point location in a monotone subdivision

SIAM Journal on Computing
A fast planar partition algorithm, I

Journal of Symbolic Computation
An optimal algorithm for the intersection radius of a set of convex polygons

Journal of Algorithms
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Farthest line segment Voronoi diagrams

Information Processing Letters

The geodesic farthest-site Voronoi diagram in a polygonal domain with holes

Proceedings of the twenty-fifth annual symposium on Computational geometry
Solving the chromatic cone clustering problem via minimum spanning sphere

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved algorithms for farthest colored voronoi diagram of segments

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Improved algorithms for the farthest colored Voronoi diagram of segments

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.