Algorithm -- Triangulating a Monotone Polygon -- Overview

• the part of P above the sweep line that still needs to be triangulated looks like an upside down funnel
• one boundary of the funnel is a part of a single edge
• the highest vertex of the funnel is convex (interior angle less than p)
• the other boundary is a chain of reflex vertices, which have the interior angle greater than or equal to p


• we need an auxiliary data structure -- stack S
• S will contain visited vertices that may still need more diagonals
• the lowest visited vertex is on top of the stack

back    next