Spatial algorithms and data structures (scipy.spatial)ΒΆ

Nearest-neighbor queries:

KDTree(data[, leafsize]) kd-tree for quick nearest-neighbor lookup
cKDTree kd-tree for quick nearest-neighbor lookup
distance

Delaunay triangulation:

Delaunay(points) Delaunay tesselation in N dimensions
tsearch(tri, xi) Find simplices containing the given points.

Next topic

scipy.spatial.KDTree

This Page