A Data Structure and an Algorithm for the Nearest Point Problem

DOI10.1109/TSE.1983.235263zbMath0513.68057OpenAlexW2091967195WikidataQ111898988 ScholiaQ111898988MaRDI QIDQ3659157

Gerard McDonald, Iraj Kalantari

Publication date: 1983

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1983.235263

zbMATH Keywords

nearest pointtree structurestorage binary search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) ⋮ Probabilistic proximity searching algorithms based on compact partitions ⋮ Distance-based index structures for fast similarity search ⋮ A practical approach to the 2D incremental nearest-point problem suitable for different point distributions ⋮ WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION ⋮ Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers ⋮ Parallel query processing on distributed clustering indexes ⋮ Solving similarity joins and range queries in metric spaces with the list of twin clusters ⋮ Exploiting distance coherence to speed up range queries in metric indexes ⋮ Some approaches to improve tree-based nearest neighbour search algorithms