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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational geometry : theory and applications Jg. 38; H. 3; S. 213 - 230
1. Verfasser:	Vahrenhold, Jan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.10.2007
Schlagworte:	In-place algorithms Line-segment intersection Space-efficient algorithms Line-segment intersection Space-efficient algorithms In-place algorithms
ISSN:	0925-7721
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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