DM819 - Computational Geometry
Spring 2021
Kim Skak Larsen
JavaScript skal være slået til for at denne side virker.
Home
Signing-Up
Official Course Description
Pizza Meeting Presentation
Latest Midterm Evaluation
Language Policy
Material
Lectures and Exercises
Literature
Exam
Contact
Schedule
Contact Information
☰
Exercises
Exercises 3.1, 3.2, 3.3, 3.6, 3.11, 3.13.
Will algorithm M
AKE
M
ONOTONE
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.
Data protection at SDU
▪
Databeskyttelse på SDU