Static class: RT.Geometry.Triangulate

• Assembly: RT.Geometry, Version=1.0.0.9999, Culture=neutral, PublicKeyToken=null
• Namespace: RT.Geometry

Summary

Triangulation-related routines.

Static methods

IEnumerable<ValueTuple<int, int>>	DelaunayEdges(IList<PointD> vertices)	Generates a Delaunay triangulation of the input points.
ValueTuple<List<PointD>, IEnumerable<ValueTuple<int, int>>, HashSet<ValueTuple<int, int>>>	DelaunayEdgesConstrained(IEnumerable<PolygonD> polygons)	Generates a Delaunay triangulation of the specified polygons, supporting arbitrary nesting of islands and holes, but not supporting self-intersections. Additional vertices may be inserted only on the polygon edge, to maintain the Delaunay property. Unless a single convex polygon is passed in, the result includes edges outside the area defined by the polygons.
IEnumerable<ValueTuple<int, int>>	DelaunayEdgesConstrained(List<PointD> vertices, HashSet<ValueTuple<int, int>> requiredEdges, Dictionary<ValueTuple<int, int>, ValueTuple<int, int>> splitEdges = null)	Generates a Delaunay triangulation of the input points. Ensures that requiredEdges are all present in the triangulation, by inserting new vertices as necessary. (see also remarks)
IEnumerable<TriangleD>	DelaunayTriangles(IList<PointD> vertices, bool reverseOrder = false)	Generates a Delaunay triangulation of the input points.
List<TriangleD>	DelaunayTriangles(IEnumerable<PolygonD> polygons, bool reverseOrder = false)	Generates a Delaunay triangulation of the specified polygons. The triangles cover the inside area defined by the polygons, supporting arbitrary nesting of islands and holes, but not supporting self-intersections. Additional vertices may be inserted only on the polygon edge, to maintain the Delaunay property.
IEnumerable<TriangleD>	TrianglesFromEdges(IList<PointD> vertices, IEnumerable<ValueTuple<int, int>> edges, bool reverseOrder = false)	Generates triangles from a valid triangulation defined by a list of edges.
List<ValueTuple<int, int, int>>	TriangleVerticesFromEdges(IList<PointD> vertices, IEnumerable<ValueTuple<int, int>> edges, bool reverseOrder = false)	Finds triangles in a valid triangulation defined by a list of edges.