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 place. Our algorithm is an in-place variant of Balaban's algorithm and runs in $\mathcal{O}(n log^2_2 n + k)$ time using $\mathcal{O}$(1) extra words of memory over and above the space used for the input to the algorithm.

[1]  Michiel H. M. Smid,et al.  Space-efficient geometric divide-and-conquer algorithms , 2007, Comput. Geom..

[2]  Jingchao Chen.  Optimizing stable in-place merging , 2003, Theor. Comput. Sci..

[3]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[4]  Jyrki Katajainen,et al.  Stable minimum space partitioning in linear time , 1992, BIT.

[5]  Jean-Daniel Boissonnat,et al.  An elementary algorithm for reporting intersections of red/blue curve segments , 2000, Comput. Geom..

[6]  J. IAN MUNRO,et al.  An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time , 1986, J. Comput. Syst. Sci..

[7]  Ivan J. Balaban,et al.  An optimal algorithm for finding segments intersections , 1995, SCG '95.

[8]  Leonidas J. Guibas,et al.  Fractional cascading: I. A data structuring technique , 1986, Algorithmica.

[9]  Jyrki Katajainen,et al.  Sorting multisets stably in minimum space , 1992, Acta Informatica.

[10]  Stefan Schirra,et al.  Robustness and Precision Issues in Geometric Computation , 2000, Handbook of Computational Geometry.

[11]  Timothy M. Chan,et al.  Towards in-place geometric algorithms and data structures , 2004, SCG '04.

[12]  Jeffrey S. Salowe,et al.  Stable Unmerging in Linear Time and Constant Space , 1987, Inf. Process. Lett..

[13]  David M. Mount.  Geometric Intersection , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[14]  Éva Tardos,et al.  Algorithm design , 2005 .

[15]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[16]  Luis Trabb Pardo.  Stable Sorting and Merging with Optimal Space and Time Bounds , 1977, SIAM J. Comput..

[17]  Jyrki Katajainen,et al.  Asymptotically efficient in-place merging , 2000, Theor. Comput. Sci..

[18]  Pat Morin,et al.  In-Place Planar Convex Hull Algorithms , 2002, LATIN.

[19]  Jing-Chao Chen.  A simple algorithm for in-place merging , 2006, Inf. Process. Lett..

[20]  B. Chazelle.  Intersecting Is Easier than Sorting , 1984, STOC.

[21]  Pat Morin,et al.  Space-efficient planar convex hull algorithms , 2004, Theor. Comput. Sci..