The Convex Hull of Freeform Surfaces

We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equations; using these zero-sets we characterize developable surface patches and planar patches that belong to the boundary of the convex hull. AMS Subject Classification: 65D17, 68U07, 68U05.

• Type: Journal
• Year: 2004
• Where: COMPUTING
• Authors: Joon-Kyung Seong, Gershon Elber, John K. Johnstone, Myung-Soo Kim
• Keywords: COMPUTING 2004, Convex Hull, Convex Hull Problem, Developable Surface Patches