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

Martin Chalela, Emanuel Sillero, Luis Pereyra, Mario Alejandro García, Juan B. Cabral +2 more
12/19/2019
astro-ph.IM

Official code: mchalela/GriSPy (41 stars, MIT, last commit 2026-08-11).

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.

View on arXivView PDF

Code Implementations(1)

mchalela/GriSPyOfficial100%
MIT

GriSPy is a regular grid search algorithm for quick nearest-neighbor lookup.

414PythonSep 9, 20192 months agoMIT

Similar Papers

Clustered Hierarchical Entropy-Scaling Search of Astronomical and Biological Data

82% match2019

EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph

80% match1 repo2992016

Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs

79% match1 repo5.4k2016

Graph-Based Algorithms for Diverse Similarity Search

79% match2025

PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

79% match2019

LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table

78% match1 repo132025

Cite this paper

@article{chalela2019grispy,
  title  = {GriSPy: A Python package for Fixed-Radius Nearest Neighbors Search},
  author = {Martin Chalela and Emanuel Sillero and Luis Pereyra and Mario Alejandro García and Juan B. Cabral and Marcelo Lares and Manuel Merchán},
  year   = {2019},
  eprint = {1912.09585},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1912.09585}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1912.09585.svg)](https://codeofpaper.com/paper/1912.09585)

Discussion