How would you go about spliting a non-convex 2D polygon with n-vertices into a set of n-2 triangles. So, you''ve got a polygon represented with coordinates of its n vertices given in a circular manner(meaning vertex n forms an edge with vertex n-1 and another edge with vertex n+1 and so on around the polygon). How would you go about spliting it into n-2 triangle.

Google: triangulation ear

[Ear Clipping Triangulation]
There are many more but this was what appealed to me as the easiest. It has lots of limitations but it can at least handle non-convex polygons.