Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Polygon triangulation
open-in-new
<p>In <a href="/facts/Computational_geometry/eeaotQtl">computational geometry</a>, polygon triangulation is the <a href="/facts/Polygon_partition/LvpV1moS">partition</a> of a <a href="/facts/Polygonal_area/yAq7RjPz">polygonal area</a> (<a href="/facts/Simple_polygon/C5CfrPWf">simple polygon</a>) P into a set of <a href="/facts/Triangles/cRXUwsMn">triangles</a>, i.e., finding a set of triangles with pairwise non-intersecting interiors whose <a href="/facts/Union_(set_theory)/KVVXKfWl">union</a> is P. </p><p>Triangulations may be viewed as special cases of <a href="/facts/Planar_straight-line_graph/7MN0MycS">planar straight-line graphs</a>. When there are no holes or added points, triangulations form <a href="/facts/Outerplanar_graph/FrAgUpcV">maximal outerplanar graphs</a>. </p>