## Line-segment intersection made in-place (2007)

by
Jan Vahrenhold

Citations: | 8 - 2 self |

### BibTeX

@MISC{Vahrenhold07line-segmentintersection,

author = {Jan Vahrenhold},

title = {Line-segment intersection made in-place },

year = {2007}

}

### OpenURL

### Abstract

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 log2 n+k) time using O(1) extra words of memory in addition to the space used for the input to the algorithm.