An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments

This paper presents an almost optimal algorithm that computes the Voronoi diagram of a set S of n line segments that may intersect or cross each other. If there are k intersections among the input segments in S, our algorithm takes O(nα(n)log⁡n+k) time, where α(⋅) denotes the inverse of the Ackerman...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational geometry : theory and applications Ročník 52; s. 34 - 43
Hlavní autor: Bae, Sang Won
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.02.2016
Témata:
Line segments
Medial axis
Polygon with holes
Voronoi diagram
Weakly simple polygon
Weakly simple polygon
Voronoi diagram
Line segments
Medial axis
Polygon with holes
ISSN:0925-7721
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents an almost optimal algorithm that computes the Voronoi diagram of a set S of n line segments that may intersect or cross each other. If there are k intersections among the input segments in S, our algorithm takes O(nα(n)log⁡n+k) time, where α(⋅) denotes the inverse of the Ackermann function. The best known running time prior to this work was O((n+k)log⁡n). Since the lower bound of the problem is shown to be Ω(nlog⁡n+k) in the worst case, our algorithm is worst-case optimal for k=Ω(nα(n)log⁡n), and is only a factor of α(n) away from any optimal-time algorithm, which is still unknown. For the purpose, we also present an improved algorithm that computes the medial axis or the Voronoi diagram of a polygon with holes.
ISSN:0925-7721
DOI:10.1016/j.comgeo.2015.11.002