Polygon Triangulation Algorithm -- Overview

• can we do better than O(n²)?
• yes, for convex polygons we get O(n)
• pick a vertex and connect it to all other vertices except its neighbors


• then why not split polygon in convex pieces?
• it is as difficult as triangulating
• solution:
• first decompose P into so-called monotone pieces
• then triangulate the monotone pieces