Thursday, Feb.17, 2000
- Reading: Ch 2 textbook, Polygon Partitioning: 2.1, 2.2 (pages
- Naive algorithm for computing diagonals. How many can there
- Naive algorithm for triangulating, based on
- O(n log n) triangulation algorithms, base don monotone
partioning and trapezoidalization. Plan.
- Monotone partioning. Triangulating a monotone polygon in
- Trapezoidalization: plane sweep. Constructing a
trapezoidalization in O(n log n) time.
Last modified February 17, 2000.