Fractional cascading: II. Applications

@article{Chazelle2005FractionalCI,
  title={Fractional cascading: II. Applications},
  author={B. Chazelle and L. Guibas},
  journal={Algorithmica},
  year={2005},
  volume={1},
  pages={163-191}
}
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… Expand
76 Citations
Fractional cascading: I. A data structuring technique
  • 270
Polygonal Path Approximation: A Query Based Approach
  • 3
Polygonal chain approximation: a query based approach
  • 12
  • PDF
Non-orthogonal Range Searching: A Review
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
  • P. Afshani, Pingan Cheng
  • Computer Science
  • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
  • 2020
Optimal cooperative search in fractional cascaded data structures
  • 9
  • PDF
Chapter 4 Fractional Cascading
    • PDF
    Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons
    • 19
    • PDF
    xy-Monotone Path Existence Queries in a Rectilinear Environment
    • 3
    • PDF
    ...
    1
    2
    3
    4
    5
    ...

    References

    SHOWING 1-10 OF 22 REFERENCES
    Linear data structures for two types of range search
    • 2
    An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
    • 245
    • PDF
    Multidimensional divide-and-conquer
    • 669
    The power of geometric duality
    • 179
    Visibility and intersection problems in plane geometry
    • 251
    • PDF
    Searching and Storing Similar Lists
    • R. Cole
    • Mathematics, Computer Science
    • J. Algorithms
    • 1986
    • 113
    A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets
    • R. Tarjan
    • Computer Science, Mathematics
    • J. Comput. Syst. Sci.
    • 1979
    • 279
    Location of a point in a planar subdivision and its applications
    • 146
    • PDF
    New Upper Bounds for Neighbor Searching
    • 22
    How to Search in History
    • B. Chazelle
    • Computer Science, Mathematics
    • Inf. Control.
    • 1985
    • 58
    ...
    1
    2
    3
    ...