Algorithmica

, Volume 1, Issue 1, pp 163–191

Fractional cascading: II. Applications

  • Bernard Chazelle
  • Leonidas J. Guibas
Article

DOI: 10.1007/BF01840441

Cite this article as:
Chazelle, B. & Guibas, L.J. Algorithmica (1986) 1: 163. doi:10.1007/BF01840441

Abstract

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.

Key words

Fractional cascadingIterative searchMultiple look-upBinary searchB-treeIterative searchMultiple look-upRange queryDynamization of data structures

Copyright information

© Springer-Verlag New York Inc. 1986

Authors and Affiliations

  • Bernard Chazelle
    • 1
  • Leonidas J. Guibas
    • 2
  1. 1.Brown University and Ecole Normale SupérieureUSA
  2. 2.DEC/SRC and Stanford UniversityUSA
  3. 3.DEC Systems Research CenterPalo AltoUSA