细分曲面拟合的局部渐进插值方法

逼近型细分方法生成的细分曲面其品质要优于插值型细分方法生成的细分曲面.然而,逼近型细分方法生成的细分曲面不能插值于初始控制网格顶点.为使逼近型细分曲面具有插值能力,一般通过求解全局线性方程组,使其插值于网格顶点.当网格顶点较多时,求解线性方程组的计算量很大,因此,难以处理稠密网格.与此不同,在不直接求解线性方程组的情况下,渐进插值方法通过迭代调整控制网格顶点,最终达到插值的效果.渐进插值方法可以处理稠密的任意拓扑网格,生成插值于初始网格顶点的光滑细分曲面.并且经证明,逼近型细分曲面渐进插值具有局部性质,也就是迭代调整初始网格的若干控制顶点,且保持剩余顶点不变,最终生成的极限细分曲面仍插值于初始网格中被调整的那些顶点.这种局部渐进插值性质给形状控制带来了更多的灵活性,并且使得自适应拟合成为可能.实验结果验证了局部渐进插值的形状控制以及自适应拟合能力.     

Flexible G1 interpolation of quad meshes

Transforming an arbitrary mesh into a smooth G¹ surface has been the subject of intensive research works. To get a visual pleasing shape without any imperfection even in the presence of extraordinary mesh vertices is still a challenging problem in particular when interpolation of the mesh vertices is required. We present a new local method, which produces visually smooth shapes while solving the interpolation problem. It consists of combining low degree biquartic Bézier patches with minimum number of pieces per mesh face, assembled together with G¹-continuity. All surface control points are given explicitly. The construction is local and free of zero-twists. We further show that within this economical class of surfaces it is however possible to derive a sufficient number of meaningful degrees of freedom so that standard optimization techniques result in high quality surfaces.     

基于四边形网格均值坐标的K-2环网格曲面构造

为在曲面造型中避免产生扭曲、褶皱等现象,将四边形网格中内点的 K-2 环网格作为控制网格, 提出一种简单、灵活的曲面构造方法。给定一个 K-2 环控制网格,构造一个与其具有同样拓扑结构的平面网格。 再将平面网格拓展成空间四边形网格,同时在平面网格内进行采样。然后计算采样点关于空间四边形网格顶点 的四边形网格均值坐标,最后利用四边形网格均值坐标生成曲面,保证曲面上的每一点都满足 C∞ 。在这个过 程中设置了一个全局形状因子 h,用于控制曲面与初始控制网格的逼近程度,通过实例证明,h 越小,曲面越 逼近初始控制网格。     

基于形状控制的细分曲面的局部渐进插值方法

提出一种基于形状控制的 Catmull-Clark 细分曲面构造方法,实现局部插值任意拓扑的四边形网格顶点。首先该方法利用渐进迭代逼近方法的局部性质,在初始网格中选取若干控制顶点进行迭代调整,保持其他顶点不变,使得最终生成的极限细分曲面插值于初始网格中的被调整点;其次该方法的 Catmull-Clark 细分的形状控制建立在两步细分的基础上,第一步通过对初始网格应用改造的 Catmull-Clark 细分产生新的网格,第二步对新网格应用 Catmull-Clark 细分生成极限曲面,改造的 Catmull-Clark 细分为每个网格面加入参数值,这些参数值为控制局部插值曲面的形状提供了自由度。证明了基于形状控制的 Catmull-Clark 细分局部渐进插值方法的收敛性。实验结果验证了该方法可同时实现局部插值和形状控制。     

网格模型的局部编辑算法

提出一种新的网格模型局部编辑算法，该算法可以精确地控制变形区域的大小、边界和变形点的位移，克服了FFD及其改进算法的缺点．首先交互地定义一个附着在模型表面的控制网格；然后建立模型变形区域与控制网格间点的映射，再依据变形要求来编辑控制网格；最后根据映射关系反算出模型变形区域点的新位置．控制网格可以是参数曲面的控制网格，也可采用一般三角网格或预先定义的网格模板．为达到精确变形的目的，对模型与控制网格重叠的区域进行自适应细分．该算法计算简便、易于实现，并能达到很好的效果．     

Fitting Sharp Features with Loop Subdivision Surfaces

Various methods have been proposed for fitting subdivision surfaces to different forms of shape data (e.g., dense meshes or point clouds), but none of these methods effectively deals with shapes with sharp features, that is, creases, darts and corners. We present an effective method for fitting a Loop subdivision surface to a dense triangle mesh with sharp features. Our contribution is a new exact evaluation scheme for the Loop subdivision with all types of sharp features, which enables us to compute a fitting Loop subdivision surface for shapes with sharp features in an optimization framework. With an initial control mesh obtained from simplifying the input dense mesh using QEM, our fitting algorithm employs an iterative method to solve a nonlinear least squares problem based on the squared distances from the input mesh vertices to the fitting subdivision surface. This optimization framework depends critically on the ability to express these distances as quadratic functions of control mesh vertices using our exact evaluation scheme near sharp features. Experimental results are presented to demonstrate the effectiveness of the method.     

An adaptive learning approach for 3-D surface reconstruction from point clouds.

In this paper, we propose a multiresolution approach for surface reconstruction from clouds of unorganized points representing an object surface in 3-D space. The proposed method uses a set of mesh operators and simple rules for selective mesh refinement, with a strategy based on Kohonen's self-organizing map (SOM). Basically, a self-adaptive scheme is used for iteratively moving vertices of an initial simple mesh in the direction of the set of points, ideally the object boundary. Successive refinement and motion of vertices are applied leading to a more detailed surface, in a multiresolution, iterative scheme. Reconstruction was experimented on with several point sets, including different shapes and sizes. Results show generated meshes very close to object final shapes. We include measures of performance and discuss robustness.     

网格图形编辑的样条方法

提出基于样条的网格图形编辑方法,首先在网格表面附近构建近似的样条曲面,同时预计算网格顶点在样条上的对应点处局部标架下的坐标表示,并作为不变量在变形中进行保持;然后编辑样条的位置和形状,利用局部标架和细节坐标重建变形后的网格,同时进行网格光滑和网格细分,改善变形效果,以实现复杂模型简单快捷的编辑/变形.方法在保细节的同时允许对网格在多个尺度下编辑.实验结果表明,融合了样条的三角网格方法较传统的样条编辑方法可避免产生过多的控制点,大大地简化了操作.     

Parametric circles and spheres

Formulations for parametric circles and spheres in terms of rational Gaussian (RaG) curves and surfaces are introduced. With the proposed formulations, a full circle is generated by interpolating a closed RaG curve to the vertices of an equilateral triangle, and a full sphere is generated by interpolating a closed RaG surface to the vertices of an octahedron with equilateral triangular faces. Generation of circles and spheres in this manner is very intuitive and easy to remember as the weights are all 1 and the nodes are all unique and uniformly spaced.     

Interior Distance Using Barycentric Coordinates

This paper introduces a framework for defining a shape-aware distance measure between any two points in the interior of a surface mesh. Our framework is based on embedding the surface mesh into a high-dimensional space in a way that best preserves boundary distances between vertices of the mesh, performing a mapping of the mesh volume into this high-dimensional space using barycentric coordinates, and defining the interior distance between any two points simply as their Euclidean distance in the embedding space. We investigate the theoretical properties of the interior distance in relation to properties of the chosen boundary distances and barycentric coordinates, and we investigate empirical properties of the interior distance using diffusion distance as the prescribed boundary distance and mean value coordinates. We prove theoretically that the interior distance is a metric, smooth, interpolating the boundary distances, and reproducing Euclidean distances, and we show empirically that it is insensitive to boundary noise and deformation and quick to compute. In case the barycentric coordinates are non-negative we also show a maximum principle exists. Finally, we use it to define a new geometric property, barycentroid of shape, and show that it captures the notion of semantic center of the shape.     

On approximating contours of the piecewise trilinear interpolantusing triangular rational quadratic Bezier patches

Given a three dimensional (3D) array of function values F_i,j,k on a rectilinear grid, the marching cubes (MC) method is the most common technique used for computing a surface triangulation T approximating a contour (isosurface) F(x, y, z)=T. We describe the construction of a C⁰ continuous surface consisting of rational quadratic surface patches interpolating the triangles in T. We determine the Bezier control points of a single rational quadratic surface patch based on the coordinates of the vertices of the underlying triangle and the gradients and Hessians associated with the vertices     

Sparse Approximation of 3D Meshes Using the Spectral Geometry of the Hamiltonian Operator

The discrete Laplace operator is ubiquitous in spectral shape analysis, since its eigenfunctions are provably optimal in representing smooth functions defined on the surface of the shape. Indeed, subspaces defined by its eigenfunctions have been utilized for shape compression, treating the coordinates as smooth functions defined on the given surface. However, surfaces of shapes in nature often contain geometric structures for which the general smoothness assumption may fail to hold. At the other end, some explicit mesh compression algorithms utilize the order by which vertices that represent the surface are traversed, a property which has been ignored in spectral approaches. Here, we incorporate the order of vertices into an operator that defines a novel spectral domain. We propose a method for representing 3D meshes using the spectral geometry of the Hamiltonian operator, integrated within a sparse approximation framework. We adapt the concept of a potential function from quantum physics and incorporate vertex ordering information into the potential, yielding a novel data-dependent operator. The potential function modifies the spectral geometry of the Laplacian to focus on regions with finer details of the given surface. By sparsely encoding the geometry of the shape using the proposed data-dependent basis, we improve compression performance compared to previous results that use the standard Laplacian basis and spectral graph wavelets.     

Making Doo-Sabin surface interpolation always work over irregular meshes

This paper presents a reliable method for constructing a control mesh whose Doo-Sabin subdivision surface interpolates the vertices of a given mesh with arbitrary topology. The method improves on existing techniques in two respects: (1) it is guaranteed to always work for meshes of arbitrary topological type; (2) there is no need to solve a system of linear equations to obtain the control points. Extensions to include normal vector interpolation and/or shape adjustment are also discussed.     

散乱点的快速曲面重建方法

空间散乱点的曲面重建有着广泛的应用前景，是当前国际上的研究热点之一，Crust算法是一种基于计算几何中的Voronoi周期图的曲面重建算法，它算法简单，重建结果精细，但是由于计算量太大，其应用受到了限制，为此提出了一种依据采样点的局部特征尺度对原始采样集进行不均匀降采样的方法，在保证采样集能够满足重建要求的前提下，使参与重建的表面点数大为降低，减少了重建算法的计算量，从而提高了重建的速度，这一方法还可以应用于网络简化，通过剔除某些顶点达到简化之目的。     

A general framework for analysis and comparison of surface mesh optimization techniques

Many different algorithms for surface mesh optimization (including smoothing, remeshing, simplification and subdivision), each giving different results, have recently been proposed. All these approaches affect vertices of the mesh. Vertex coordinates are modified, new vertices are added and some original ones are removed, with the result that the shape of the original surface is changed. The important question is how to evaluate the differences in shape between the input and output models. In this paper, we present a novel and versatile framework for analysis of various mesh optimization algorithms in terms of shape preservation. We depart from the usual strategy by measuring the changes in the approximated smooth surfaces rather than in the corresponding meshes. The proposed framework consists of two error metrics: normal-based and physically based. We demonstrate that our metrics allow more subtle changes in shape to be captured than is possible with some commonly used measures. As an example, the proposed tool is used to compare three different techniques, reflecting basic ideas on how to solve the surface mesh improvement problem.     

Sweep造型法在管线三维可视化中的应用

管线三维可视化中的一个重要问题是如何根据管线中心线坐标计算得到管线表面顶点的坐标,难点在于管线转折处的表面处理。采用“sweep+mesh”的造型方法可生成整张连续的管道表面而不必在管线转折处做拼接处理。此方法通过在管线中心线各分段点上建立局部坐标系（标架）,计算得到分段点对应的管线表面顶点的坐标,并生成连续的mesh网格。为建立连续的标架,提出了对管线进行倒圆角及分段处理,再递推生成标架的方法。结果表明：管线表面顶点坐标正确,整个表面光滑连续。     

N-sided patches with B-spline boundaries

We present a method for constructing an n-sided patch of parametric surface, with n greater than 2. The main property of the resulting patch is that its boundary coincides with a B-spline. Thus, it can easily be connected to given B-spline surfaces with fixed continuity conditions.

The patch is built from a star-shaped input mesh that outlines a generic n-hole and a surface in a vicinity of the hole. The main advantages of the method are the following: continuity conditions of arbitrary order k can be imposed; the mesh involved can have an arbitrary number of sides and an arbitrary shape (convex or not); the simplicity of the construction process makes it an easy and flexible method; and finally, the surface near the boundary is a B-spline with piecewise uniform knot sequences and whose control points are vertices of the mesh (both knot sequences and control points are easily computed). We give implementation details for evaluating a surface point and show that the de Boor algorithm can be exploited for efficiency.     

Similarity based interpolation using Catmull–Clark subdivision surfaces

A new method for constructing a Catmull–Clark subdivision surface (CCSS) that interpolates the vertices of a given mesh with arbitrary topology is presented. The new method handles both open and closed meshes. Normals or derivatives specified at any vertices of the mesh (which can actually be anywhere) can also be interpolated. The construction process is based on the assumption that, in addition to interpolating the vertices of the given mesh, the interpolating surface is also similar to the limit surface of the given mesh. Therefore, construction of the interpolating surface can use information from the given mesh as well as its limit surface. This approach, called similarity based interpolation, gives us more control on the smoothness of the interpolating surface and, consequently, avoids the need of shape fairing in the construction of the interpolating surface. The computation of the interpolating surface’s control mesh follows a new approach, which does not require the resulting global linear system to be solvable. An approximate solution provided by any fast iterative linear system solver is sufficient. Nevertheless, interpolation of the given mesh is guaranteed. This is an important improvement over previous methods because with these features, the new method can handle meshes with large number of vertices efficiently. Although the new method is presented for CCSSs, the concept of similarity based interpolation can be used for other subdivision surfaces as well.     

噪声鲁棒的分水岭网格分割算法

提出一种对逆向工程网格噪声鲁棒的分水岭分割算法.该算法在计算网格离散曲率时,针对曲率计算对网格噪声特别敏感的问题,根据拟合曲面的曲面误差估计,动态地调整拟合曲面的顶点个数,提高了曲率计算的精确性,增强了基于曲率的分水岭算法对噪声的鲁棒性;通过后续的标识、聚类和分割后处理方法,提高了算法的分割精度和效果.该算法在大量的噪声网格模型上获得了较好的分割结果,适用于逆向工程中的二次曲面识别和NURBS曲面逼近.     

基于层次B样条的网格模型变形技术

针对常用的网格模型提出了一个基于层次B样条控制的三维网格空间变形框架．首先由用户交互地选取编辑区域,由程序完成编辑区域的参数化和均匀重采样;然后用层次B样条光顺拟合这些均匀采样点,所得的R样条曲面作为网格模型的基曲面,计算待编辑区域中网格顶点相对该B样条基曲面的局部坐标,该局部坐标平移、旋转不变,可视为模型的内蕴几何特征,并作为变形操作中的不变量．用户通过编辑层次B样条基曲面或者直接编辑三维网格模型,可实现多分辨率变形．实验结果表明：该方法操作直观方便,无论对整体还是局部变形,都能取得可控、可靠的变形效果,且采刚B样条曲面的控制手段易于与已有的造型系统合成．