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

Podrobná bibliografia

Vydané v:	Computational geometry : theory and applications Ročník 52; s. 34 - 43
Hlavný autor:	Bae, Sang Won
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2016
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!