Chromatic nearest neighbor searching: A query sensitive approach
type: Item
instance of: scholarly article
title: Chromatic nearest neighbor searching: A query sensitive approach
zbMATH Open document ID: 0969.68052
DOI: 10.1016/S0925-7721(00)00021-3
author: David M. Mount
author: Nathan S. Netanyahu
author: Ruth Silverman
author: Angela Y. Wu
published in: Computational Geometry
publication date: 2001-06-21T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1563816
zbMATH Keywords: chromatic nearest neighbor problem
zbMATH Keywords: query sensitive analysis
MaRDI profile type: Publication
cites work: Q5674437
cites work: Q3140429
cites work: Q3128920
cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
cites work: Optimal Expected-Time Algorithms for Closest Point Problems
cites work: Approximate closest-point queries in high dimensions
cites work: An optimal algorithm for closest-pair maintenance
cites work: A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
cites work: Q4886056
cites work: A Randomized Algorithm for Closest-Point Queries
cites work: Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
cites work: Q3619797
cites work: Q4403756
cites work: A Branch and Bound Algorithm for Computing k-Nearest Neighbors
cites work: Q3994557
cites work: Q4048576
cites work: Q3992847
cites work: Refinements to nearest-neighbor searching in k-dimensional trees
cites work: Q4054695
cites work: An O(n log n) algorithm for the all-nearest-neighbors problem
description: scientific article; zbMATH DE number 1563816