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.
Original language | English |
---|---|
Pages (from-to) | 171-183 |
Number of pages | 13 |
Journal | Computing (Vienna/New York) |
Volume | 72 |
Issue number | 1-2 |
DOIs | |
Publication status | Published - 2004 |
Externally published | Yes |
Keywords
- B-spline
- Common tangent
- Convex hull
- Freeform rational surface
- Symbolic computation
- Zero-set finding
ASJC Scopus subject areas
- Software
- Computational Mathematics
- Theoretical Computer Science
- Numerical Analysis
- Computer Science Applications
- Computational Theory and Mathematics