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

Full description

Saved in:

Bibliographic Details
Published in:	Computational geometry : theory and applications Vol. 38; no. 3; pp. 213 - 230
Main Author:	Vahrenhold, Jan
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2007
Subjects:	In-place algorithms Line-segment intersection Space-efficient algorithms Line-segment intersection Space-efficient algorithms In-place algorithms
ISSN:	0925-7721
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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