GriSPy: Fixed-radius nearest neighbors grid search in Python

Discussion topics for individual codes
Post Reply
Ada Coda
ASCL Robot
Posts: 1651
Joined: Thu May 08, 2014 5:37 am

GriSPy: Fixed-radius nearest neighbors grid search in Python

Post by Ada Coda » Tue Dec 31, 2019 5:57 pm

GriSPy: Fixed-radius nearest neighbors grid search in Python

Abstract: GriSPy (Grid Search in Python) uses a regular grid search algorithm for quick fixed-radius nearest-neighbor lookup. It indexes a set of k-dimensional points in a regular grid providing a fast approach for nearest neighbors queries. Optional periodic boundary conditions can be provided for each axis individually. GriSPy implements three types of queries: <i>bubble</i>, <i>shell</i> and the <i>nth-nearest</i>, and offers three different metrics of interest in astronomy: the <i>Euclidean</i> and two distance functions in spherical coordinates of varying precision, <i>haversine</i> and <i>Vincenty</i>. It also provides a custom distance function. GriSPy is particularly useful for large datasets where a brute-force search is not practical.

Credit: Chalela, Martín; Sillero, Emanuel; Pereyra, Luis; Garcia, Mario A.; Cabral, Juan B.; Lares, Marcelo; Merchán, Manuel

Site: https://grispy.readthedocs.io/en/latest/
https://ui.adsabs.harvard.edu/abs/2019arXiv191209585C

Bibcode: 2019ascl.soft12013C

Preferred citation method: https://ui.adsabs.harvard.edu/abs/2019arXiv191209585C

ID: ascl:1912.013

Post Reply