A Python wrapped version of the [Neighborhood Graph Library (NGL) developed by Carlos Correa and Peter Lindstrom.
Given a set of arbitrarily arranged points in any dimension, this library is able to construct several different types of neighborhood graphs mainly focusing on empty region graph algorithms such as the beta skeleton family of graphs.
pip install nglpy
Then you can use the library from python such as the example below:
import nglpy import numpy as np point_set = np.random.rand(100,2) max_neighbors = 9 beta = 1 aGraph = nglpy.EmptyRegionGraph(max_neighbors=max_neighbors, relaxed=False, beta=beta) aGraph.build(point_set) aGraph.neighbors()