Extending range queries and nearest neighbors

DOI10.1016/S0925-7721(00)00013-4zbMath0968.68163OpenAlexW2048331083WikidataQ126324109 ScholiaQ126324109MaRDI QIDQ1841241

Robin Y. Flatland, Charles V. Stewart

Publication date: 22 February 2001

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00013-4

zbMATH Keywords

range searchingextending searches

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Multidimensional divide-and-conquer
• Fractional cascading. II: Applications
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Iterated nearest neighbors and finding minimal polytopes
• New Data Structures for Orthogonal Range Queries
• Filtering Search: A New Approach to Query-Answering
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching

This page was built for publication: Extending range queries and nearest neighbors