Simple 2d polygon triangulation

Question

Trying to triangulate a set of simple 2d polygons, I\'ve come up with this algorithm:

• 1) For each vertex in the polygon, compute the angle bet

Answer 1

If I'm understanding you correctly, you're chopping off triangles starting with the smallest interior angle. This can fail if the polygon is not convex. Consider a polygon with vertices (in order) at: (0,0) (10,9) (9,9) (9,10). The smallest angle is the one at the origin, but you can't safely cut off that triangle.

(If your polygon is convex, then you can just pick any vertex, remove a triangle there, and repeat. So I'm guessing you want your algorithm to work even for non-convex polygons.)