The Convex Hull of Freeform Surfaces

J.-K. Seong (), G. Elber (), J. K. Johnstone () and M.-S. Kim ()
Additional contact information
J.-K. Seong: Seoul National University, School of Computer Science and Engineering
G. Elber: Israel Institute of Technology, Dept. of Computer Science
J. K. Johnstone: University of Alabama at Birmingham, Dept. of Computer and Information Sciences
M.-S. Kim: Seoul National University, School of Computer Science and Engineering, Institute of Computer Technology

A chapter in Geometric Modelling, 2004, pp 171-183 from Springer

Abstract: 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.

Keywords: Convex hull; common tangent; zero-set finding; freeform rational surface; B-spline; symbolic computation; 65D17; 68U07; 68U05 (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7091-0587-0_14

Ordering information: This item can be ordered from
http://www.springer.com/9783709105870

DOI: 10.1007/978-3-7091-0587-0_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().