delaunay_from_points

compas.geometry.delaunay_from_points(points, boundary=None, holes=None, tiny=1e-12)[source]

Computes the delaunay triangulation for a list of points.

Parameters

  • points (sequence[[float, float, float] | Point]) – XYZ coordinates of the original points.

  • boundary (sequence[[float, float, float] | Point] | Polygon, optional) – List of ordered points describing the outer boundary.

  • holes (sequence[sequence[[float, float, float] | Point] | Polygon], optional) – List of polygons (ordered points describing internal holes.

Returns

list[[int, int, int]] – The faces of the triangulation. Each face is a triplet of indices referring to the list of point coordinates.

Notes

For more info, see 1.

References

1

Sloan, S. W., 1987 A fast algorithm for constructing Delaunay triangulations in the plane Advances in Engineering Software 9(1): 34-55, 1978.

Examples

>>>