Multidimensional Searching Problems

David Dobkin, Richard J. Lipton · SIAM Journal on Computing · 1976

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.

Read the paper · More papers on PaperTik