2013
DOI: 10.1007/s00211-013-0587-8
|View full text |Cite
|
Sign up to set email alerts
|

Reproduction of exponential polynomials by multivariate non-stationary subdivision schemes with a general dilation matrix

Abstract: We study scalar multivariate non-stationary subdivision schemes with a general dilation matrix. We characterize the capability of such schemes to reproduce exponential polynomials in terms of simple algebraic conditions on their symbols. These algebraic conditions provide a useful theoretical tool for checking the reproduction properties of existing schemes and for constructing new schemes with desired reproduction capabilities and other enhanced properties. We illustrate our results with several examples.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
45
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 43 publications
(45 citation statements)
references
References 36 publications
0
45
0
Order By: Relevance
“…Indeed, we provide the expressions of the inverse matrices of the linear systems arising by imposing the algebraic conditions for exponential polynomial reproduction. Such conditions were first given in [17] and successively extended to any arbitrary arity in [7]. We also show that, under the symmetry assumption on Γ (or on a subset of it), the symbol a (k) M,N,Γ (z) has the same symmetry as B (k) N,Γ (z).…”
Section: Introductionmentioning
confidence: 78%
See 1 more Smart Citation
“…Indeed, we provide the expressions of the inverse matrices of the linear systems arising by imposing the algebraic conditions for exponential polynomial reproduction. Such conditions were first given in [17] and successively extended to any arbitrary arity in [7]. We also show that, under the symmetry assumption on Γ (or on a subset of it), the symbol a (k) M,N,Γ (z) has the same symmetry as B (k) N,Γ (z).…”
Section: Introductionmentioning
confidence: 78%
“…The most popular examples of subdivision schemes are B-spline subdivision schemes and their nonstationary counterparts, namely exponential B-spline subdivision schemes (see, e.g., [16,43]), characterized by the property of representing polynomials and exponential polynomials, respectively. Since in many applicative areas the capability of representing shapes described by exponential polynomial functions is fundamental, interpolating and approximating subdivision schemes based on exponential B-splines and inheriting their generation properties, have been recently introduced (see, e.g., [2,3,5,7,13,14,16,17,28,35,39]). We recall that, while the term generation usually refers to the subdivision scheme capability of providing specific types of limit functions, with reproduction we mean the capability of a subdivision scheme to reproduce in the limit exactly the same function from which the data are sampled.…”
Section: Introductionmentioning
confidence: 99%
“…Using this proposition, we deduce that, for n ∈ [n 0 , N], the convolution product β αn\αn 0 * β αn 0 (16) preserves the exponential reproduction properties of β αn 0 . Note that in (16), the term β αn 0 \αn 0 = 1.…”
Section: Proposition (Unser and Blumentioning
confidence: 81%
“…This convenient property is particularly relevant for the exact rendering of conic sections such as circles, ellipses, or parabolas, as well as other trigonometric and hyperbolic curves and surfaces [13]. In its absence, one must resort to subdivision to tackle this aspect [14][15][16][17][18]. However, existing comparable subdivision schemes usually rely on basis functions that are defined as a limit process and do not have a closed-form expression [19].…”
Section: Introductionmentioning
confidence: 99%
“…As opposed to polygon mesh models, subdivision methods do not necessarily have interpolating control points. Different methods based on nonstationary refinement rules have been proposed to approximate spheres using subdivision [27][28][29]. One drawback of polygon and subdivision methods is that they require a large number of parameters which can be a challenge when computational speed is important (e.g., in finite element models [30]).…”
Section: Discrete Closed Surfacesmentioning
confidence: 99%