Abstract A multi-dimensional orthogonal range-searching algorithm, the multi-dimensional k-vector (K-Vector ND), is presented. The algorithm is analyzed and found to have an execution time that is independent of the size of the database, for well-distributed data sets. Numerical tests are performed to determine the performance advantage as compared to a Quad-Tree for the two-dimensional data set. Results range from break-even to a factor of 14, depending on the database size. The K-Vector ND is then applied to the problem of building a non-dimensional star-identification database that contains all visible star triples. The performance of the K-Vector ND algorithm in that task is then compared to a simple nested loop, and found to range from break-even to a factor of 200, depending on the size of the database.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The K-Vector ND and its Application to Building a Non-Dimensional Star Identification Catalog


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2011-04-01


    Format / Umfang :

    14 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    The K-Vector ND and its Application to Building a Non-Dimensional Star Identification Catalog

    Spratling, Benjamin B. / Mortari, Daniele | Online Contents | 2011



    The K-Vector ND and its Application to Building a Non-Dimensional Star Identification Catalog (AAS 09-126)

    Spratling, B.B. / Mortari, D. / American Astronautical Society et al. | British Library Conference Proceedings | 2009


    SKYMAP star catalog

    Gotlieb, D. | NTRS | 1979


    Star-Catalog Data Base

    Gotlieb, D. / Mclaughlin, S. | NTRS | 1982