Line-segment intersection made in-place

We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban's algorithm and, in the worst case, runs in O ( n log 2 n + k ) time using O ( 1 ) extra words of memory in addition to the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational geometry : theory and applications Ročník 38; číslo 3; s. 213 - 230
Hlavní autor: Vahrenhold, Jan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.10.2007
Témata:
In-place algorithms
Line-segment intersection
Space-efficient algorithms
Line-segment intersection
Space-efficient algorithms
In-place algorithms
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í:We present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban's algorithm and, in the worst case, runs in O ( n log 2 n + k ) time using O ( 1 ) extra words of memory in addition to the space used for the input to the algorithm.
ISSN:0925-7721
DOI:10.1016/j.comgeo.2006.09.001