三参数binary细分法

通过在曲线细分过程中引入三个参数,给出一种新的细分曲线构造的算法,并利用生成多项式等方法对细分法的一致收敛性、Ck连续性进行了分析.在给定初始控制数据的条件下,可以通过对形状参数的适当选择来实现对细分极限曲线形状的调控.该方法可以生成C4连续的细分曲线,增加了曲线造型的灵活性.数值试验表明这种算法是有效的.     

非静态4点二重混合细分法

为了得到插值与逼近相统一的非静态细分法,根据非静态插值4点细分法和三次指数B-样条细分法之间的联系,构造了3类非静态4点二重混合细分法:基于非静态插值细分的非静态逼近细分法,基于非静态逼近细分的非静态插值细分法,非静态插值与逼近混合细分法.诸多已有的插值细分法和逼近细分法都是所提混合细分法的特例.最后给出了这3类混合细分法的几何解释,分析了其Ck连续性、指数多项式生成性和再生性.数值实例表明,利用文中的混合细分法,通过适当选取参数可以实现对极限曲线的形状控制.     

多项式混合曲线曲面方法构造

针对混合曲线表示及其求导和求积困难的问题,通过计算构造出一种多项式混合曲线曲面形式.当待混合曲线是多项式时,混合曲线也为多项式形式.该多项式混合公式可以推广得到任意参数连续C(n)和几何连续G(n)的混合曲线曲面.另外,在得到的混合曲线曲面族中构造出了新的更优能量光顺方程,通过设置参数可得到合适的混合曲线曲面.实验结果表明,文中提出的混合曲线曲面造型方法稳定、有效.     

曲面三参数binary细分法

在经典四点细分法的基础上,通过在曲线细分过程中引入三个参数,给出一种改进的细分曲线构造的算法,利用生成多项式等方法对细分法的一致收敛性、Ck连续性进行了分析。并把该方法扩展到曲面上,进而提出了曲面三参数binary细分法。在给定初始控制数据的条件下,可以通过对形状参数的适当选择来实现对细分极限曲面形状的调控。数值实验表明该算法较容易控制曲面形状,可方便地应用于工程实际,解决曲线、曲面位置调整和控制问题。     

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

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

非静态混合细分法

提出了一种含参数b 的非静态Binary 混合细分法,当参数取0、1 时,分别对应已 有的非静态四点C1 插值细分法及C-B 样条细分法。用渐进等价定理证明了对任意 (0,1]区间的 参数其极限曲线为C2 连续的。从理论上证明了细分法对特殊函数的再生性,及其对圆和椭圆等 特殊曲线的再生性,并通过实验对比说明了对任意的[0,1]区间的参数,该细分法都能再生圆和 椭圆等特殊曲线,而与其渐进等价的静态细分法则不具备该性质。将该细分法推广为含局部控 制参数的广义混合细分法,从而可以达到局部调整极限曲线的目的。     

基于插值细分的逼近细分法

通过在Hassan的四点三重插值细分法中引入一个偏移变量,推导出了一种逼近细分法,从而使三重逼近细分和插值细分统一到一个细分格式.该方法利用细分格式的生成多项式,在理论上分析了提出的细分格式的一致收敛性和Ck连续性;通过对细分格式中参数u取不同的值,可对生成的极限曲线形状进行控制.数值实验结果表明,文中方法是合理有效的.     

4-3网格混合曲面细分

在已有曲面细分模式的基础上,利用"回推"技术构造出一类新的细分模式,对同时存在三角形和四边形的4-3网格进行混合曲面细分;采用分析细分矩阵特征结构的方法,讨论了该模式的连续性.分析表明,所构造的混合细分全局C1连续,且在规则情形下具有有界曲率.最后给出了一种基于体积保持的混合细分策略.     

曲线插值的一种具有还圆性的细分方法

传统的线性四点插值细分方法不能表示圆等非多项式曲线,为了解决这种 问题,基于几何特性提出了一种带有一个参数的四点插值型曲线细分方法。细分过程中,过 相邻三插值点作圆,过相邻二插值点的圆弧有两个中点,将其加权平均得到新插值点,文中 给出了插值公式和算法描述。所给方法具有还圆性,可以实现保凸性。实例分析对比了本方 法与多种细分方法的差异,说明本方法是有效的,当参数取值较小时,曲线靠近控制多边形。     

三参数六点细分法

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

A Method for Constructing Interpolatory Subdivision Schemes and Blending Subdivisions

This paper presents a universal method for constructing interpolatory subdivision schemes from known approximatory subdivisions. The method establishes geometric rules of the associated interpolatory subdivision through addition of further weighted averaging operations to the approximatory subdivision. The paper thus provides a novel approach for designing new interpolatory subdivision schemes. In addition, a family of subdivision surfaces varying from the given approximatory scheme to its associated interpolatory scheme, namely the blending subdivisions, can also be established. Based on the proposed method, variants of several known interpolatory subdivision schemes are constructed. A new interpolatory subdivision scheme is also developed using the same technique. Brief analysis of a family of blending subdivisions associated with the Loop subdivision scheme demonstrates that this particular family of subdivisions are globally C¹ continuous while maintaining bounded curvature for regular meshes. As a further extension of the blending subdivisions, a volume‐preserving subdivision strategy is also proposed in the paper.     

Solving polynomial systems using no-root elimination blending schemes

Searching for the roots of (piecewise) polynomial systems of equations is a crucial problem in computer-aided design (CAD), and an efficient solution is in strong demand. Subdivision solvers are frequently used to achieve this goal; however, the subdivision process is expensive, and a vast number of subdivisions is to be expected, especially for higher-dimensional systems. Two blending schemes that efficiently reveal domains that cannot contribute by any root, and therefore significantly reduce the number of subdivisions, are proposed. Using a simple linear blend of functions of the given polynomial system, a function is sought after to be no-root contributing, with all control points of its Bernstein–Bézier representation of the same sign. If such a function exists, the domain is purged away from the subdivision process. The applicability is demonstrated on several CAD benchmark problems, namely surface–surface–surface intersection (SSSI) and surface–curve intersection (SCI) problems, computation of the Hausdorff distance of two planar curves, or some kinematic-inspired tasks.     

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

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

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

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

基于三进制的loop细分方法

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

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

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

√3-Subdivision-Based Biorthogonal Wavelets

A new efficient biorthogonal wavelet analysis based on the radic3 subdivision is proposed in the paper by using the lifting scheme. Since the radic3 subdivision is of the slowest topological refinement among the traditional triangular subdivisions, the multiresolution analysis based on the radic3 subdivision is more balanced than the existing wavelet analyses on triangular meshes and accordingly offers more levels of detail for processing polygonal models. In order to optimize the multiresolution analysis, the new wavelets, no matter whether they are interior or on boundaries, are orthogonalized with the local scaling functions based on a discrete inner product with subdivision masks. Because the wavelet analysis and synthesis algorithms are actually composed of a series of local lifting operations, they can be performed in linear time. The experiments demonstrate the efficiency and stability of the wavelet analysis for both closed and open triangular meshes with radic3 subdivision connectivity. The radic3-subdivision-based biorthogonal wavelets can be used in many applications such as progressive transmission, shape approximation, and multiresolution editing and rendering of 3D geometric models.     

Block-balanced meshes in iterative uniform refinement

In this paper we study and delimit a property of known four triangle subdivisions that is useful in tri to quad mesh conversion methods. We provide both theoretical results and empirical evidence showing that iterative application of the four triangles longest-edge subdivision and the four triangles similar subdivision produces block-balanced meshes, meshes in which triangle pairs sharing a common longest edge tend to cover the area of the entire mesh. Some other properties of such triangle subdivisions regarding mesh quality and adjacency relationships are also discussed.     

A New Subdivision Algorithm for the Bernstein Polynomial Approach to Global Optimization

In this paper,an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems.The proposed algorithm is based on the Bernstein polynomial approach.Novel features of the proposed algorithm are that it uses a new rule for the selection of the subdivision point,modified rules for the selection of the subdivision direction,and a new acceleration device to avoid some unnecessary subdivisions.The performance of the proposed algorithm is numerically tested on a collection of 16 test problems.The results of the tests show the proposed algorithm to be superior to the existing Bernstein algorithm in terms of the chosen performance metrics.