Editing Polygon triangulation (section)

== Related objects and problems ==
* Both triangulation problems are a special case of [[triangulation (geometry)]] and a special case of [[polygon partition]].
* [[Minimum-weight triangulation]] is a triangulation in which the goal is to minimize the total edge length.
* A [[point-set triangulation]] is a polygon triangulation of the convex hull of a set of points. A [[Delaunay triangulation]] is another way to create a triangulation based on a set of points.
* The [[associahedron]] is a polytope whose vertices correspond to the triangulations of a convex polygon.
* [[Polygon covering#Covering a polygon with triangles|Polygon triangle covering]], in which the triangles may overlap.
* [[Euclidean tilings by convex regular polygons|Tiling by polygons]], where the goal is to cover the entire plane with polygons of pre-specified shapes.