Modeling Problems in Geometry and Discrete Mathematics
Section outline
-
We discuss geometric problems and problems that can be modelled in the language of graph theory and in the language of combinatorial optimization. After modelling the problems appropriately we discuss general and special solution techniques and algorithms that can be applied to these problems. Problems discussed will cover
- proving geometrical statements using techniques from algebra,
- the Shortest Path Problem, and
- the Bin Packing Problem.
-
Slides pp. 29-39
-
Slides pp. 40-46
-
Slides pp. 47-51
-
Slides pp. 52-53
-
Slides p. 54
-
Slides pp. 55-63
- proving geometrical statements using techniques from algebra,