The Greedy Triangulation is a method to compute a
polygon triangulation
In computational geometry, polygon triangulation is the partition of a polygonal area ( simple polygon) into a set of triangles, i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is .
Triangulations may ...
or a
Point set triangulation
A triangulation of a set of points \mathcal in the Euclidean space \mathbb^d is a simplicial complex that covers the convex hull of \mathcal, and whose vertices belong to \mathcal. In the plane (when \mathcal is a set of points in \mathbb^2), tri ...
using a
greedy schema, which adds edges one by one to the solution in strict increasing order by length, with the condition that an edge cannot cut a previously inserted edge.
[
Chapter 3: Polygon Triangulation: pp.103.][
]
References
{{reflist
Triangulation (geometry)
Optimization algorithms and methods