Gift Wrapping algorithm for 3D convex hull computation

[adamconkey]

Would like to implement a Gift-Wrapping algorithm for 3D convex hull computation, as described in O'Rourke 4.2.1. This is an $O(nF)$ algorithm for $F$ faces and is thus an output-size sensitive quadratic algorithm.

The details in O'Rourke are very sparse, so may find these resources helpful:

• O'Rourke lecture slides
• Chand and Kapur 1970 - one of the original papers on the algorithm.

[adamconkey]

I'm considering picking this one up first as the first 3D algorithm I'll implement. As such, it would come with a lot of requisite infrastructure for 3D and navigating that extension to the codebase. I considered doing that separately and trying to implement some 3D things prior to tackling an algorithm, but I suspect taking on an algorithm will make it more clear what is required and how things should be structured.