[ascl:1912.013]
GriSPy: Fixed-radius nearest neighbors grid search in Python
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: bubble, shell and the nth-nearest, and offers three different metrics of interest in astronomy: the Euclidean and two distance functions in spherical coordinates of varying precision, haversine and Vincenty. It also provides a custom distance function. GriSPy is particularly useful for large datasets where a brute-force search is not practical.
- Code site:
-
https://github.com/mchalela/GriSPy
https://grispy.readthedocs.io/en/latest/
- Described in:
-
https://ui.adsabs.harvard.edu/abs/2021A&C....3400443C
- Bibcode:
- 2019ascl.soft12013C