一种新的细分曲线方法研究

对经典的四点细分格式进行推广，提出了可通过对形状参数的适当选择来实现对极限曲线形状调整和控制的三参数四点细分曲线造型方法，并对其收敛性进行了分析，同时给出了曲线C⁰到C³连续的克分条件，并加以证明．     

基于参数分解的正则四边形插值细分曲面的快速求值

提出了两种正则四边形网格插值细分曲面的求值算法.算法基于参数m-进制分解和构造矩阵序列,通过参数分解数列对应的矩阵乘积得到基函数值,得到初始网格上对应控制点的权值,从而实现插值细分曲面求值.算法1 基于2D 细分掩模,算法2 基于张量积.数值实验表明,算法高效且低存储.     

带形状控制的自由曲线曲面参数样条

目的 样条曲线曲面的构造是工程制图中的一个重要部分。针对双曲抛物面上参数样条曲线的构造,在已有的研究基础上提出了一种样条方法使曲线曲面可以任意地逼近一个多边形或者一个网格。方法 在标准四面体内构造一个双曲抛物面,在该曲面上以基函数参数化的方法定义一种带形状参数的参数样条曲线曲面,样条基函数通过将双曲抛物面的有理参数化进行限定,生成单参数有理样条基函数。详细研究了样条的保形性及其端点性质。结果 样条曲线具有一个可变的形状控制因子,可以对曲线进行调整,能以任意精度逼近这个控制四边形或网格。对空间节点列,利用该样条可以生成G²-连续空间曲线,同样对于空间网格可以构造G²-连续的拟合曲面,它所对应的基函数可以是有理形式。结论 实验结果表明,本文在笔者已有的研究基础上提出的参数样条曲线可以通过重心坐标系变换适应为任意的四边形,除了空间四面体内的样条曲线,四面体退化成四边形同样可实现。     

单变量均匀静态细分格式的连续性分析和构造

利用单变量均匀稳定细分格式C^k连续的充要条件,分析了已有的插值曲线格式各阶连续时参数的取值范围.首次指出了六点二重插值格式可以达到C³连续,并构造了一种新的C³连续的六点三重插值细分格式.     

任意三角形网格的基于二元四次箱样条分片C1曲面

提出一种以任意三角剖分为控制网格的二元箱样条曲面算法.二元三方向剖分是方向最少的三角剖分,建立在其上的二元三向四次箱样条在CAGD等领域有着广泛的应用.其规范的箱样条曲面计算仅适用于控制点的价数均为6的网格.从规范的算法出发,提出了一种任意价数控制网格的曲面计算算法,并对算法的连续性等进行了详细的分析.生成的曲面具有保凸性,且是分片C¹连续的.该算法可进行3D离散点全局或局部插值,并可应用于3D曲面重构等领域.     

一种基于Bézier插值曲面的图像放大方法

文章提出了一种利用Bézier插值曲面进行图像放大的方法,该方法是为数字图像的每一个色彩分量构造一个分块双三次Bzier插值C¹曲面,图像放大等价于以不同的采样速率对该曲面进行采样的过程.实验结果表明,该方法可以大大改善放大图像的效果.     

基于C-C细分的四边形网格上插值光滑Bézier曲面的生成

在任意拓扑的四边形网格上构造光滑的曲面是计算机辅助几何设计中的一个重要问题.基于C-C细分,提出一种从四边形网格上生成插值网格顶点的光滑Bézier曲面片的算法.将输入四边形网格作为C-C细分的初始控制网格,在四边形网格的每张面上对应得到一张Bézier曲面,使Bézier曲面片逼近C-C细分极限曲面.曲面片在与奇异顶点相连的边界上G1连续,其他地方C2连续.为解决C-C细分的收缩问题,给出了基于误差控制的迭代扩张初始控制网格的方法,使从扩张后网格上生成的曲面插值于初始控制网格的顶点.实验结果表明,该算法效率高,生成的曲面具有较好的连续性,适用于对四边化后的网格模型上重建光滑的曲面.     

Catmull-Clark细分曲面的正则性

针对Catmull-Clark(C-C)细分曲面的正则性进行研究,得到简单易用的判别C-C细分曲面正则性的充分条件.首先给出网格点差分向量的3种定义:前向差分向量,中心差分向量和后向差分向量;然后推导出C-C细分曲面的差分向量的细分格式;进一步,通过特征分析建立了C-C细分极限曲面的切向量与初始控制网格差分向量之间的关系;最后得到判别C-C细分极限曲面正则性的一个充分条件.由于该判别条件表达为初始控制网格差分向量之间的几何关系,因此这个条件具有明显的几何意义.实验结果表明,文中的判别条件易于验证.     

基于C—C细分的四边形网格上插值光滑Bezier曲面的生成

在任意拓扑的四边形网格上构造光滑的曲面是计算机辅助几何设计中的一个重要问题．基于C—C细分,提出一种从四边形网格上生成插值网格顶点的光滑Bezier曲面片的算法．将输入四边形网格作为C—C细分的初始控制网格,在四边形网格的每张面上对应得到一张Bezier曲面,使Bezier曲面片逼近C—C细分极限曲面．曲面片在与奇异顶点相连的边界上G^1连续,其他地方C^2连续．为解决C—C细分的收缩问题,给出了基于误差控制的迭代扩张初始控制网格的方法,使从扩张后网格上生成的曲面插值于初始控制网格的顶点．实验结果表明,该算法效率高,生成的曲面具有较好的连续性,适用于对四边化后的网格模型上重建光滑的曲面．     

数据仓库系统中层次式Cube存储结构

区域查询是数据仓库上支持联机分析处理(on-line analytical processing,简称OLAP)的重要操作.近几年,人们提出了一些支持区域查询和数据更新的Cube存储结构.然而这些存储结构的空间复杂性和时间复杂性都很高,难以在实际中使用.为此,提出了一种层次式Cube存储结构HDC(hierarchical data cube)及其上的相关算法.HDC上区域查询的代价和数据更新代价均为O(log^dn),综合性能为O((logn)^2d)(使用C_qC_u模型)或O(K(logn)^d)(使用C_qn_q+C_un_u模型).理论分析与实验表明,HDC的区域查询代价、数据更新代价、空间代价以及综合性能都优于目前所有的Cube存储结构.     

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.     

√2 Subdivision for quadrilateral meshes

This paper presents a $\sqrt2$ subdivision scheme for quadrilateral meshes that can be regarded as an extension of a 4-8 subdivision with new subdivision rules and improved capability and performance. The proposed scheme adopts a so-called $\sqrt2$ split operator to refine a control mesh such that the face number of the refined mesh generally equals the edge number and is thus about twice the face number of the coarse mesh. Smooth rules are designed in reference to the 4-8 subdivision, while a new set of weights is developed to balance the flatness of surfaces at vertices of different valences. Compared to the 4-8 subdivision, the presented scheme can be naturally generalized for arbitrary control nets and is more efficient in both space and computing time management. Analysis shows that limit surfaces produced by the scheme are C⁴ continuous for regular control meshes and G¹ continuous at extraordinary vertices.     

Ternary butterfly subdivision

This paper presents an interpolating ternary butterfly subdivision scheme for triangular meshes based on a 1–9 splitting operator. The regular rules are derived from a C² interpolating subdivision curve, and the irregular rules are established through the Fourier analysis of the regular case. By analyzing the eigenstructures and characteristic maps, we show that the subdivision surfaces generated by this scheme is C¹ continuous up to valence 100. In addition, the curvature of regular region is bounded. Finally we demonstrate the visual quality of our subdivision scheme with several examples.     

Smooth spline surface generation over meshes of irregular topology

An efficient method for generating a smooth spline surface over an irregular mesh is presented in this paper. Similar to the methods proposed by [1, 2, 3, 4], this method generates a generalised bi-quadratic B-spline surface and achieves C ¹ smoothness. However, the rules to construct the control points for the proposed spline surfaces are much simpler and easier to follow. The construction process consists of two steps: subdividing the initial mesh once using the Catmull–Clark [5] subdivision rules and generating a collection of smoothly connected surface patches using the resultant mesh. As most of the final mesh is quadrilateral apart from the neighbourhood of the extraordinary points, most of the surface patches are regular quadratic B-splines. The neighbourhood of the extraordinary points is covered by quadratic Zheng–Ball patches [6].     

Quad/Triangle Subdivision

In this paper we introduce a new subdivision operator that unifies triangular and quadrilateral subdivision schemes. Designers often want the added flexibility of having both quads and triangles in their models. It is also well known that triangle meshes generate poor limit surfaces when using a quad scheme, while quad‐only meshes behave poorly with triangular schemes. Our new scheme is a generalization of the well known Catmull‐Clark and Loop subdivision algorithms. We show that our surfaces are C ¹ everywhere and provide a proof that it is impossible to construct such a C ² scheme at the quad/triangle boundary. However, we provide rules that produce surfaces with bounded curvature at the regular quad/triangle boundary and provide optimal masks that minimize the curvature divergence elsewhere. We demonstrate the visual quality of our surfaces with several examples. ACM CSS: I.3.5 Computer Graphics—Curve, surface, solid, and object representations     

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.     

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.     

Smooth Bi-3 spline surfaces with fewest knots

Converting a quadrilateral input mesh into a C¹ surface with one bi-3 tensor-product spline patch per facet is a classical challenge. We give explicit local averaging formulas for the spline control points. Where the quadrilateral mesh is not regular, the patches have two internal double knots, the least number and multiplicity to always allow for an unbiased G¹ construction.     

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.     

Pseudo‐Spline Subdivision Surfaces

Pseudo‐splines provide a rich family of subdivision schemes with a wide range of choices that meet various demands for balancing the approximation power, the length of the support, and the regularity of the limit functions. Special cases of pseudo‐splines include uniform odd‐degree B‐splines and the interpolatory 2n‐point subdivision schemes, and the other pseudo‐splines fill the gap between these two families. In this paper we show how the refinement step of a pseudo‐spline subdivision scheme can be implemented efficiently using repeated local operations, which require only the data in the direct neighbourhood of each vertex, and how to generalize this concept to quadrilateral meshes with arbitrary topology. The resulting pseudo‐spline surfaces can be arbitrarily smooth in regular mesh regions and C¹ at extraordinary vertices as our numerical analysis reveals.