Fractional cascading: II. Applications

This paper presents several applications offractional cascading, a new searching technique which has been described in a companion paper. The applications center around a variety of geometric query problems. Examples include intersecting a polygonal path with a line, slanted range search, orthogonal range search, computing locus functions, and others. Some results on the optimality of fractional cascading, and certain extensions of the technique for retrieving additional information are also included.

[1]  Derick Wood,et al.  An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.

[2]  Dan E. Willard,et al.  New Data Structures for Orthogonal Queries. , 1979 .

[3]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[4]  Michael Ian Shamos,et al.  A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications. , 1978 .

[5]  Jon Louis Bentley,et al.  Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[6]  David P. Dobkin,et al.  Efficient Uses of the Past , 1980, FOCS.

[7]  Richard Cole,et al.  Searching and Storing Similar Lists , 2018, J. Algorithms.

[8]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[9]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[10]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[11]  Leonidas J. Guibas,et al.  Visibility and intersectin problems in plane geometry , 1985, SCG '85.

[12]  Stefan Arnborg,et al.  Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. , 1985 .

[13]  Richard Cole,et al.  New Upper Bounds for Neighbor Searching , 1986, Inf. Control..

[14]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[15]  Leonidas J. Guibas,et al.  Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..

[16]  F. Frances Yao,et al.  A 3-space partition and its applications , 1983, STOC.

[17]  Bernard Chazelle,et al.  Linear data structures for two types of range search , 1986, SCG '86.

[18]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[19]  Robert E. Tarjan,et al.  A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..

[20]  Herbert Edelsbrunner,et al.  Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time , 1986, Inf. Process. Lett..

[21]  Bernard Chazelle,et al.  How to Search in History , 1983, Inf. Control..

[22]  David G. Kirkpatrick,et al.  Polygonal Intersection Searching , 1982, Inf. Process. Lett..