Fast spherical search algorithm

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. Result...

Full description

Saved in:
Bibliographic Details
Published in2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720) Vol. 4; pp. 2691 - 2696 Vol.4
Main Author Liebe, C.C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2004
Subjects
Data structures
Laboratories
Organizing
Paper technology
Propulsion
Prototypes
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:0780381556
9780780381551
ISSN:1095-323X
2996-2358
DOI:10.1109/AERO.2004.1368064