Polygon Triangulation Algorithm -- Overview

• naive algorithm (use the proof of theorem 3.1):
• find a diagonal
• pick the leftmost vertex v, try to connect its neighbors u and w
• if this fails, connect v to v', the farthest vertex from uw inside the triangle uvw


• takes linear time to find the diagonal
• split the polygon in 2 with that diagonal
• recurse on the resulting 2 polygons
• worst case run time of this algorithm is O(n²)

back    next