Grid Search in Python
GriSPy (Grid Search in Python)
GriSPy is a regular grid search algorithm for quick nearest-neighbor lookup.
This class indexes a set of k-dimensional points in a regular grid providing a fast aproach for nearest neighbors queries. Optional periodic boundary conditions can be provided for each axis individually.
GriSPy has the following queries implemented:
- bubble_neighbors: find neighbors within a given radius. A different radius for each centre can be provided.
- shell_neighbors: find neighbors within given lower and upper radius. Different lower and upper radius can be provided for each centre.
- nearest_neighbors: find the nth nearest neighbors for each centre.
And the following methods are available:
- set_periodicity: define the periodicity conditions.
- save_grid: save the grid for future use.
- load_grid: load a previously saved grid.
You need Python 3.7 or later to run GriSPy. You can have multiple Python versions (2.x and 3.x) installed on the same system without problems.
Clone this repo and then inside the local
$ pip install -e .
Martin Chalela (E-mail: email@example.com),
Emanuel Sillero, Luis Pereyra and Alejandro Garcia
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size grispy-2019.12.tar.gz (15.8 kB)||File type Source||Python version None||Upload date||Hashes View hashes|