Polygon triangulation
Partition of a simple polygon into triangles / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Polygon triangulation?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
For broader coverage of this topic, see Triangulation (geometry).
In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles,[1] i.e., finding a set of triangles with pairwise non-intersecting interiors whose union is P.
Triangulations may be viewed as special cases of planar straight-line graphs. When there are no holes or added points, triangulations form maximal outerplanar graphs.