This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Data Structure and an Algorithm for the Nearest Point Problem
September 1983 (vol. 9 no. 5)
pp. 631-634
I. Kalantari, Department of Mathematics, Western Illinois University
In this paper we present a tree structure for storing points from a normed space whose norm is effectively computable. We then give an algorithm for finding the nearest point from the tree to a given query point. Our algorithm searches the tree and uses the triangle inequality to eliminate searching of the entirety of some branches of the tree whenever a certain predicate is satisfied. Our data structure uses 0(n) for storage. Empirical data which we have gathered suggest that the expected complexity for preprocessing and the search time are, respectively, 0(nlogn) and 0(logn).
Index Terms:
triangle inequality, Algorithm, computational time, data structure, nearest point problem, preprocessing, storage binary search, trees
Citation:
I. Kalantari, G. McDonald, "A Data Structure and an Algorithm for the Nearest Point Problem," IEEE Transactions on Software Engineering, vol. 9, no. 5, pp. 631-634, Sept. 1983, doi:10.1109/TSE.1983.235263
Usage of this product signifies your acceptance of the Terms of Use.