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.
The Jarvis March Convex Hull Method:
Chan's Simple Output-Sensitive Convex Hull Algorithm (mostly for
Divide-and-conquer convex hulls:
Upper hull binary search.
Reading Section 1-3 in the following paper gives the binary search
The Four Color Theorem:
3D Convex Hulls:
Goodrich's Home Page.