This paper describes an algorithm to search a number of spherical points and find the points that are within a given distance to a given point. The described algorithm is not optimal, but is easy to implement. Basically, it utilizes a number of spherical coverings to build the data structure. Results of an implementation are presented.
Fast spherical search algorithm
2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720) ; 4 ; 2691-2696 Vol.4
2004-01-01
241283 byte
Conference paper
Electronic Resource
English
Fast spherical search algorithm
NTRS | 2004
|7.1305 Fast Spherical Search Algorithm
British Library Conference Proceedings | 2004
|Fast-Spherical-Projection-Based Point Cloud Clustering Algorithm
Transportation Research Record | 2022
|A fast graph search multiprocessor algorithm
IEEE | 1997
|A Fast Graph Search Multi-processor Algorithm
British Library Conference Proceedings | 1997
|