Question

what is triangulation of a n sided polygon​

Answer 1

Answer:

In computational geometry, polygon triangulation is the decomposition 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. ... When there are no holes or added points, triangulations form maximal outerplanar graphs.

Answer 2

In computational geometry, polygon triangulation is the decomposition 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. ... When there are no holes or added points, triangulations form maximal outerplanar graphs.