Work Note 4, DM819, fall 2011
Lecture September 15
-
Linear programming (sections 4.0 - 4.5).
Exercises September 20
-
Exercises 3.1, 3.2, 3.3, 3.6, 3.11, 3.13.
-
Will algorithm MAKEMONOTONE
divide a simple polygon up into
the smallest number of y-monotone polygons possible?
Prove that it does or find an example where it does not.
Last modified: Tue Sep 6 16:18:22 CEST 2011
Kim Skak Larsen
(kslarsen@imada.sdu.dk)