GriSPy: A Python package for fixed-radius nearest neighbors search

We present a new regular grid search algorithm for quick fixed-radius nearest-neighbor lookup developed in Python. This module indexes a set of k-dimensional points in a regular grid, with optional periodic conditions, providing a fast approach for nearest neighbors queries. In this first installmen...

Full description

Saved in:
Bibliographic Details
Published in:Astronomy and computing 2021-01, Vol.34, p.100443, Article 100443
Main Authors: Chalela, M., Sillero, E., Pereyra, L., Garcia, M.A., Cabral, J.B., Lares, M., Merchán, M.
Format: Article
Language:English
Subjects:
Astroinformatics
Data analysis
Data mining
Methods
Nearest-neighbor search
Python package
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new regular grid search algorithm for quick fixed-radius nearest-neighbor lookup developed in Python. This module indexes a set of k-dimensional points in a regular grid, with optional periodic conditions, providing a fast approach for nearest neighbors queries. In this first installment, we provide three types of queries: bubble, shell and the nth-nearest. For these queries we include three different metrics of interest in astronomy, namely, the euclidean, the haversine and the Vincenty, the last two in spherical coordinates. We also provide the possibility of using a custom distance function. This package results particularly useful for large datasets where a brute-force search turns impractical.
ISSN:2213-1337
2213-1345
DOI:10.1016/j.ascom.2020.100443