Farthest-Polygon Voronoi Diagrams

Otfried Cheong 1 Hazel Everett 2 Marc Glisse 2 Joachim Gudmundsson 3 Samuel Hornus 1 Sylvain Lazard 2 Mira Lee 1 Hyeon-Suk Na 3
1 KAIST - Department of Electrical Engineering [Korea Advanced Institute of Science and Technology]
2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 School of Computing - Soongsil University, Séoul
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 log^3 n) time algorithm to compute it.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
https://hal.inria.fr/inria-00189038
Contributor : Sylvain Lazard <>
Submitted on : Monday, November 19, 2007 - 6:56:33 PM
Last modification on : Friday, September 20, 2019 - 4:56:41 PM
Long-term archiving on : Monday, April 12, 2010 - 2:44:40 AM

File

ESA.pdf
Files produced by the author(s)

Identifiers

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, et al.. Farthest-Polygon Voronoi Diagrams. 15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩. ⟨inria-00189038⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

360

Files downloads

389

Contact


archive-ouverte@inria.fr