Chromatic nearest neighbor searching: A query sensitive approach

DOI10.1016/S0925-7721(00)00021-3zbMath0969.68052MaRDI QIDQ1595399

Ruth Silverman, Nathan S. Netanyahu, David M. Mount, Angela Y. Wu

Publication date: 21 June 2001

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

zbMATH Keywords

chromatic nearest neighbor problemquery sensitive analysis

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Related Items

Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set ⋮ Algorithms for interval structures with applications ⋮ Colored spanning graphs for set visualization ⋮ Coresets for the Nearest-Neighbor Rule ⋮ Algorithms for Interval Structures with Applications

Cites Work

• Refinements to nearest-neighbor searching in k-dimensional trees
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Approximate closest-point queries in high dimensions
• An optimal algorithm for closest-pair maintenance
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• A Randomized Algorithm for Closest-Point Queries
• Optimal Expected-Time Algorithms for Closest Point Problems
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic nearest neighbor searching: A query sensitive approach