- 1.0. Short introduction.
- 1.1. Basic data structures:
- triangulations, polygons and polyhedra, Euler's formula, complexity.
- 1.2. Duality.
- 1.3. Convex hulls:
- algorithms, complexity, lower bounds, predicates.
- -- TD:
- convex hull calculation in 2D + some nice application (TBA).
Steve Y. Oudot
2009-03-27