Triangular spline algorithms (Q1074289)

Triangular splines were first considered in CAGD by M. Sabin (Dissertation. Hung. Academy of Science, Budapest, 1977). He considered what he called ''B-splines'' by repeated convolutions with the unit pulse. Sabin's B-splines were later found to be the box splines of de Boor and DeVore, and de Boor and Höllig [cf. \textit{W. Dahmen} and \textit{C. Micchelli}, ibid. 1, 115-129 (1984; Zbl 0581.65011)]. The purpose of this paper is to give three algorithms for calculating bivariate box splines and their linear combinations, namely: a Mansfield-like recursion formula, the refinement of the control net, and the Bézier net. The last two nets are generated by ''filling and averaging procedures''.