Abstract
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Seong, JK., Elber, G., Johnstone, J. et al. The Convex Hull of Freeform Surfaces. Computing 72, 171–183 (2004). https://doi.org/10.1007/s00607-003-0055-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-003-0055-x