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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast spherical search algorithm


    Contributors:
    Liebe, C.C. (author)


    Publication date :

    2004-01-01


    Size :

    241283 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Fast spherical search algorithm

    Liebe, Carl Christian | NTRS | 2004


    7.1305 Fast Spherical Search Algorithm

    IEEE | British Library Conference Proceedings | 2004


    Fast-Spherical-Projection-Based Point Cloud Clustering Algorithm

    Chen, Zhihui / Xu, Hao / Zhao, Junxuan et al. | Transportation Research Record | 2022


    A fast graph search multiprocessor algorithm

    Venkata Subramaniam, P.R. / Kam-Hoi Cheng | IEEE | 1997


    A Fast Graph Search Multi-processor Algorithm

    Cheng, K.-H. / Venkata Subramaniam, P. K. / IEEE | British Library Conference Proceedings | 1997