We study the necessary and sufficient conditions for the generation of polynomials by stationary subdivision schemes, and we show how to derive appropriate quasi-interpolation rules that have the optimal approximation order. We show that these conditions hold in the context of non-uniform subdivisio
Analysis of quasi-uniform subdivision
β Scribed by Adi Levin; David Levin
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 173 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1063-5203
No coin nor oath required. For personal study only.
β¦ Synopsis
We study the smoothness of quasi-uniform bivariate subdivision. A quasi-uniform bivariate scheme consists of different uniform rules on each side of the y-axis, far enough from the axis, some different rules near the y-axis, and is uniform in the y-direction. For schemes that generate polynomials up to degree m, we derive a sufficient condition for C m continuity of the limit function, which is simple enough to be used in practice. It amounts to showing that the joint spectral radius of a certain pair of matrices has to be less than 2 -m . We also relate the HΓΆlder exponent of the mth order derivatives to that joint spectral radius. The main tool is an extension of existing analysis techniques for uniform subdivision schemes, although a different proof is required for the quasi-uniform case. The same idea is also applicable to the analysis of quasi-uniform subdivision processes in higher dimension. Along with the analysis we present a 'tri-quad' scheme, which is combined of a scheme on a triangular grid on the half plane x < 0 and a scheme on a square grid on the other half plane x > 0 and special rules near the y-axis. Using the new analysis tools it is shown that the tri-quad scheme is globally C 2 .
π SIMILAR VOLUMES
This paper presents a new scheme for subdivision surfaces based on four-directional meshes. It combines geometry-sensitive refinement with convolution smoothing. The scheme has a simple, efficient implementation and generates smooth well-shaped meshes.
Let u,(G) denote the number of cycles of length k in a graph G. In this paper, we first prove that if G and H are X-equivalent graphs, then ak(G) = a,(H) for all k with g < k < $g -2, where g is the girth of G. This result will then be incorporated with a structural theorem obtained in [7] to show t