Bivariate interpolatory Hermite subdivision schemes have recently been applied to build free-form subdivision surfaces. It is well known to geometric modelling practitioners that interpolatory schemes typically lead to ``unfair" surfaces--surfaces with unwanted wiggles or undulations--and noninterpolatory (a.k.a. approximating in the CAGD community) schemes are much preferred in geometric modelling applications. In this article, we introduce, analyze and construct noninterpolatory Hermite subdivision schemes, a class of vector subdivision schemes which can be applied to iteratively refine Hermite data in a not necessarily interpolatory fashion. We also study symmetry properties of such subdivision schemes which are crucial for application in free-form subdivision surfaces.
A key step in our mathematical analysis of Hermite type subdivision schemes is that we make use of the strong convergence theory of refinement equations to convert a prescribed geometric condition on the subdivision scheme--namely, the subdivision scheme is of Hermite type--to an algebraic condition on the subdivision mask. The latter algebraic condition can then be used in a computational framework to construct specific schemes.
In this paper, a subdivision scheme which generalizes a surface scheme in previous papers to volume meshes is designed. The scheme exhibits significant control over shrink-age/size of volumetric models. It also has the ability to conveniently incorporate boundaries and creases into a smooth limit shape of models. The method presented here is much simpler and easier as compared to MacCracken and Joy‘s. This method makes no restrictions on the local topology of meshes. Particularly, it can be applied without any change to meshes of nonmanifold topology. 相似文献
This paper is concerned with multivariate refinement equations of the type where (?) is the unknown function defined on the s-dimensional Euclidean space Rs, a is a finitely supported nonnegative sequence on Zs, and M is an s×s dilation matrix with m := |detM|. We characterize the existence of L2-solution of refinement equation in terms of spectral radius of a certain finite matrix or transition operator associated with refinement mask a and dilation matrix M. For s = 1 and M = 2, the sufficient and necessary conditions are obtained to characterize the existence of continuous solution of this refinement equation. 相似文献
AbstractThe well-known Jahn-Graef-Younes algorithm, proposed by Jahn in 2006, generates all minimal elements of a finite set with respect to an ordering cone. It consists of two Graef-Younes procedures, namely the forward iteration, which eliminates a part of the non-minimal elements, followed by the backward iteration, which is applied to the reduced set generated by the previous iteration. Without using the backward iteration, we develop new algorithms that also compute all minimal elements of the initial set, by combining the forward iteration with certain sorting procedures based on cone-monotone functions. In particular, when the ordering cone is polyhedral, computational results obtained in MATLAB allow us to compare our algorithms with the Jahn-Graef-Younes algorithm, within a bi-objective optimization problem. 相似文献
We consider solutions of a system of refinement equations written in the form
where the vector of functions is in and is a finitely supported sequence of matrices called the refinement mask. Associated with the mask is a linear operator defined on by . This paper is concerned with the convergence of the subdivision scheme associated with , i.e., the convergence of the sequence in the -norm.
Our main result characterizes the convergence of a subdivision scheme associated with the mask in terms of the joint spectral radius of two finite matrices derived from the mask. Along the way, properties of the joint spectral radius and its relation to the subdivision scheme are discussed. In particular, the -convergence of the subdivision scheme is characterized in terms of the spectral radius of the transition operator restricted to a certain invariant subspace. We analyze convergence of the subdivision scheme explicitly for several interesting classes of vector refinement equations.
Finally, the theory of vector subdivision schemes is used to characterize orthonormality of multiple refinable functions. This leads us to construct a class of continuous orthogonal double wavelets with symmetry.
Abstract. Subdivision with finitely supported masks is an efficient method to create discrete multiscale representations of smooth
surfaces for CAGD applications. Recently a new subdivision scheme for triangular meshes, called
-subdivision , has been studied. In comparison to dyadic subdivision, which is based on the dilation matrix 2I ,
-subdivision is based on a dilation M with det M=3 . This has certain advantages, for example, a slower growth for the number of control points.
This paper concerns the problem of achieving maximal sum rule orders for stationary
-subdivision schemes with given mask support, which is important because the sum rule order characterizes the order of the
polynomial reproduction, and provides an upper bound on the Sobolev smoothness of the surface. We study both interpolating
and approximating schemes for a natural family of symmetric mask support sets related to squares of sidelength 2n in Z2 , and obtain exact formulas for the maximal sum rule order for arbitrary n . For approximating schemes, the solution is simple, and schemes with maximal sum rule order are realized by an explicit
family of schemes based on repeated averaging [15].
In the interpolating case, we use properties of multivariate Lagrange polynomial interpolation to prove the existence of
interpolating schemes with maximal sum rule orders. These can be found by solving a linear system which can be reduced in
size by using symmetries. From this, we construct some new examples of smooth (C2,C3 ) interpolating
-subdivision schemes with maximal sum rule order and symmetric masks. The construction of associated dual schemes is also
discussed. 相似文献
Geometric wavelet-like transforms for univariate and multivariate manifold-valued data can be constructed by means of nonlinear stationary subdivision rules which are intrinsic to the geometry under consideration. We show that in an appropriate vector bundle setting for a general class of interpolatory wavelet transforms, which applies to Riemannian geometry, Lie groups and other geometries, Hölder smoothness of functions is characterized by decay rates of their wavelet coefficients. 相似文献