A Data Structure and an Algorithm for the Nearest Point Problem

DOI10.1109/TSE.1983.235263MaRDI QIDQ3659157zbMATH OpenOpenAlexWikidataFDO

Authors Iraj Kalantari, Gerard McDonald

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 pointstorage binary searchtree structure

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited in

(10)

• 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
• Distance-based index structures for fast similarity search
• A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
• Some approaches to improve tree-based nearest neighbour search algorithms
• Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
• WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION
• Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers
• Probabilistic proximity searching algorithms based on compact partitions

This page was built for publication: A Data Structure and an Algorithm for the Nearest Point Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659157)