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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Fast spherical search algorithm


    Beteiligte:
    Liebe, C.C. (Autor:in)


    Erscheinungsdatum :

    2004-01-01


    Format / Umfang :

    241283 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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 Multi-processor Algorithm

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


    Fast nearest-neighbor search algorithm [2669-11]

    Darwish, A. M. / SPIE | British Library Conference Proceedings | 1996