The convex hull of freeform surfaces

Academic Article

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.
  • Authors

    Published In

  • Computing  Journal
  • Digital Object Identifier (doi)

    Author List

  • Seong JK; Elber G; Johnstone JK; Kim MS
  • Start Page

  • 171
  • End Page

  • 183
  • Volume

  • 72
  • Issue

  • 1-2