Presents a method for constructing tensor product Bezier surfaces from contour (cross-section) data. Minimal area triangulations are used to guide the surface construction, and the final surface reflects the optimality of the triangulation. The resulting surface differs from the initial triangulation in two important ways: it is smooth (as opposed to the piecewise planar triangulation), and it is in tensor product form (as opposed to the irregular triangular mesh). The surface reconstruction is efficient because we do not require an exact minimal surface. The triangulations are used as strong hints, but no more than that. The method requires the computation of both open and closed isoparametric curves of the surface, using triangulations as a guide. These isoparametric curves form a tensor product Bezier surface. We show how to control sampling density by filling and pruning isoparametric curves, for accuracy and economy. A rectangular grid of points is produced that is compatible with the expected format for a tensor product surface interpolation, so that a host of well-supported methods are available to generate and manipulate the surface.
[1]
Gerald E. Farin,et al.
Curves and surfaces for computer-aided geometric design - a practical guide, 4th Edition
,
1997,
Computer science and scientific computing.
[2]
S. Ganapathy,et al.
A new general triangulation method for planar contours
,
1982,
SIGGRAPH.
[3]
Gerald Farin,et al.
Curves and surfaces for computer aided geometric design
,
1990
.
[4]
Kenneth R. Sloan,et al.
Surfaces from contours
,
1992,
TOGS.
[5]
Donald P. Greenberg,et al.
An interactive computer graphics approach to surface representation
,
1977,
SIGGRAPH '77.
[6]
Henry Fuchs,et al.
Optimal surface reconstruction from planar contours
,
1977,
CACM.
[7]
Eric Keppel,et al.
Approximating Complex Surfaces by Triangulation of Contour Lines
,
1975,
IBM J. Res. Dev..
[8]
Thomas W. Sederberg,et al.
Conversion of complex contour line definitions into polygonal element mosaics
,
1978,
SIGGRAPH.