A Hermite interpolatory subdivision scheme for C2C^2-quintics on the Powell-Sabin 12-split

In order to construct a $C^1$-quadratic spline over an arbitrary triangulation, one can split each triangle into 12 subtriangles, resulting in a finer triangulation known as the Powell-Sabin 12-split. It has been shown previously that the corresponding spline surface can be plotted quickly by means of a Hermite subdivision scheme. In this paper we introduce a nodal macro-element on the 12-split for the space of quintic splines that are locally $C^3$ and globally $C^2$. For quickly evaluating any such spline, a Hermite subdivision scheme is derived, implemented, and tested in the computer algebra system Sage. Using the available first derivatives for Phong shading, visually appealing plots can be generated after just a couple of refinements.Comment: 17 pages, 7 figure

B-spline-like bases for C2C^2 cubics on the Powell-Sabin 12-split

For spaces of constant, linear, and quadratic splines of maximal smoothness on the Powell-Sabin 12-split of a triangle, the so-called S-bases were recently introduced. These are simplex spline bases with B-spline-like properties on the 12-split of a single triangle, which are tied together across triangles in a B\'ezier-like manner. In this paper we give a formal definition of an S-basis in terms of certain basic properties. We proceed to investigate the existence of S-bases for the aforementioned spaces and additionally the cubic case, resulting in an exhaustive list. From their nature as simplex splines, we derive simple differentiation and recurrence formulas to other S-bases. We establish a Marsden identity that gives rise to various quasi-interpolants and domain points forming an intuitive control net, in terms of which conditions for $C^0$-, $C^1$-, and $C^2$-smoothness are derived

A note on the Oslo algorithm

Journal ArticleThe Oslo algorithm is a recursive method for updating the B-spline representation of a curve or tensor product surface when extra knots are added. In the present note the derivation of this method is simplified

On the p-norm condition number of the multivariate triangular Bernstein basis

AbstractWe show that the p-norm condition number of the s-variate triangular Bernstein basis for polynomials of degree n grows at most as O(ns2n) for fixed s and increasing n. This is essentially the same growth as has already been established in the univariate case

C1C^1 Interpolatory Subdivision with Shape Constraints for Curves

International audienceWe derive two reformulations of the $C^1$ Hermite subdivision scheme introduced in [12]. One where we separate computation of values and derivatives and one based of refinement of a control polygon. We show that the latter leads to a subdivision matrix which is totally positive. Based on this we give algorithms for constructing subdivision curves that preserve positivity, monotonicity, and convexity