Algorithm -- Running Time

• monotone decomposition
• O(n log n)
• triangulating monotone pieces
• each piece : linear
• sum of the numbers of vertices of each piece is O(n)
• so, for all pieces : O(n)
• total running time : O(n log n)