Skip to main content
Log in

The Convex Hull of Freeform Surfaces

  • Published:
Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J.-K. Seong.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-003-0055-x

AMS Subject Classification

Keywords

Navigation