Triangulation -- Proof by Induction

• inductive step:    n > 3;  assume theorem holds for every m < n
• first, prove existence of a diagonal:
• let v be the leftmost vertex of P
• let u and w be the two neighboring vertices of v
• if open segment uw lies inside P, then uw is a diagonal

back    next