Editing Polygon triangulation (section)

{{short description|Partition of a simple polygon into triangles}}
{{broader|Triangulation (geometry)}}
[[File:Триангуляция.svg|thumb|Polygon triangulation]]

In [[computational geometry]], '''polygon triangulation''' is the [[Polygon partition|partition]] of a [[polygonal area]] ([[simple polygon]]) {{mvar|P}} into a set of [[triangles]],<ref name= bkos>{{Citation | author = [[Mark de Berg]], [[Marc van Kreveld]], [[Mark Overmars]], and [[Otfried Schwarzkopf]] | year = 2000 | title = Computational Geometry | publisher = [[Springer-Verlag]] | edition = 2nd | isbn = 3-540-65620-0 | url-access = registration | url = https://archive.org/details/computationalgeo00berg |chapter= 3: Polygon Triangulation|pages=45–61}}</ref> i.e., finding a set of triangles with pairwise non-intersecting interiors whose [[Union (set theory)|union]] is {{mvar|P}}.

Triangulations may be viewed as special cases of [[planar straight-line graph]]s. When there are no holes or added points, triangulations form [[outerplanar graph|maximal outerplanar graphs]].