带法向约束的圆平均非线性细分曲线设计

目的 对采样设备获取的测量数据进行拟合,可实现原模型的重建及功能恢复。但有些情况下,获取的数据点不仅包含位置信息,还包含法向量信息。针对这一问题,本文提出了基于圆平均的双参数4点binary非线性细分法与单参数3点ternary插值非线性细分法。方法 首先将线性细分法改写为点的重复binary线性平均,然后用圆平均代替相应的线性平均,最后用加权测地线平均计算的法向量作为新插入顶点的法向量。基于圆平均的双参数4点binary细分法的每一次细分过程可分为偏移步与张力步。基于圆平均的单参数3点ternary细分法的每一次细分过程可分为左插步、插值步与右插步。结果 对于本文方法的收敛性与C¹连续性条件给出了理论证明;数值实验表明,与相应的线性细分相比,本文方法生成的曲线更光滑且具有圆的再生力,可以较好地实现3个封闭曲线重建。结论 本文方法可以在带法向量的初始控制顶点较少的情况下,较好地实现带法向约束的离散点集的曲线重建问题。     

A ‘subdivision regression’ model for data analysis

Subdivision schemes are multi-resolution methods used in computer-aided geometric design to generate smooth curves or surfaces. We propose two new models for data analysis and compression based on subdivision schemes:(a) The ‘subdivision regression’ model, which can be viewed as a special multi-resolution decomposition.(b) The ‘tree regression’ model, which allows the identification of certain patterns within the data. The paper focuses on analysis and mentions compression as a byproduct. We suggest applying certain criteria on the output of these models as features for data analysis. Differently from existing multi-resolution analysis methods, these new models and criteria provide data features related to the schemes (the filters) themselves, based on a decomposition of the data into different resolution levels, and they also allow analysing data of non-smooth functions and working with varying-resolution subdivision rules. Finally, applications of these methods for music analysis and other potential usages are mentioned.     

Calculation of dimensions of curves generated by subdivision schemes

Little attention has been paid to estimating dimensions of the curves generated by the subdivision algorithms. A unified method is proposed to estimate the dimension of curves generated by the arbitrary, stationary, linear subdivision schemes with given control points, based on a theorem about the Hausdorff dimension of iterated function systems. Several examples are given to demonstrate the implementation of the method, including the Koch curve, the uniform quadratic B-spline curve and the curves generated by the four-point binary and ternary interpolatory subdivision schemes with a free parameter. Compared with the method of the traditional iterated function system collage theorem, our algorithm overcomes the disadvantage of choosing points and collage, avoiding a large amount of calculation to find the contractive affine transformations and the contraction constants. Furthermore, we can calculate not only the dimension of the special curves with the geometric structure of self-similarity, but also the dimension of the curves generated by more general subdivision algorithms.     

B样条的p-nary细分

有关B样条曲线曲面的binary细分技巧及其应用的研究已经获得了许多成果,建立在B样条binary细分基础上的binary细分法收敛性连续性分析的生成多项式法就是其中之一。该文研究了B样条曲线的p-nary细分问题,给出并证明了B样条基函数的p尺度细分方程中细分系数的计算公式及其性质,讨论了用p-nary细分生成非有理及有理B样条曲线的细分规则。采用该文的方法可方便而快速地在计算机上绘制有理B样条曲线。文章的结果可用于对一般p-nary曲线细分法收敛性及连续性的分析。     

Smooth reverse subdivision

In this paper we present a new multiresolution framework that takes into consideration reducing the coarse points’ energy during decomposition. We start from initial biorthogonal filters to include energy minimization in multiresolution. Decomposition and reconstruction are main operations for any multiresolution representation. We formulate decomposition as smooth reverse subdivision, based on a least squares problem. Both approximation of overall shape and energy are taken into account in the least squares formulation through different weights.Using this method, significant smoothness in decomposition of curves and tensor product surfaces can be achieved; while their overall shape is preserved. Having smooth coarse points yields details with maximum characteristics. Our method works well with synthesizing applications in which re-using high-energy details is important. We use our method for finding the smooth reverse of three common subdivision schemes. We also provide examples of our method in curve synthesis and terrain synthesis applications.     

Subdivision models for varying-resolution and generalized perturbations

Subdivision schemes are multi-resolution methods used in computer-aided geometric design to generate smooth curves or surfaces. In this paper, we are interested in both smooth and non-smooth subdivision schemes. We propose two models that generalize the subdivision operation and can yield both smooth and non-smooth schemes in a controllable way:

• (1) The ‘varying-resolution’ model allows a structured access to the various resolutions of the refined data, yielding certain patterns. This model generalizes the standard subdivision iterative operation and has interesting interpretations in the geometrical space and also in creativity-oriented domains, such as music. As an infrastructure for this model, we propose representing a subdivision scheme by two dual rules trees. The dual tree is a permuted rules tree that gives a new operator-oriented view on the subdivision process, from which we derive an ‘adjoint scheme’.

• (2) The ‘generalized perturbed schemes’ model can be viewed as a special multi-resolution representation that allows a more flexible control on adding the details. For this model, we define the terms ‘template mask’ and ‘tension vector parameter’.

The non-smooth schemes are created by the permutations of the ‘varying-resolution’ model or by certain choices of the ‘generalized perturbed schemes’ model. We then present procedures that integrate and demonstrate these models and some enhancements that bear a special meaning in creative contexts, such as music, imaging and texture. We describe two new applications for our models: (a) data and music analysis and synthesis, which also manifests the usefulness of the non-smooth schemes and the approximations proposed, and (b) the acceleration of convergence and smoothness analysis, using the ‘dual rules tree’.     

Curve subdivision schemes for geometric modelling

A new binary four-point approximating subdivision scheme has been presented that generates the limiting curve of C ¹ continuity. A global tension parameter has been introduced to improve the performance of the binary four-point approximating subdivision scheme that generates a family of C ¹ limiting curves. The ternary four-point approximating subdivision scheme has also been introduced that generates a limiting curve of C ² continuity. The proposed schemes are close to being interpolating. The Laurent polynomial method has been used to investigate the order of derivative continuity of the schemes and Hölder exponents of the schemes have also been calculated. Performances of the subdivision schemes have been exposed by considering several examples.     

混合细分曲线及其应用

构造了2个混合细分模式,一个是基于三次B样条细分的二分混合细分曲线族;另一个是基于一种三分三点逼近细分的三分混合细分曲线族.通过调整混合参数来控制曲线的收缩与膨胀幅度,利用生成函数技术和特征值方法对这2个带参数的细分模式的连续性进行了严格的理论分析.最后,通过选择合适的混合参数给出了一种曲线保长的动态细分方法.     

基于三进制的loop细分方法

提出了一种基于三进制的loop细分算法。该算法主要是借鉴多分辨率分析中三进制双正交对称插值小波的形成原理,将三进制的概念引入到loop细分方法中,然后分析其细分矩阵,从而得到了三进制loop细分算法。实例表明,该算法能用较少的细分次数获得理想光滑的曲面,从而提高了细分的收敛速度。     

基于逆细分的自由曲线分解与重建*

针对自由曲线的多分辨率表示,选取了双参数Chaikin细分法,基于几何逆向思想提出了相应的逆细分算法,建立了双参数可控的自由曲线渐近分解规则,通过分析双参数对曲线分解的影响,寻找出最优分解参数值,实现了自由曲线的最优分解,通过渐近分解时建立的误差向量,最终实现了自由曲线的完全重建。该算法比以往方法构造过程简单,几何意义明显,易于推广到其他细分模式上。     

基于任意三角网格的ternary插值细分曲面造型及其分析

针对任意三角网格,提出一种简单有效且局部性更好的带参数的ternary插值曲面细分法,给出并证明了细分法收敛与G1连续的充分条件.在任意给定三角控制网格的条件下,可通过对形状参数的适当选择来实现对插值细分曲面形状的调整.     

双参数五点插值细分法

提出包含两个参数的五点ternary插值细分法。利用生成多项式等方法对细分法的一致收敛性,C K连续性进行了分析。讨论了参数对细分法的收敛性及连续性的影响,同时给出了细分法C0到C2连续的充分条件和数值算例。     

一类多参数的曲线细分格式

构造了一类收敛的多参数差分格式,根据细分格式和差分格式的关系以及连续性条件可得到任意阶连续的多参数曲线细分格式.通过选取合适的参数可以得到一些经典的曲线细分格式,如Chaikin格式、三次样条细分格式和四点插值格式等;同时设计了一种C1连续的不对称三点插值格式,可以生成不对称的极限曲线.给出了同阶差分格式线性组合的性质,从而可设计出更多收敛的多参数曲线细分格式.     

细分参数对细分曲线形状的控制作用分析

多数有关细分法的文献侧重于研究细分法的构造、收敛性光滑性分析及其在光滑曲线曲面造型中的应用,少有文献致力于细分参数对细分曲线形状影响的理论分析。首先引入仿射坐标的观点,从几何直观的角度对三点ternary插值细分法中细分参数的几何意义进行研究。接着通过对细分法的C0和C1参数域及新顶点域的等价描述,从理论化的角度对细分参数对细分曲线形状的局部和整体控制作用进行分析,描述它们对细分曲线行为的影响。在给定初始数据的条件下,可通过对形状参数的适当选择来有的放矢地实现对三点ternary插值细分曲线曲面的形状调整和控制。该结果可用于工业领域中产品的外形设计及形状控制。     

半静态回插细分方法

根据传统静态细分方法的不足,提出一类新颖的半静态回插细分方法.结合统一的细分框架、半静态控制和回插补偿三者的优势,基于细分算子的观点,分别给出了曲线和曲面情况的细分规则,并对其极限性质作出讨论.按照该方法,可以在不改变控制顶点的情况下,构造出从逼近到插值控制顶点的一系列曲线曲面.同时,引入网格顶点和连接边的方向标注,以生成具有整体方向性的光顺曲面.由于该方法基于符号表示,因此易于实现与扩展,适合于计算机动画造型和工业原型设计.     

Surface modeling with ternary interpolating subdivision

In this paper, a new interpolatory subdivision scheme, called ternary interpolating subdivision, for quadrilateral meshes with arbitrary topology is presented. It can be used to deal with not only extraordinary faces but also extraordinary vertices in polyhedral meshes of arbitrary topologies. It is shown that the ternary interpolating subdivision can generate a C¹-continuous interpolatory surface. Some applications with open boundaries and curves to be interpolated are also discussed.     

Remeshing into normal meshes with boundaries using subdivision

In this paper, we present a remeshing algorithm using the recursive subdivision of irregular meshes with boundaries. A mesh remeshed by subdivision has several advantages. It has a topological regularity, which enables it to be used as a multiresolution model and to represent an original model with less data. Topological regularity is essential for the multiresolutional analysis of the given meshes and makes additional topological information unnecessary. Moreover, we use a normal mesh to reduce the geometric data size requirements at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e. normal offset as wavelet, to represent a vertex position, while the other remeshing schemes use one three-dimensional vector at each vertex. The normal offset is a normal distance from a base face, which is the simplified original mesh. Since the normal offset cannot be properly used for the boundaries of a mesh, we use a combined subdivision scheme that resolves the problem of the proposed normal offset method at the boundaries. Finally, we show examples that demonstrate the effectiveness of the proposed scheme in terms of reducing the data requirements of mesh models.     

双参数四点细分法及其性质

在经典4点插值细分法的基础上，提出一类既能造型光滑插值曲线，又能造型光滑逼近曲线的双参数4点细分法．采用生成多项式等方法对细分法的一致收敛性、C^k连续性及保凸性进行了分析，给出并证明了极限曲线存在、C^k连续及均匀控制顶点情形下保凸的充分条件．在给定初始数据的条件下，可通过对形状参数的适当选择来实现对极限曲线的形状调整和控制．     

三参数六点细分法

提出一类包含3个参数的6点细分法,它以双参数4点法作为一种特殊情况,可以构造光滑插值曲线和光滑逼近曲线,并且可以通过调整3个参数的取值使得曲线达到C4连续.讨论了参数对细分法的收敛性及连续性的影响,给出了细分法Ck连续性的充分条件及一些数值算例.     

静态ternary逼近细分格式的连续性分析和构造

提出了一般的三点三重、四点三重逼近细分格式,利用稳定细分格式Ck连续的充要条件,分析了细分法各阶连续时参数的取值范围。利用提出的一般细分法,可以造型光滑逼近曲线;当某些细分参数取特殊值时,还可以用来造型插值曲线。为便于应用,还对Hassan的3点ternary逼近细分法进行了改进,使其带有一个全局张力参数,通过它更易控制曲线的形状。在全局张力参数的一定范围内可以生成C1,C2连续的极限曲线。