Algorithm -- Triangulating a Monotone Polygon -- Overview

• property of any monotone polygon P:
• starting at the highest vertex, we always go down following either the left or the right boundary chain of P
• use this property to make a greedy algorithm
• visit all vertices in order of decreasing y-coordinate
• add diagonals to vertices above the sweepline whenever possible

back    next