C1 Quadratic Interpolation over Arbitrary Point Sets
- 1 November 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 7 (11), 8-16
- https://doi.org/10.1109/mcg.1987.277064
Abstract
New formulas for generating smooth surfaces over arbitrarily spaced data points are developed. The formulas are based on quadratic polynomials for the construction of derivative continuous surfaces rather than on the cubic polynomials generally used. The technique is based on a subdivision procedure, dividing each triangle in a triangulation of the data points into six subtriangles and fitting a quadratic Bezier surface patch over each subtriangle. THe formulas require only function and first derivative values at the data points and are easily evaluated in terms of the Bezier coefficients. Since two-dimensional quadratic polynomials contain only six terms, while 10 terms are required to evaluate a cubic, the new procedure significantly improves the efficiency of algorithms for drawing surfaces in computer-aided geometric design.Keywords
This publication has 5 references indexed in Scilit:
- Steiner Surface PatchesIEEE Computer Graphics and Applications, 1985
- A survey of curve and surface methods in CAGDComputer Aided Geometric Design, 1984
- Designing C1 surfaces consisting of triangular cubic patchesComputer-Aided Design, 1982
- A seamed quadratic element for contouringThe Computer Journal, 1981
- Piecewise Quadratic Approximations on TrianglesACM Transactions on Mathematical Software, 1977