| LEP: SD Trees |
- An implementation of a binary tree as data structure for constant time
searching in two-dimensional space
|
|
|
|
|
Peter Hilpert
MPI Informatik Im Stadtwald 66123 Saarbrücken Germany email: PHilpert@aol.com |
- This LEP implements a data structure that provides nearest-neighbour-
and other kinds of search algorithms on static sets of points in two-dimensional
space with euclidean distances. The data structure of the binary search tree
allows to execute these searches in amortised constant time.
|
|
J.L. Bentley 6th Annual ACM Symposium on Computational Geometry 254-263, 1990 |
back to the LEDA EP index page