A practical approach to the 2D incremental nearest-point problem suitable for different point distributions

DOI10.1016/j.patcog.2007.06.031zbMath1129.68497OpenAlexW2079885885MaRDI QIDQ2459569

Markus Mannila, Mirko Zadravec, Andrej Brodnik, Merja Wanne, Borut Žalik

Publication date: 7 November 2007

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2007.06.031

zbMATH Keywords

skip listpoint distribution\((a, b)\)-treeIncremental nearest-point problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items

Review of Similarities between Adjacency Model and Relational Model

Cites Work

• Some approaches to improve tree-based nearest neighbour search algorithms
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• A Data Structure and an Algorithm for the Nearest Point Problem
• Optimal Expected-Time Algorithms for Closest Point Problems
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
• PCA-based branch and bound search algorithms for computing K nearest neighbors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item