Reporting Red—Blue Intersections between Two Sets of Connected Line Segments

Abstract. We present a new line sweep algorithm, HEAPSWEEP, for reporting bichromatic (``purple'') intersections between a red and a blue family of line segments. If the union of the segments in each family is connected as a point set, HEAPSWEEP reports all k purple intersections in time O((n+k) α(n) log3 n) , where n is the total number of input segments and α(n) is the nearly constant inverse Ackermann function. To achieve these bounds, the algorithm maintains only partial information about the vertical ordering between curves of the same color, using a new data structure called a kinetic queue . In order to analyze the running time of HEAPSWEEP, we also show that a simple polygon containing a set of n line segments can be partitioned into monotone regions by a set of vertical threads cutting these segments O(n log n) times.

[1]  Jack Snoeyink,et al.  Counting and Reporting Red/Blue Segment Intersections , 1993, WADS.

[2]  Gerth Stølting Brodal,et al.  Dynamic Planar Convex Hull with Optimal Query Time , 2000, SWAT.

[3]  Micha Sharir,et al.  Red-Blue intersection detection algorithms, with applications to motion planning and collision detection , 1990, SCG '88.

[4]  Leonidas J. Guibas,et al.  Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques , 1988, SWAT.

[5]  Jeff Erickson,et al.  New lower bounds for Hopcroft's problem , 1995, SCG '95.

[6]  Leonidas J. Guibas,et al.  Computing a face in an arrangement of line segments , 1991, SODA '91.

[7]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[8]  Richard Cole,et al.  On k-Hulls and Related Problems , 1987, SIAM J. Comput..

[9]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

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

[11]  Sariel Har-Peled,et al.  Taking a walk in a planar arrangement , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  L. Guibas,et al.  Polyhedral Tracings and their Convolution , 1996 .

[13]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[14]  Herbert Edelsbrunner,et al.  On the Number of Line Separations of a Finite Set in the Plane , 1985, J. Comb. Theory, Ser. A.

[15]  Ketan Mulmuley,et al.  On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..

[16]  Timothy M. Chan.  Dynamic planar convex hull operations in near-logarithmic amortized time , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[17]  Jirí Matousek,et al.  Range searching with efficient hierarchical cuttings , 1992, SCG '92.

[18]  Herbert Edelsbrunner,et al.  Constructing Belts in Two-Dimensional Arrangements with Applications , 1986, SIAM J. Comput..

[19]  P. Erdös,et al.  Dissection Graphs of Planar Point Sets , 1973 .

[20]  Harry G. Mairson,et al.  Reporting and Counting Intersections Between Two Sets of Line Segments , 1988 .

[21]  Jirí Matousek,et al.  Spanning trees with low crossing number , 1991, RAIRO Theor. Informatics Appl..

[22]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[23]  Leonidas J. Guibas,et al.  Reporting Red-Blue Intersections between Two Sets of Connected Line Segments , 1996, ESA.

[24]  Mark de Berg,et al.  Cuttings and applications , 1995, Int. J. Comput. Geom. Appl..

[25]  Jirí Matousek,et al.  Constructing levels in arrangements and higher order Voronoi diagrams , 1994, SCG '94.

[26]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[27]  Cecilia R. Aragon,et al.  Randomized search trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[28]  Micha Sharir,et al.  Online Point Location in Planar Arrangements and Its Applications , 2001, SODA '01.