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

DOI10.1016/J.PATCOG.2007.06.031MaRDI QIDQ2459569zbMATH OpenOpenAlexFDO

Authors Mirko Zadravec, Andrej Brodnik, Markus Mannila, 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

\((a, b)\)-treeIncremental nearest-point problempoint distributionskip list

Mathematics Subject Classification ID

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

Recommendations

• A Randomized Algorithm for Closest-Point Queries
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems
• scientific article; zbMATH DE number 1954394
• Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
• scientific article; zbMATH DE number 5046292
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• On finding \(p\)-th nearest neighbours of scattered points in two dimensions for small \(p\)
• Practical distribution-sensitive point location in triangulations
• Simple and efficient distribution-sensitive point location in triangulations

Cites work

• A Data Structure and an Algorithm for the Nearest Point Problem
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
• scientific article; zbMATH DE number 1728313 (Why is no real title available?)
• scientific article; zbMATH DE number 1728331 (Why is no real title available?)
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3919834 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3463166 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 742983 (Why is no real title available?)
• scientific article; zbMATH DE number 1893569 (Why is no real title available?)
• scientific article; zbMATH DE number 5046292 (Why is no real title available?)
• Optimal Expected-Time Algorithms for Closest Point Problems
• PCA-based branch and bound search algorithms for computing K nearest neighbors
• Some approaches to improve tree-based nearest neighbour search algorithms

Cited in

(3)

• An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
• Review of similarities between adjacency model and relational model
• scientific article; zbMATH DE number 5046292 (Why is no real title available?)

This page was built for publication: A practical approach to the 2D incremental nearest-point problem suitable for different point distributions

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