CSC274b
Spring 1998
Ileana Streinu
Lecture 20
Tuesday, April 11, 2000
- Euler's formula.
- Convex hulls in 3d: algorithms.
Applet.
- Incremental algorithm, gift wraping, divide-and-conquer, QuickHull.
- If time allows: Implementation. Data structures for polyhedral boundary
(planar graphs).
- Reading: textbook, Ch. 4.
Last modified April 6, 2000.