CSC274b
Spring 2000
Ileana Streinu

• Reading: Ch 2 textbook, Polygon Partitioning: 2.1, 2.2 (pages 44-51).
• Naive algorithm for computing diagonals. How many can there be?
• Naive algorithm for triangulating, based on proof. Complexity?
• O(n log n) triangulation algorithms, base don monotone partioning and trapezoidalization. Plan.
• Monotone partioning. Triangulating a monotone polygon in linear time.
• Trapezoidalization: plane sweep. Constructing a trapezoidalization in O(n log n) time.