共查询到20条相似文献,搜索用时 31 毫秒
1.
Subdivision schemes provide the most efficient and effective way to design and render smooth spatial curves. It is well known that among the most popular schemes are the de Rham–Chaikin and Lane–Riesenfeld subdivision schemes, that can be readily formulated by direct applications of the two-scale (or refinement) sequences of the quadratic and cubic cardinal B-splines, respectively. In more recent works, semi-orthogonal and bi-orthogonal spline-wavelets have been integrated to curve subdivision schemes to add such powerful tools as automatic level-of-detail control algorithm for curve editing and rendering, and efficient simulation processing scheme for global graphic illumination and animation. The objective of this paper is to introduce and construct a family of spline-wavelets to overcome the limitations of semi-orthogonal and bi-orthogonal spline-wavelets for these and other applications, by adding flexibility to the enhancement of desirable characters without changing the sweep of the subdivision spline curve, by providing the shortest lowpass and highpass filter pairs without decreasing the discrete vanishing moments, and by assuring robust stability. 相似文献
2.
Binary 3-point scheme, developed by Hormann and Sabin [Hormann, K. and Sabin, Malcolm A., 2008, A family of subdivision schemes with cubic precision, Computer Aided Geometric Design, 25, 41-52], has been modified by introducing a tension parameter which generates a family of C1 limiting curves for certain range of tension parameter. Ternary 3-point scheme, introduced by Siddiqi and Rehan [Siddiqi, Shahid S. and Rehan, K., 2009, A ternary three point scheme for curve designing, International Journal of Computer Mathematics, In Press, DOI: 10.1080/00207160802428220], has also been modified by introducing a tension parameter which generates family of C1 and C2 limiting curves for certain range of tension parameter. Laurent polynomial method is used to investigate the continuity of the subdivision schemes. The performance of modified schemes has been demonstrated by considering different examples along with its comparison with the established subdivision schemes. 相似文献
3.
Families of parameter dependent univariate and bivariate subdivision schemes are presented in this paper. These families are new variants of the Lane-Riesenfeld algorithm. So the subdivision algorithms consist of both refining and smoothing steps. In refining step, we use the quartic B-spline based subdivision schemes. In smoothing step, we average the adjacent points. The bivariate schemes are the non-tensor product version of our univariate schemes. Moreover, for odd and even number of smoothing steps, we get the primal and dual schemes respectively. Higher regularity of the schemes can be achieved by increasing the number of smoothing steps. These schemes can be nicely generalized to contain local shape parameters that allow the user to adjust locally the shape of the limit curve/surface. 相似文献
4.
Costanza Conti Luca Gemignani Lucia Romani 《Advances in Computational Mathematics》2011,35(2-4):217-241
In this paper we describe a general, computationally feasible strategy to deduce a family of interpolatory non-stationary subdivision schemes from a symmetric non-stationary, non-interpolatory one satisfying quite mild assumptions. To achieve this result we extend our previous work (Conti et al., Linear Algebra Appl 431(10):1971?C1987, 2009) to full generality by removing additional assumptions on the input symbols. For the so obtained interpolatory schemes we prove that they are capable of reproducing the same space of exponential polynomials as the one generated by the original approximating scheme. Moreover, we specialize the computational methods for the case of symbols obtained by shifted non-stationary affine combinations of exponential B-splines, that are at the basis of most non-stationary subdivision schemes. In this case we find that the associated family of interpolatory symbols can be determined to satisfy a suitable set of generalized interpolating conditions at the set of the zeros (with reversed signs) of the input symbol. Finally, we discuss some computational examples by showing that the proposed approach can yield novel smooth non-stationary interpolatory subdivision schemes possessing very interesting reproduction properties. 相似文献
5.
A criterion of convergence for stationary nonuniform subdivision schemes is provided. For periodic subdivision schemes, this criterion is optimal and can be applied to Hermite subdivision schemes which are not necessarily interpolatory. For the Merrien family of Hermite subdivision schemes which involve two parameters, we are able to describe explicitly the values of the parameters for which the Hermite subdivision scheme is convergent. 相似文献
6.
In this paper we develop tools for the analysis of net subdivision schemes, schemes which recursively refine nets of bivariate continuous functions defined on grids of lines, and generate denser and denser nets. Sufficient conditions for the convergence of such a sequence of refined nets, and for the smoothness of the limit function, are derived in terms of proximity to a bivariate linear subdivision scheme refining points, under conditions controlling some aspects of the univariate functions of the generated nets. Approximation orders of net subdivision schemes, which are in proximity with positive schemes refining points are also derived. The paper concludes with the construction of a family of blending spline-type net subdivision schemes, and with their analysis by the tools presented in the paper. This family is a new example of net subdivision schemes generating C1 limits with approximation order 2. 相似文献
7.
一类新的细分曲线方法 总被引:6,自引:1,他引:5
Subdivision defines a smooth curve or surface as the limit of a sequence of successive refinements based on initial control polygon or grid.Usually the curve refinements is the basis of the corresponding surface rules. In this paper we analyze previous subdivision scheme according to theories about convergence of N.Dyn and M.F Hassan. In terms of binary and ternary subdivision schemes general construction about curve‘s refinements are studied.Two approximating curve subdivision schemes with neighboring four control points are derived,the generating limit curves can both reach the smoothness of C^1 over the initial polygon using the two schemes and the tolerances of them are given according to the method of [7]. 相似文献
8.
9.
In this work we construct subdivision schemes refining general subsets of ? n and study their applications to the approximation of set-valued functions. Differently from previous works on set-valued approximation, our methods are developed and analyzed in the metric space of Lebesgue measurable sets endowed with the symmetric difference metric. The construction of the set-valued subdivision schemes is based on a new weighted average of two sets, which is defined for positive weights (corresponding to interpolation) and also when one weight is negative (corresponding to extrapolation). Using the new average with positive weights, we adapt to sets spline subdivision schemes computed by the Lane–Riesenfeld algorithm, which requires only averages of pairs of numbers. The averages of numbers are then replaced by the new averages of pairs of sets. Among other features of the resulting set-valued subdivision schemes, we prove their monotonicity preservation property. Using the new weighted average of sets with both positive and negative weights, we adapt to sets the 4-point interpolatory subdivision scheme. Finally, we discuss the extension of the results obtained in metric spaces of sets, to general metric spaces endowed with an averaging operation satisfying certain properties. 相似文献
10.
Carolina Beccari 《Journal of Computational and Applied Mathematics》2011,235(16):4754-4769
Starting from a well-known construction of polynomial-based interpolatory 4-point schemes, in this paper we present an original affine combination of quadratic polynomial samples that leads to a non-uniform 4-point scheme with edge parameters. This blending-type formulation is then further generalized to provide a powerful subdivision algorithm that combines the fairing curve of a non-uniform refinement with the advantages of a shape-controlled interpolation method and an arbitrary point insertion rule. The result is a non-uniform interpolatory 4-point scheme that is unique in combining a number of distinctive properties. In fact it generates visually-pleasing limit curves where special features ranging from cusps and flat edges to point/edge tension effects may be included without creating undesired undulations. Moreover such a scheme is capable of inserting new points at any positions of existing intervals, so that the most convenient parameter values may be chosen as well as the intervals for insertion.Such a fully flexible curve scheme is a fundamental step towards the construction of high-quality interpolatory subdivision surfaces with features control. 相似文献
11.
Carolina Vittoria Beccari Giulio Casciola Lucia Romani 《BIT Numerical Mathematics》2011,51(4):781-808
In this paper we present a family of Non-Uniform Local Interpolatory (NULI) subdivision schemes, derived from compactly supported
interpolatory fundamental splines with non-uniform knots (NULIFS). 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 achieve special shape features by simply moving each auxiliary knot between the break points. 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 fundamental 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 double and triple knots—that are not considered by
the authors of 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. 相似文献
12.
In this paper,we propose a three point approximating subdivision scheme,with three shape parameters,that unifies three different existing three point approximating schemes.Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed.The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling. 相似文献
13.
In this work we construct three novel families of approximating subdivision schemes that generate piecewise exponential polynomials and we show how to convert these into interpolating schemes of great interest in curve design for their ability to reproduce important analytical shapes and to provide highly smooth limit curves with a controllable tension. 相似文献
14.
Baojun LiBo Li Xiuping Liu Zhixun SuBowen Yu 《Journal of Computational and Applied Mathematics》2011,236(5):906-915
This paper presents a new method for exact evaluation of a limit surface generated by stationary interpolatory subdivision schemes and its associated tangent vectors at arbitrary rational points. The algorithm is designed on the basis of the parametric m-ary expansion and construction of the associated matrix sequence. The evaluation stencil of the control points on the initial mesh is obtained, through computation, by multiplying the finite matrices in a sequence corresponding to the expansion sequence and eigendecomposition of the contractive matrix related to the period of rational numbers. The method proposed in this paper works for other non-polynomial subdivision schemes as well. 相似文献
15.
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.
16.
Costanza Conti Luca Gemignani Lucia Romani 《Advances in Computational Mathematics》2013,39(2):395-424
This paper describes an algebraic construction of bivariate interpolatory subdivision masks induced by three-directional box spline subdivision schemes. Specifically, given a three-directional box spline, we address the problem of defining a corresponding interpolatory subdivision scheme by constructing an appropriate correction mask to convolve with the three-directional box spline mask. The proposed approach is based on the analysis of certain polynomial identities in two variables and leads to interesting new interpolatory bivariate subdivision schemes. 相似文献
17.
18.
Hermite subdivision schemes have been studied by Merrien, Dyn, and Levin
and they appear to be very different from subdivision schemes analyzed before since the rules depend on the subdivision level.
As suggested by Dyn and Levin, it is possible to transform the initial scheme into a uniform stationary vector subdivision
scheme which can be handled more easily.With this transformation, the study of convergence of Hermite subdivision schemes
is reduced to that of vector stationary subdivision schemes. We propose a first criterion for C0-convergence for a large class of vector subdivision schemes. This gives a criterion for C1-convergence of Hermite subdivision schemes. It can be noticed that these schemes do not have to be interpolatory. We conclude
by investigating spectral properties of Hermite schemes and other necessary/sufficient conditions of convergence. 相似文献
19.
In this paper we develop a novel approach to construct non-stationary subdivision schemes with a tension control parameter which can reproduce functions in a finite-dimensional subspace of exponential polynomials. The construction process is mainly implemented by solving linear systems for primal and dual subdivision schemes respectively, which are based on different parameterizations. We give the theoretical basis for the existence, uniqueness, and refinement rules of schemes proposed in this paper. The convergence and smoothness of the schemes are analyzed as well. Moreover, conics reproducing schemes are analyzed based on our theory, and a new idea that the tensor parameter ωk of the schemes can be adjusted for conics generation is proposed. 相似文献