Optimal Polygon Triangulation

• A polygon is convex if the line segment between any two points lies on the boundary or the interior.

  This polygon is not convex.

  
  
  
  
  

  
  

  
  

• If v_i and v_j are not adjacent, segment is a chord.

  
  

  
  

• A triangulation is a set of chords T that divides P into disjoint triangles.
  • No chords intersect
  • T is maximal (every chord intersects a cord ).