#### CSC274b

Spring 1998

Ileana Streinu

#
Lecture 15

#### Friday, March 6, 1998

- Finding tangents to convex hulls.
- Simple point location: point inside/outside convex polygon.
- Incremental algorithm: amortized analysis.
- Divide and conquer paradigm (idea only, as in merge
sort). How could be applied to convex hulls (general idea only).
- Reading: textbook, ch. 3.

Last modified January 26, 1998.