### Navigation

- index
- modules |
- modules |
- previous |
- SciPy v0.9 Reference Guide (DRAFT) »
- Spatial algorithms and data structures (`scipy.spatial`) »

# scipy.spatial.Delaunay

class `scipy.spatial.``Delaunay`(points)

  Delaunay tesselation in N dimensions

  New in version 0.9.

  Parameters : | points : ndarray of floats, shape (npoints, ndim) Coordinates of points to triangulate

  Notes

  The tesselation is computed using the Qhull libary [Qhull].

  References

  [Qhull] | (1, 2, 3, 4) http://www.qhull.org/

  Attributes

  `transform` |
  `vertex_to_simplex` |
  `convex_hull` |

  points | ndarray of double, shape (npoints, ndim) | Points in the triangulation
  vertices | ndarray of ints, shape (nsimplex, ndim+1) | Indices of vertices forming simplices in the triangulation
  neighbors | ndarray of ints, shape (nsimplex, ndim+1) | Indices of neighbor simplices for each simplex. The kth neighbor is opposite to the kth vertex. For simplices at the boundary, -1 denotes no neighbor.
  equations | ndarray of double, shape (nsimplex, ndim+2) | [normal, offset] forming the hyperplane equation of the facet on the paraboloid. (See [Qhull] documentation for more.)
  paraboloid_scale, paraboloid_shift | float | Scale and shift for the extra paraboloid dimension. (See [Qhull] documentation for more.)

  Methods

  `find_simplex` |
  `lift_points` |
  `plane_distance` |

### Navigation

- index
- modules |
- modules |
- previous |
- SciPy v0.9 Reference Guide (DRAFT) »
- Spatial algorithms and data structures (`scipy.spatial`) »