Triangulation -- Proof by Induction

• diagonal splits P into polygons P₁ (m₁ vertices) and P₂ (m₂ vertices)
• both m₁ and m₂ must be less than n, so by induction P₁ and P₂ can be triangulated
• hence, P can be triangulated

back    next