面向可展特征的网格模型去噪方法

可展特征是三维网格模型的常见几何特征。为了更好地对具备可展特征的网格模型进行去噪,提出一种面向可展特征的网格模型去噪方法。首先基于变分形状逼近策略分割可展区域,识别出网格模型上可展特征区域,并对分割区域进行基于可展性度量的合并和划分,改进现有 L 0 去噪算法中针对非均匀噪声网格的正则优化表达项,引入三角网格顶点的可展度量项,利用可展特征的曲面法向量 L 0 范数的优化问题求解实现网格模型的去噪。通过对多个模型数据集中的大量模型数据进行处理,验证了该方法的有效性。实验表明,结合模型的可展特性的去噪方法在保持模型的几何特征特别是可展特征上效果优于已有方法。     

数值稳定的可展网格仿真方法(英文)

动态可展曲面是采用哈密尔顿原理的一类新型动态模型。详细论述了这类动态模型的数值计算引擎。大量实验结果表明:(1)光滑和褶皱的可展曲面都可用动态网格模拟;(2)传统的挑战性问题如纸张褶皱仿真和塑性服装建模等都可用动态网格以稳定、快速的方式进行计算。     

Towards flattenable mesh surfaces

In many industries, products are constructed by assembled surface patches in ℜ³, where each patch is expected to have an isometric map to a corresponding region in ℜ². The widely investigated developable surfaces in differential geometry show this property. However, the method to model a piecewise-linear surface with this characteristic is still under research. To distinguish from the continuous developable surface, we name them as flattenable mesh surfaces since a polygonal mesh has the isometric mapping property if it can be flattened into a two-dimensional sheet without stretching. In this paper, a novel flattenable mesh surface (Flattenable Laplacian mesh) is introduced and the relevant modelling tool is formulated. Moreover, for a given triangular mesh which is almost flattenable, a local perturbation approach is developed to improve its flattenability. The interference between the meshes under process and their nearby objects has been prevented in this local flattenable perturbation. Both the computations of Flattenable Laplacian meshes and the flattenable perturbation are based on the constrained optimization technology.     

任意曲面的三角形网格划分

把曲面分为可展曲面和不可展曲面，对可展曲面用曲面展开算法展成平面，对不可展曲面用曲面分割算法转化成平面片，在平面上运用Ｄｅｌａｕｎａｙ三角划分法进行网格划分，然后把网格节点反映射到曲面上，从而实现任意曲面的三角形网格划分。     

GenLab: A MATLAB®-based program for structural analysis of folds mapped by GPS or seismic methods

GenLab is a MATLAB^® code for structural analysis of digitally and seismically mapped horizons based on the geometrical model of the developable surface. This model is chosen because surfaces of this type result from the bending of a non-stretching stratum and because deviation from developable geometry implies that bed stretching during folding has occurred. The model is therefore linked with straining of the horizon and can be used for highlighting regions of deformation expressed by brittle fracturing or ductile deformation. Mathematically, a developable surface is one upon which straight lines (generators) can be drawn, and along these generators the orientations of tangent planes of the surface remain constant. Our method involves treating real geological surfaces as approximations to developable surfaces and determines the generator lines at different points on the surface. At these points we consider strip samples of the surface radiating in different directions and examine the variability of strike and dip within each sample strip. The radial scan-line length parameter is user-defined, and the optimal value can be easily identified by geostatistical analysis of the depth data. The local plunge lines (the approximation to the generatrix of a developable fold) are therefore identified as the direction associated with the least variation of surface attitude, i.e., the most constant strike and dip. The map pattern obtained by analyzing the plunges and trends of plunge lines across an area allows identification of domains where folding accords closely with a developable geometry. Such domains are recognized from straight plunge lines, defining parallel or convergent patterns. According to the model, deviations from these patterns correspond to regions of structural complexity associated with ductile or brittle straining of the surface being analyzed. The plunge-line analysis therefore offers a useful technique with potential for predicting strained zones and automatic fault recognition. GenLab allows the rapid implementation of this analysis and uses the matrix capabilities and contouring functions of MATLAB.     

三角B样条上可展曲面的设计与形状调节

提出了计算机辅助设计可展曲面的新方法,利用该文的方法,可展曲面可用具有三角B样条基函数的控制平面来设计,这种设计方法具有现存曲线设计方法的特征。同时,通过引入形状控制参数,使生成的可展曲面在较大的范围内可进行调节和控制,增加了造型的自由度。该文的设计方法直接、简单、有效,不仅能克服传统方法在可展曲面设计方法上的缺陷,而且能方便地解决工程中经常遇到的可展曲面的形状难以调节和控制的问题。     

Modeling generalized cylinders using direction map representation

For generalized cylinders (GC) defined by contours of discrete curves, we propose two algorithms to generate GC surfaces (1) in polygonal meshes and (2) in developable surface patches of the cylindrical type. To solve the contour blending problem of generalized cylinder, the presented algorithms have adopted the algorithms and properties of linear interpolation by direction map (LIDM) that interpolate geometric shapes based on direction map merging and group scaling operations. Moreover, we propose an algorithm to develop generated developable surface patches on a plane. Proposed algorithms are fast to compute and easy to implement.     

拓扑最优的可展网格曲面放样建模

在服装、制鞋、钣金等行业的产品外形设计中,经常需要插值多条特征空间曲线,构建可展曲面 (可无伸缩地展开成平面)。针对这一问题,基于Dijkstra算法提出了一种新的放样建模算法：给定多条参数曲线,经过自适应离散后,寻找一个全局拓扑最优的可展网格放样曲面（针对不同的目标曲面能量,同样可以产生目标能量定义的拓扑最优的放样网格曲面）。该问题最终可转化为有向无环图(DAG)的单源最短路径的求解,算法的时间复杂度为O(N log N),其中N为搜寻空间。测试结果表明该算法在相关行业的放样外形设计方面具有实际工程应用价值。     

Approximate on‐Surface Distance Computation using Quasi‐Developable Charts

There is a vast number of applications that require distance field computation over triangular meshes. State‐of‐the‐art algorithms have quadratic or sub‐quadratic worst‐case complexity, making them impractical for interactive applications. While most of the research on this subject has been focused on reducing the computation complexity of the algorithms, in this work we propose an approximate algorithm that achieves similar results working in lower resolutions of the input meshes. The creation of lower resolution meshes is the essence of our proposal. The idea is to identify regions on the input mesh that can be unfolded into planar regions with minimal area distortion (i.e. quasi‐developable charts). Once charts are computed, their interior is re‐triangulated to reduce the number of triangles, which results in a collection of simplified charts that we call a base mesh. Due to the properties of quasi‐developable regions, we are able to compute distance fields over the base mesh instead of over the input mesh. This reduces the memory footprint and data processed for distance computations, which is the bottleneck of these algorithms. We present results that are one order of magnitude faster than current exact solutions, with low approximation errors.     

复杂表面物体3D模型的获取方法

提出了一种从真实物体中获得其3D模型的方法.该方法通过TOF- Camera获得原始的点云数据,在对点云数据进行三角化、分割、滤波去噪等处理后得到部分物体模型,然后再应用ICP(迭代最近点)算法对其进行配准.配准过程中为了节省内存,删掉重叠的冗余数据.最后对生成的数据进行网格重建,得到完整的网格模型.实验表明该方法能较为快速地获取真实物体的3D模型,显著提高TOF相机获取数据的质量.     

Modeling buckled developable surfaces by triangulation

In the first stage of sheet metal stamping, a binder ring, an annular surface surrounding the die cavity, clamps down on the flat blank, bending it to a developable binder wrap surface which may be smooth or buckled. Buckles generally appear in the binder wrap when the binder ring does not lie on a smooth developable surface that spans the die cavity. However, sometimes buckles can improve the formability of the stamped part, so the ability to design buckled developable surfaces becomes desirable. Designing buckled developable surfaces requires geometric modeling of creases and other singularities in the interior a flat sheet. In this paper we review the properties of such surfaces, show how to approximate buckled binder wrap surfaces by developable three-dimensional triangulations and discuss the insights gained from specific examples.     

快速可展窄带曲面设计

针对在服装、制鞋、钣金等行业的产品外形设计中,经常需要插值两条特征空间曲线,构建光顺可展窄带来过渡连接相邻的两可展曲面(可无伸缩地展开成平面)的问题,提出了一种新算法支持可展窄带的优化实时设计。其中:一条线为样式线,承载了外形褶皱的设计要求,通常固定不变;另外一条为设计线,允许其在指定的范围内进行变动(该范围通过两曲面嵌入线进行限定),并且保证设计线始终处于一个被连接的可展曲面上。该问题最终可转换为离散组合优化与非线性约束优化相混合的优化问题,可迭代进行快速求解。最后与主流计算机辅助设计软件Cimatron以及文献[1]中的方法进行了对比测试。测试结果表明该算法在造型速度上以及可展窄带的可展度方面均具有明显优势。所提算法对于相关行业的可展窄带外型设计具有实际工程应用价值。     

A computational model of bounded developable surfaces with application to image‐based three‐dimensional reconstruction

Developable surfaces have been extensively studied in computer graphics because they are involved in a large body of applications. This type of surfaces has also been used in computer vision and document processing in the context of three‐dimensional (3D) reconstruction for book digitization and augmented reality. Indeed, the shape of a smoothly deformed piece of paper can be very well modeled by a developable surface. Most of the existing developable surface parameterizations do not handle boundaries or are driven by overly large parameter sets. These two characteristics become issues in the context of developable surface reconstruction from real observations. Our main contribution is a generative model of bounded developable surfaces that solves these two issues. Our model is governed by intuitive parameters whose number depends on the actual deformation and including the “flat shape boundary”. A vast majority of the existing image‐based paper 3D reconstruction methods either require a tightly controlled environment or restricts the set of possible deformations. We propose an algorithm for reconstructing our model's parameters from a general smooth 3D surface interpolating a sparse cloud of 3D points. The latter is assumed to be reconstructed from images of a static piece of paper or any other developable surface. Our 3D reconstruction method is well adapted to the use of keypoint matches over multiple images. In this context, the initial 3D point cloud is reconstructed by structure‐from‐motion for which mature and reliable algorithms now exist and the thin‐plate spline is used as a general smooth surface model. After initialization, our model's parameters are refined with model‐based bundle adjustment. We experimentally validated our model and 3D reconstruction algorithm for shape capture and augmented reality on seven real datasets. The first six datasets consist of multiple images or videos and a sparse set of 3D points obtained by structure‐from‐motion. The last dataset is a dense 3D point cloud acquired by structured light. Our implementation has been made publicly available on the authors' web home pages. Copyright © 2012 John Wiley & Sons, Ltd.     

混合网格的可调细分算法

论文主要研究混合网格的曲面细分问题,提出了一种带有可调参数的细分算法。该算法适用于多边形网格、三角形网格,以及两者的混合网格情形,且对开的和闭的拓扑结构都能进行处理。由于在算法中引入了可调参数,这样既可产生光滑曲面,也可产生具有尖锐特征的曲面,且通过调整参数还可产生标准的Catmull-Clark细分和Loop细分。另外,实现该算法不需要复杂的数据结构。     

Stripification of Free-Form Surfaces With Global Error Bounds for Developable Approximation

Developable surfaces have many desired properties in the manufacturing process. Since most existing CAD systems utilize tensor-product parametric surfaces including B-splines as design primitives, there is a great demand in industry to convert a general free-form parametric surface within a prescribed global error bound into developable patches. In this paper, we propose a practical and efficient solution to approximate a rectangular parametric surface with a small set of C ⁰ -joint developable strips. The key contribution of the proposed algorithm is that, several optimization problems are elegantly solved in a sequence that offers a controllable global error bound on the developable surface approximation. Experimental results are presented to demonstrate the effectiveness and stability of the proposed algorithm.     

A fully geometric approach for developable cloth deformation simulation

We present a new method for simulation of inextensible cloth subjected to a conservative force (e.g., the gravity) and collision-free constraint. Traditional algorithms for cloth simulation are all physically-based in which cloth is treated as an elastic material with some stiffness coefficient(s). These algorithms break down ultimately if one tries to set this stiffness coefficient to infinite which corresponds to inextensible cloth. The crux of the method is an algorithm for interpolating a given set of arbitrary points or space curves by a smooth developable mesh surface. We formulate this interpolation problem as a mesh deformation process that transforms an initial developable mesh surface, e.g., a planar figure, to a final mesh surface that interpolates the given points (called anchor points). During the deformation process, all the triangle elements in the intermediate meshes are kept isometric to their initial shapes, while the potential energy due to the conservative force is reduced gradually. The collision problem is resolved by introducing dynamic anchor points owing to the collision during the deformation. Notwithstanding its simplicity, the proposed method has shown some promising efficacy for simulation of inextensible cloth.     

Template-based quadrilateral meshing

Generating quadrilateral meshes is a highly non-trivial task, as design decisions are frequently driven by specific application demands. Automatic techniques can optimize objective quality metrics, such as mesh regularity, orthogonality, alignment and adaptivity; however, they cannot make subjective design decisions. There are a few quad meshing approaches that offer some mechanisms to include the user in the mesh generation process; however, these techniques either require a large amount of user interaction or do not provide necessary or easy to use inputs. Here, we propose a template-based approach for generating quad-only meshes from triangle surfaces. Our approach offers a flexible mechanism to allow external input, through the definition of alignment features that are respected during the mesh generation process. While allowing user inputs to support subjective design decisions, our approach also takes into account objective quality metrics to produce semi-regular, quad-only meshes that align well to desired surface features.     

Physics-Based Loop Surface Modeling

Strongly inspired by the research on physics-based dynamic models for surfaces, we propose a new method for precisely evaluating the dynamic parameters (mass, damping and stiffness matrices, and dynamic forces) for Loop surfaces without recursive subdivision regardless of regular or irregular faces. It is shown that the thin-plate-energy of Loop surfaces can be evaluated precisely and efficiently, even though there are extraordinary points in the initial meshes, unlike the previous dynamic Loop surface scheme. Hence, the new method presented for Loop surfaces is much more efficient than the previous schemes.