In this paper we present a family of Non-Uniform Local Interpolatory (NULI) subdivision schemes, derived from compactly supported cardinal splines with non-uniform knots (NULICS). For this spline family, the knot partition is defined by a sequence of break points and by one additional knot, arbitrarily placed along each knot-interval. The resulting refinement algorithms are linear and turn out to contain a set of edge parameters that, when fixed to a value in the range [0,1], allow us to move each auxiliary knot to any position between the break points to simulate the behavior of the NULICS interpolants. Among all the members of this new family of schemes, we will then especially analyze the NULI 4-point refinement. This subdivision scheme has all the fundamental features of the quadratic cardinal spline basis it is originated from, namely compact support, C 1 smoothness, second order polynomials reproduction and approximation order 3. In addition the NULI 4-point subdivision algorithm has the possibility of setting consecutive edge parameters to simulate triple knots - that are not achievable when using the corresponding spline basis - thus allowing for limit curves with crease vertices, without using an ad hoc mask. Numerical examples and comparisons with other methods will be given to the aim of illustrating the performance of the NULI 4-point scheme in the case of highly non-uniform initial data.
C.Beccari, G.casciola, L.Romani (2011). Non-uniform interpolatory curve subdivision with edge parameters built upon compactly supported fundamental splines. BIT, 51(4), 781-808 [10.1007/s10543-011-0328-2].
Non-uniform interpolatory curve subdivision with edge parameters built upon compactly supported fundamental splines
BECCARI, CAROLINA VITTORIA;CASCIOLA, GIULIO;ROMANI, LUCIA
2011
Abstract
In this paper we present a family of Non-Uniform Local Interpolatory (NULI) subdivision schemes, derived from compactly supported cardinal splines with non-uniform knots (NULICS). For this spline family, the knot partition is defined by a sequence of break points and by one additional knot, arbitrarily placed along each knot-interval. The resulting refinement algorithms are linear and turn out to contain a set of edge parameters that, when fixed to a value in the range [0,1], allow us to move each auxiliary knot to any position between the break points to simulate the behavior of the NULICS interpolants. Among all the members of this new family of schemes, we will then especially analyze the NULI 4-point refinement. This subdivision scheme has all the fundamental features of the quadratic cardinal spline basis it is originated from, namely compact support, C 1 smoothness, second order polynomials reproduction and approximation order 3. In addition the NULI 4-point subdivision algorithm has the possibility of setting consecutive edge parameters to simulate triple knots - that are not achievable when using the corresponding spline basis - thus allowing for limit curves with crease vertices, without using an ad hoc mask. Numerical examples and comparisons with other methods will be given to the aim of illustrating the performance of the NULI 4-point scheme in the case of highly non-uniform initial data.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.