Abstract
This paper is concerned with some efficient algorithms for the calculation of triangular splines. Their development is based on some different interpretations of a construction given by Malcolm Sabin in 1977 [Sabin 1977].
Similar content being viewed by others
References
P. Arner, M. Kaps, H. Prautzsch (1985): A program package for triangular spline surfaces, DF6 research report; Mathematics reports 07/14 (Comments), 07/15 (Programs), Technische Universität Braunschweig.
W. Boehm (1982):Generating the Bézier points of a triangular spline. In: Surfaces in GAGD (Barnhill and Boehm, eds.). Amsterdam: North-Holland, pp. 77–91.
W. Boehm (1983):Subdividing multivariate splines. Computer Aided Design,15:345–352.
W. Boehm (1985):Triangular spline algorithms. Computer Aided Geometric Design,2:61–68.
W. Boehm, G. Farin, J. Kahmann (1984):A survey of curve and surface methods in CAGD. Computer Aided Geometric Design,1:1–60.
E. Cohen, T. Lyche, R. Riesenfeld (1984):Discrete box splines and refinement algorithms. Computer Aided Geometric Design,2:131–148.
W. Dahmen, C. Micchelli (1984):Subdivision algorithms for the generation of boxspline surfaces. Computer Aided Geometric Design,2:115–129.
H. Prautzsch (1983/84):Unterteilungsalgorithmen für multivariate splines—Ein geometrischer Zugang. Dissertation. Braunschweig: Technische Universität.
H. Prautzsch (1985):The generation of box spline surfaces through quadrature. Mathematics Report 07/112. Braunschweig: Technische Universität.
M. Sabin (1977):The use of piecewise forms for the numerical representation of shape. Dissertation. Budapest: Hungarian Academy of Science.
Author information
Authors and Affiliations
Additional information
Communicated by Klaus Höllig.
Rights and permissions
About this article
Cite this article
Boehm, W., Prautzsch, H. & Arner, P. On triangular splines. Constr. Approx 3, 157–167 (1987). https://doi.org/10.1007/BF01890561
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01890561