0

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

A new regular grid search algorithm for fixed-radius nearest-neighbor lookup provides fast indexing and querying of k-dimensional points with various distance metrics.

Year
2019
Venue
arXiv 2019
Authors
7
Hosting
Abstract onlyARXIV-DEFAULT

Cite

Notes

Only stored in your browser.

Attribution

Abstract & full text
arxiv.org/abs/1912.09585ARXIV-DEFAULT
TL;DR
Semantic Scholar
Attribution policy →

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.

Authors

7