Multidimensional Searching Problems

Authors:
  • DDDavid Dobkin
    David Dobkin
  • RLRichard J. Lipton
    Richard J. Lipton
Publisher website
Google Scholar
Abstract
Classic binary search is extended to multidimensional search problems. This extension yields efficient algorithms for a number of tasks such as a secondary searching problem of Knuth, region location in planar graphs, and speech recognition.