Segment intersection searching problems in general settings

We consider segment intersection searching amidst (possibly intersecti ng) algebraic arcs in the plane. We show how to preprocess $n$ arcs in time $O(n^{2+\epsilon})$ into a data structure of size $O(n^{2+\epsilon})$, for any $\epsilon >0$, such that the $k$ arcs intersecting a query segment can be counted in time $O(\log n)$ or reported in time $O(\log n+k)$. This problem was extensively studied in restricted settings (e.g., amidst segments, circles or circular arcs), but no solution with comparable performance was previously presented for the general case of possibly intersecting algebraic arcs. Our data structure for the general case matches or improves (sometimes by an order of magnitude) the size of the best previously presented solutions for the special cases. As an immediate application of this result, we obtain an efficient data structure for the triangular windowing problem, which is a generalization of triangular range searching. As another application, the first substantially sub-quadratic algorithm for a red-blue intersection counting problem is derived. We also describe simple data structures for segment intersection searching among disjoint arcs, and ray shooting among algebraic arcs.

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

[2]  Robert E. Tarjan,et al.  Making Data Structures Persistent , 1989, J. Comput. Syst. Sci..

[3]  Pankaj K. Agarwal.  Intersection and decomposition algorithms for planar arrangements , 1991 .

[4]  Micha Sharir,et al.  Circle Shooting in a Simple Polygon , 1993, J. Algorithms.

[5]  Jirí Matousek,et al.  Ray Shooting and Parametric Search , 1993, SIAM J. Comput..

[6]  Vladlen Koltun,et al.  Almost tight upper bounds for vertical decompositions in four dimensions , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[8]  Michiel H. M. Smid,et al.  Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization , 1995, J. Algorithms.

[9]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[10]  Mark H. Overmars,et al.  Intersection Queries in Curved Objects , 1993, J. Algorithms.

[11]  Micha Sharir,et al.  Counting Circular Arc Intersections , 1993, SIAM J. Comput..

[12]  Michiel H. M. Smid,et al.  Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization , 1993, WADS.

[13]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[14]  Micha Sharir,et al.  Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..

[15]  Hazel Everett,et al.  Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons , 1999, SCG '99.

[16]  Michel Pocchiola,et al.  Pseudo-triangulations: theory and applications , 1996, SCG '96.

[17]  Mark de Berg,et al.  Ray Shooting, Depth Orders and Hidden Surface Removal , 1993, Lecture Notes in Computer Science.

[18]  Leonidas J. Guibas,et al.  A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..

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