Thursday, Feb.10, 2000
- Cinderella - an introduction.
- Finish proof: the dual of a triangulation is a tree. Prove:
no cycles (by contradiction); connected (by induction).
- Finish 3-coloring proof: induction, using the ear-theorem.
- Implementation issues:
- How to compute area of a triangle - determinant formula.
- Left/righ turns, using area.
- How to compute whether two segments cross or not.
Last modified February 15, 2000.