Farthest-Polygon Voronoi Diagrams - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Farthest-Polygon Voronoi Diagrams

(1) , (2) , (2) , (3) , (1) , (2) , (1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
ESA.pdf (282.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00189038 , version 1 (19-11-2007)

Identifiers

Cite

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⟩
180 View
152 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More