Trigonometric and hyperbolic B-splines can be computed via recurrence relations analogous to the classical polynomial B-splines. However, in their original formulation, these two types of B-splines do not form a partition of unity and consequently do not admit the notion of control polygons with the convex hull property for design purposes. In this paper, we look into explicit expressions for their normalization and provide a recursive algorithm to compute the corresponding normalization weights. As example application, we consider the exact representation of a circle in terms of C^{2n-1} trigonometric B-splines of order m = 2n+1 >= 3, with a variable number of control points. We also illustrate the approximation power of trigonometric and hyperbolic splines.
Speleers, H. (2025). On the normalization of trigonometric and hyperbolic B-splines. ADVANCES IN COMPUTATIONAL MATHEMATICS, 51(6) [10.1007/s10444-025-10252-w].
On the normalization of trigonometric and hyperbolic B-splines
Speleers H.
2025-01-01
Abstract
Trigonometric and hyperbolic B-splines can be computed via recurrence relations analogous to the classical polynomial B-splines. However, in their original formulation, these two types of B-splines do not form a partition of unity and consequently do not admit the notion of control polygons with the convex hull property for design purposes. In this paper, we look into explicit expressions for their normalization and provide a recursive algorithm to compute the corresponding normalization weights. As example application, we consider the exact representation of a circle in terms of C^{2n-1} trigonometric B-splines of order m = 2n+1 >= 3, with a variable number of control points. We also illustrate the approximation power of trigonometric and hyperbolic splines.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
