Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space

DOI10.1145/355826.355832zbMath0405.68055OpenAlexW2084360845MaRDI QIDQ4191615

John G. Cleary

Publication date: 1979

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355826.355832

zbMATH Keywords

SearchingPartitionHamming DistanceNearest NeighborEuclidean DistanceData SetElias' AlgorithmMemo Functions

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (4)

Accounting for boundary effects in nearest-neighbor searching ⋮ Adaptive tangent distance classifier on recognition of handwritten digits ⋮ A practical approach to the 2D incremental nearest-point problem suitable for different point distributions ⋮ Chromatic nearest neighbor searching: A query sensitive approach

This page was built for publication: Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space