Polygon triangulation
Partition of a simple polygon into triangles
Polygon triangulation
In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, 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.
Read on Wikipedia · Image Tosha, CC0
Open boosters, collect cards and trade them. Free to play.
Play for free