An implementation of triangular B-spline surfaces over arbitrary triangulations. (English) Zbl 0781.65010
The authors try to illustrate the new triangular \(B\)-spline scheme developed by W. Dahmen, C. A. Micchelli and the second author [Math. Comput. 59, No. 199, 97-115 (1992; Zbl 0757.41014)] and based on blending functions and control vertices. The scheme exhibits both affine invariance and the convex hull property, and the control points can be used to manipulate the shape of the surface locally. Several examples are given for this algorithm.
Reviewer: A.López-Carmona (Granada)
MSC:
| 65D17 | Computer-aided design (modeling of curves and surfaces) |
Keywords:
\(B\)-spline surfaces; blossoming; triangular \(B\)-spline scheme; blending functions; control vertices; convex hull propertyCitations:
Zbl 0757.41014References:
| [1] | Averbach, S., Approximation and geometric modeling with simplex B-splines associated with irregular triangles, Computer Aided Geometric Design, 8, 67-87 (1991) · Zbl 0715.65010 |
| [2] | Dahmen, W.; Micchelli, C. A., On the linear independence of multivariate B-splines I. Triangulations of simploids, SIAM J. Numer. Anal., 19, 993-1012 (1982) · Zbl 0498.41004 |
| [3] | Dahmen, W.; Micchelli, C. A., Recent progress in multivariate splines, (Approximation Theory IV (1983), Academic Press: Academic Press New York), 27-121 · Zbl 0559.41011 |
| [4] | Dahmen, W.; Micchelli, C. A.; Seidel, H.-P., Blossoming begets B-splines built better by B-patches, Math. Comp., 59, 97-115 (1992) · Zbl 0757.41014 |
| [5] | de Casteljau, P., Formes á Pôles (1985), Hermes: Hermes Paris |
| [6] | Fong, P., Shape control for B-splines over arbitrary triangulations, Master’s thesis (1992), University of Waterloo: University of Waterloo Waterloo, Canada |
| [7] | Gmelig Meyling, R. H.J., Polynomial spline approximation in two variables, Ph.D. thesis (1986), University of Amsterdam · Zbl 0552.65012 |
| [8] | Grandine, T. A., The stable evaluation of multivariate simplex splines, Math. Comp., 50, 197-205 (1988) · Zbl 0663.41014 |
| [9] | Höllig, K., Multivariate splines, SIAM J. Numer. Anal., 19, 1013-1031 (1982) · Zbl 0497.41007 |
| [10] | Micchelli, C. A., On a numerically efficient method for computing with multivariate B-splines, (Schempp, W.; Zeller, K., Multivariate Approximation Theory (1979), Birkhäuser: Birkhäuser Basel), 211-248 · Zbl 0422.41008 |
| [11] | Neamtu, M., A Contribution to the theory and practice of multivariate splines, Ph.D. thesis (1991), University of Twente: University of Twente Enschede |
| [12] | Ramshaw, L., Blossoming: a connect-the-dots approach to splines, Technical report (1987), Digital Systems Research Center: Digital Systems Research Center Palo Alto, CA |
| [13] | Ramshaw, L., Blossoms are polar forms, Computer Aided Geometric Design, 6, 323-358 (1989) · Zbl 0705.65008 |
| [14] | Seidel, H.-P., Polar forms and triangular B-spline surfaces, (Blossoming: The New Polar-Form Approach to Spline Curves and Surfaces, Vol. 26 (1991), ACM SIGGRAPH), 8.1-8.52, SIGGRAPH ’91 Course Notes |
| [15] | Seidel, H.-P., Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles, Constr. Approx., 7, 257-279 (1991) · Zbl 0733.41018 |
| [16] | Seidel, H.-P., Representing piecewise polynomials as linear combinations of multivariate B-splines, (Lyche, T.; Schumaker, L. L., Curves and Surfaces (1992), Academic Press: Academic Press New York), 559-566 |
| [17] | Traas, C. R., Practice of bivariate quadratic simplicial splines, (Dahmen, W.; Gasca, M.; Micchelli, C. A., Computation of Curves and Surfaces (1990), Kluwer: Kluwer Dordrecht), 383-422, NATO ASI Series · Zbl 0694.41020 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
