The convex hull of freeform surfaces

We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of nding 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...

Full description

Saved in:

Bibliographic Details
Published in:	Computing 2004-04, Vol.72 (1-2), p.171-183
Main Authors:	SEONG, J.-K, ELBER, G, JOHNSTONE, J. K, KIM, M.-S
Format:	Article
Language:	eng
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Computer science control theory systems Exact sciences and technology Geometry Mathematical analysis Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Numerical analysis Numerical analysis. Scientific computation Numerical controls Sciences and techniques of general use Studies Theoretical computing
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of nding 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. [PUBLICATION ABSTRACT]
ISSN:	0010-485X 1436-5057