Any Polygon can be Decomposed into Triangles
A convex n-sided polygon, with ordered vertices
{v0, v1, ... vn}
along the perimeter, can be trivially decomposed into
triangles
{(v0,v1,v2),
{v0,v2,v3),
(v0,vi,vi+1), ...
(v0,vn-1,vn)}.
You can usually decompose a non-convex polygon into
triangles, but it is non-trivial, and in some overlapping
cases you have to introduce a new vertex.
| |
