GriSPy: A Python package for Fixed-Radius Nearest Neighbors Search

2019/12/19 by Chalela, Martin, Sillero, Emanuel, Pereyra, Luis +4 · 2 citations
#FOS: Physical sciences #Instrumentation and Methods for Astrophysics (astro-ph.IM)

paper · doi:10.48550/arxiv.1912.09585

Abstract

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; as well as three different metrics of interest in astronomy: the euclidean and two distance functions in spherical coordinates of varying precision, haversine and Vincenty; and the possibility of providing a custom distance function. This package results particularly useful for large datasets where a brute-force search turns impractical.

Cited by

• Robust and efficient pre-processing techniques for particle-based methods including dynamic boundary generation
• Monitoring Robustness and Individual Fairness

Related

• Approximate Nearest Neighbor Search in High Dimensions
• Spherical Indexing for Neighborhood Queries
• Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
• Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
• Fast and exact fixed-radius neighbor search based on sorting