四参数四点细分法研究

论文对经典四点细分格式进行了进一步推广,提出了可通过对形状参数的适当选择来实现对极限曲线形状调整和控制的四参数四点细分曲线造型方法,并对其收敛性进行了分析,同时给出了曲线C0到C3连续的充分条件,并加以证明。     

曲面四参数四点细分方法

对经典的四点细分格式进行推广,提出了可通过对形状参数的适当选择来实现对极限曲线形状调整和控制的四参数四点细分曲线造型方法.把该方法扩展到曲面上,对其收敛性进行了分析,同时给出了曲线C0到C3连续和曲面连续的充分条件.     

基于双参数四点细分法的曲面造型

将双参数四点细分曲线方法进行推广，提出了基于双参数四点细分法的曲面造型方法，并对其收敛性进行了分析。该方法通过对两个参数的适当调节能够较容易地控制极限曲面的形状，极限曲面能够达到C4连续，可以应用到对曲面的连续性要求较高的曲面造型中去。在给定初始数据的条件下，可通过对形状参数的适当选择来实现对极限曲面的形状调整和控制，试验表明该算法生成光滑曲面是有效的。     

改进四点细分法及其应用

对经典的四点细分格式进行推广，提出了可通过对形状参数的适当选择来实现对极限曲线形状调整和控制的四参数四点细分曲线造型方法，并把该方法扩展到曲面上，对其连续性和收敛性进行了分析。把四参数四点细分法运用于山地模拟，由于其中四个参数选取的灵活性，可对生成的地形形状进行适当的调整，生成比较丰富的地貌形状。细分方法具有多尺度特点，所以可对地貌进行细节描述。试验证明能够较好地生成模拟山地地形，为山地地形模拟仿真提供了一种有效的方法。     

曲面三参数四点造型

文章是对经典的四点细分格式进行推广,提出了可通过对形状参数的适当选择来实现对极限曲线形状调整和控制的四参数四点细分曲线造型方法,并把该方法扩展到曲面上;对其收敛性进行了分析,同时给出了曲线曲面C0到C2连续的充分条件。     

A 4-point interpolatory subdivision scheme for curve design

A 4-point interpolatory subdivision scheme with a tension parameter is analysed. It is shown that for a certain range of the tension parameter the resulting curve is C¹. The role of the tension parameter is demonstrated by a few examples. The application to surfaces and some further potential generalizations are discussed.     

曲面三参数binary细分法

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

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

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

Reconstruction of 3D objects from 2D cross-sections with the 4-point subdivision scheme adapted to sets

Reconstruction of 3D objects from 2D cross-sections is an intriguing problem with many potential applications. We approach this problem through a novel multi-resolution method based on iterative refinement of the sets representing the cross-sections. To that end, we introduce a new geometric weighted average of two sets, defined for positive weights (corresponding to interpolation) and when one weight is negative (corresponding to extrapolation). This new average can be used to interpolate between cross-sections of a 3D object in a piecewise way. To obtain a smoother reconstruction of the 3D object, we adapt to sets the 4-point interpolatory subdivision scheme using the new average with both positive and negative weights. The effectiveness of the new method is demonstrated by several examples.     

四点多参数Binary细分曲线

在曲线细分过程中引入六个参数,构造出一种新的四点多参数细分Binary曲线算法。对四点多参数Binary细分法的一致收敛性、连续性进行分析,该算法使Dyn四点法以及2到6次均匀B样条细分曲线成为特例。通过对形状参数的适当选择来实现对细分极限曲线形状的调控,增加曲线造型的灵活性,并给出造型实例。     

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

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

三参数六点细分法

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

Artifact analysis on B-splines, box-splines and other surfaces defined by quadrilateral polyhedra

When using NURBS or subdivision surfaces as a design tool in engineering applications, designers face certain challenges. One of these is the presence of artifacts. An artifact is a feature of the surface that cannot be avoided by movement of control points by the designer. This implies that the surface contains spatial frequencies greater than one cycle per two control points. These are seen as ripples in the surface and are found in NURBS and subdivision surfaces and potentially in all surfaces specified in terms of polyhedrons of control points.Ideally, this difference between designer intent and what emerges as a surface should be eliminated. The first step to achieving this is by understanding and quantifying the artifact observed in the surface.We present methods for analysing the magnitude of artifacts in a surface defined by a quadrilateral control mesh. We use the subdivision process as a tool for analysis. Our results provide a measure of surface artifacts with respect to initial control point sampling for all B-Splines, quadrilateral box-spline surfaces and regular regions of subdivision surfaces. We use four subdivision schemes as working examples: the three box-spline subdivision schemes, Catmull-Clark (cubic B-spline), 4-3, 4-8; and Kobbelt?s interpolating scheme.     

Matrix-valued 4-point spline and 3-point non-spline interpolatory curve subdivision schemes

The objective of this paper is to study and construct matrix-valued templates for interpolatory curve subdivision. Since our investigation of this problem was motivated by the need of such subdivision stencils as boundary templates for interpolatory surface subdivision, we provide both spline and non-spline templates that are necessarily symmetric, due to the lack of direction-orientation in carrying out surface subdivision in general. For example, the minimum-supported Hermite interpolatory C¹ cubic spline curve subdivision scheme, with the skew-symmetric basis function for interpolating first derivatives, does not meet the symmetry specification. Non-spline C² interpolatory templates constructed in this paper are particularly important, due to their smaller support needed to minimize undesirable surface oscillations, when adopted as boundary templates for interpolatory C² surface subdivision. The curve subdivision templates introduced in this paper are adopted as boundary stencils for interpolatory surface subdivision with matrix-valued templates.     

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

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

一种静态的蜂窝细分算法

介绍了一种静态的蜂窝细分算法。该算法采用对偶模式,在每次迭代过程中,新顶点仅由旧顶点分裂而成,不需要辅助点来计算。该算法能够有效地节省时间和空间的开销,同时也能使细分矩阵拥有循环的特性,从而方便了特征值分析。通过对控制系数的合理选择,该算法能够的到比较好的细分效果。     

A new interpolation subdivision scheme for triangle/quad mesh

In this paper, we present a new interpolation subdivision scheme for mixed triangle/quad meshes that is C¹ continuous. The new scheme is capable of reproducing the well-known four-point based interpolation subdivision in the quad region but does not reproduce Butterfly subdivision in the triangular part. The new scheme defines rules that produce surfaces both at the regular quad/triangle vertices and isolated, extraordinary points. We demonstrate the visually satisfying of our surfaces through several examples.     

Analysis of Several Familiar Subdivision Schemes

Subdivision scheme is a discrete modeling method that breaches old model of surface modeling, namely, from discrete data to continuous data and last to discrete data. The method is simple, small computing and fast in modeling. This paper presents a classification standard of subdivision scheme, discusses and compares several subdivision schemes in brief.     

A New Interpolatory Subdivision for Quadrilateral Meshes

This paper presents a new interpolatory subdivision scheme for quadrilateral meshes based on a 1–4 splitting operator. The scheme generates surfaces coincident with those of the Kobbelt interpolatory subdivision scheme for regular meshes. A new group of rules are designed for computing newly inserted vertices around extraordinary vertices. As an extension of the regular masks,the new rules are derived based on a reinterpretation of the regular masks. Eigen‐structure analysis demonstrates that subdivision surfaces generated using the new scheme are C¹ continuous and, in addition, have bounded curvature.     

L-system specification of knot-insertion rules for non-uniform B-spline subdivision

Subdivision schemes are based on a hierarchy of knot grids in parameter space. A univariate grid hierarchy is regular if all knots are equidistant on each level, and irregular otherwise. We use L-systems to design a wide class of systematically described irregular grid hierarchies. Furthermore, we give sufficient conditions on the L-system which guarantee that the subdivision scheme, based on the non-uniform B-spline of degree d defined on the initial knot grid, is uniformly convergent. If n is the number of symbols in the alphabet of the L-system, this subdivision scheme is defined with a finite set of masks (at most nd+1) which does not depend on the subdivision step. We provide an implementation of such schemes which is available as a worksheet for Sage software.