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

Authors:
Mirko Zadravec;Andrej Brodnik;Markus Mannila;Merja Wanne;Borut alik
Affiliations:
Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia;Faculty of Mathematics, Natural Sciences and Information Technologies, University of Primorska, Glagoljaška 8, SI-6000 Koper, Slovenia;Department of Computer Science, University of Vaasa, P.O. Box 700, FIN-65101 Vaasa, Finland;Department of Computer Science, University of Vaasa, P.O. Box 700, FIN-65101 Vaasa, Finland;Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia
Venue:
Pattern Recognition
Year:
2008

Citing 20
Cited 1

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computational geometry: an introduction

Computational geometry: an introduction
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Deterministic skip lists

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space

ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software (TOMS)
Neighbours on a Grid

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
The Nearest Neighbor Problem on Bounded Domains

Proceedings of the 12th Colloquium on Automata, Languages and Programming
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
PCA-based branch and bound search algorithms for computing K nearest neighbors

Pattern Recognition Letters
Nearest neighbor queries in road networks

GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Neighbor-finding based on space-filling curves

Information Systems
High dimensional nearest neighbor searching

Information Systems
Some approaches to improve tree-based nearest neighbour search algorithms

Pattern Recognition
A Data Structure and an Algorithm for the Nearest Point Problem

IEEE Transactions on Software Engineering

A fast algorithm for approximate surface reconstruction from sampled points

Advances in Engineering Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we present a new practical approach to solve the incremental nearest-point problem in the plane. We used the proposed approach in industrial applications with a superior behaviour to the theoretically better solutions. The method efficiently avoids the requirement of initial randomization of the input points by splitting the plane in strips using a heuristic. Points in strips are stored either in (a,b)-skip lists or in (a,b)-trees. Testing of the algorithms at different point distributions shows that our algorithm, using proposed heuristic, is almost insensible to distributions of input points, what makes the algorithm very attractive for various engineering applications.