Computational Geometry Auxiliary Notes
Please find below auxiliary content and notes that are in addition to
material that is found in the textbook. Note: some of the links on
this page are
only accessible through online libraries that are restricted to
campus computers. So please view this page from a campus computer or
through a campus VPN.
Additional Readings:

The Jarvis March Convex Hull Method:

Chan's Simple OutputSensitive Convex Hull Algorithm (mostly for
cs266 students):

Divideandconquer convex hulls:

Upper hull binary search.
Reading Section 13 in the following paper gives the binary search
method:

The Four Color Theorem:

Polygon triangulation:

Range trees:

Point location:

3D Convex Hulls:
Goodrich's Home Page.