非封闭曲面的海量空间数据点四边形网格生成算法

从数据模型的任意一点开始选择一个初始的四边形网格单元,采用动态边界边扩展的方法在三维空间直接进行四边形网格划分;在网格划分过程中实现了边界冲突检测、网格顶点优化处理、网格边界处理和网格综合优化.最后给出了网格生成实例.实验结果表明:该算法生成的网格质量较好,运行速度较快.     

由区域生长算法实现四边形网格划分

针对当前各种三角形网格转化为四边形网格算法的缺陷，提出一种实现这种转化的算法——区域生长算法．该算法通过有选择地合并三角形来获得高质量的四边形网格，并且对两个三角形的合并增加约束条件以避免在生成四边形网格的过程中产生残余三角形；同时对生成的四边形网格进行一系列的质量改善操作。     

一种改进的有限元网格自动生成方法

提出了一种基于四叉树方法和三角化方法的简单但有效的有限元网格自动生成方法。该方法可以产生全三角形单元、全四边形单元和三角形单元与四边形单元共存的混合形式的有限元网格。如若产生全四边形单元，则该方法可以与四叉树方法相似，产生尽可能多的正方形与矩形单元。该方法还可以推广到图象图像处理方面而处理非结构化的网格生成，具有较强的应用价值。     

非结构化四边形网格生成新算法

改进了一类基于递归区域分解过程的四边形网格生成算法。引入一套健壮的网格模板,为子域的网格剖分提供统一的处理方案,不再限制最终子域为4节点、6节点或8节点子域,提高了算法的时空效率。结合新的子域网格生成过程和自动区域分解算法,利用背景网格和网格源控制分解线上点的布置,得到一个全自动的非结构化四边形网格生成算法。最后通过网格及数值模拟实例验证了算法性能和实用性。     

一种新的基于线性EIV模型的鲁棒估计算法

提出了一种新的基于线性EIV模型的鲁棒估计算法——鲁棒扩充算法．该算法从结构化数据区域出发，逐渐扩充模型数据集，并不断更新模型参数的估计，直至找到所有模型数据．在每次迭代中，使用C-Step方法对集合进行调整，从而保证了算法的鲁棒性．同时，提出了关于粗差数据和结构化数据分布的结构化密度假设，结合Mean Shift算法，完成对算法的初始位置选取．仿真结果表明，该算法可以有效地处理含有多个结构和大量离群样本的混杂数据，与现有算法相比，具有更强的鲁棒性和更高的精度．     

边界优先的Delaunay-层推进曲面四边形网格生成

为了提高复杂组合曲面四边形网格生成的鲁棒性和边界单元质量,提出一种边界优先的Delaunay-层推进网格生成方法.首先在剖分域内粗的约束Delaunay背景网格的辅助下,以物理域的位置偏差为引导,在参数域中迭代计算边界点的法矢量;然后结合层推进策略,在几何特征附近生成各向异性或各向同性正交网格;最后使用Coring技术加速内部网格的生成并进行单元合并,得到四边形为主的网格.若干复杂平面区域和组合曲面模型的剖分结果表明,所提方法可生成等角扭曲度和纵横比优于主流商业软件的网格;在12个线程的PC平台上,使用OpenMP并行剖分包含21 772张曲面的引擎模型只用了38.68 s.     

基于3DS模型的四边形网格生成算法研究

针对文献[1]中提出的四边形网格形变因子的不足，提出了曲面中改进的四边形形变因子。根据此约束条件，研究并实现了一种将3DS模型表面三角形网格转化为四边形网格的合并算法，并对极少的残余三角形进行拆分处理，实现彻底转化。经过对已有模型的实际转化实验，表明了本算法的有效性。     

基于 h 型自适应有限元法在薄板冲压 成型中的应用

在对薄板冲压成型这一过程进行有限元仿真分析时,难以精确分析场变量发生剧烈变化的应力 集中及应变梯度大的区域,如何平衡精度和效率间的关系是冲压成型仿真的关键。因此,基于非线性有限元大 变形的相关理论,针对动态仿真的网格自适应关键技术,建立了自适应分析模式下的薄板冲压成型算法。为了 提高计算精度,提出基于单元应变能增量的能量误差准则以及基于板料成型几何特征的几何误差准则,并结合 2 类误差准则,建立了基于自适应分析算法的误差判断准则;为了提高计算效率,引入阻尼因子提出了阻尼子 循环算法,将自适应加密后的板料单元按时间步长划分为若干个区域,并按照不同时间步长分别求解。结果表 明,该算法有效提高了薄板冲压成型有限元仿真的精度与效率。     

有限元四边单元网格模型的参数化重建

不同于已有的从CAD模型出发构建体参数化模型的思路,为了进行等几何分析,从二维有限元四边单元网格模型出发,重建该网格模型对应的参数化模型.首先利用现有CAE软件生成有限元四边单元网格模型;然后进行网格预处理提取单元之间的拓扑信息,并依据规则实现网格单元规范合并、子域自适应合并、子域边界生成等操作,生成多个零亏格四边子域;最后利用边界插值算法和内点优化算法实现子域参数化.通过多个实例验证了文中算法的有效性;为有限元网格到体参数化模型的转换提供了技术支持,进而为实现海量的CAE模型参数化及其等几何分析提供了一条便捷的途径.     

针对密集点云的快速自适应四边形网格生成算法

为了能够从密集点云直接获得四边形网格,而不需要通过三角形网格重构获得,提出针对密集点直接构造的四边形网格生成算法.首先进行点云数据体素化得到体素模型,建立体素和点云的索引关系,并对体素做精细化操作,以提高映射效果;然后通过体素模型外表面的顶点与原始点云的映射得到四边形网格模型,并对四边形网格进行优化.在斯坦福的数据集上进行实验,并使用MeshLab软件进行效果展示,结果表明,该算法可以基于密集点云直接生成四边形网格模型,同时可以通过调整体素大小来自适应地改变算法效率和四边形网格的大小.     

基于变分隐式曲面的网格融合

三维物体融合利用三维模型之间的剪贴操作从两个或多个现有的几何模型中光滑融合出新的几何模型.作为一种新的几何造型方法,它正受到越来越多的关注.提出一种基于变分隐式曲面的网格融合新方法.首先利用平面截面切出网格物体的待融合边界,然后通过构造插值待融合网格物体边界的变分隐式曲面并对其进行多边形化,得到待融合网格物体间的过渡曲面,最后通过剪切掉过渡曲面的多余部分及拓扑合并操作以实现过渡网格曲面与原始网格间的光滑融合与现有的直接连接待融合网格物体边界以实现网格融合的算法相比,该方法不仅突破了对待融合物体的拓扑限制,允许多个物体同时进行融合,而且算法计算快速、鲁棒,使用方便,展示出良好的应用前景.     

Superfaces: polygonal mesh simplification with bounded error

The algorithm presented simplifies polyhedral meshes within prespecified tolerances based on a bounded approximation criterion. The vertices in the simplified mesh are a proper subset of the original vertices. The algorithm, called Superfaces, makes two major contributions to the research in this area: it uses a bounded approximation approach, which guarantees that a simplified mesh approximates the original mesh to within a prespecified tolerance (that is, every vertex v in the original mesh will lie within a user specified distance ϵ of the simplified mesh); its face merging procedure is efficient and greedy-that is, it does not backtrack or undo any merging once completed and thus, the algorithm is practical for simplifying very large meshes     

Polynomial surfaces interpolating arbitrary triangulations

Triangular Bezier patches are an important tool for defining smooth surfaces over arbitrary triangular meshes. The previously introduced 4-split method interpolates the vertices of a 2-manifold triangle mesh by a set of tangent plane continuous triangular Bezier patches of degree five. The resulting surface has an explicit closed form representation and is defined locally. In this paper, we introduce a new method for visually smooth interpolation of arbitrary triangle meshes based on a regular 4-split of the domain triangles. Ensuring tangent plane continuity of the surface is not enough for producing an overall fair shape. Interpolation of irregular control-polygons, be that in 1D or in 2D, often yields unwanted undulations. Note that this undulation problem is not particular to parametric interpolation, but also occurs with interpolatory subdivision surfaces. Our new method avoids unwanted undulations by relaxing the constraint of the first derivatives at the input mesh vertices: The tangent directions of the boundary curves at the mesh vertices are now completely free. Irregular triangulations can be handled much better in the sense that unwanted undulations due to flat triangles in the mesh are now avoided.     

Stable Real-Time Surgical Cutting Simulation of Deformable Objects Embedded with Arbitrary Triangular Meshes

Surgical simulators need to simulate deformation and cutting of deformable objects. Adaptive octree mesh based cutting methods embed the deformable objects into octree meshes that are recursively refined near the cutting tool trajectory. Deformation is only applied to the octree meshes; thus the deformation instability problem caused by degenerated elements is avoided. Biological tissues and organs usually contain complex internal structures that are ignored by previous work. In this paper the deformable objects are modeled as voxels connected by links and embedded inside adaptive octree meshes. Links swept by the cutting tool are disconnected and object surface meshes are reconstructed from disconnected links. Two novel methods for embedding triangular meshes as internal structures are proposed. The surface mesh embedding method is applicable to arbitrary triangular meshes, but these meshes have no physical properties. The material sub-region embedding method associates the interiors enclosed by the triangular meshes with physical properties, but requires that these meshes are watertight, and have no self-intersections, and their smallest features are larger than a voxel. Some local features are constructed in a pre-calculation stage to increase simulation performance. Simulation tests show that our methods can cut embedded structures in a way consistent with the cutting of the deformable objects. Cut fragments can also deform correctly along with the deformable objects.     

Semi-regular Quadrilateral-only Remeshing from Simplified Base Domains

Semi-regular meshes describe surface models that exhibit a structural regularity that facilitates many geometric processing algorithms. We introduce a technique to construct semi-regular, quad-only meshes from input surface meshes of arbitrary polygonal type and genus. The algorithm generates a quad-only model through subdivision of the input polygons, then simplifies to a base domain that is homeomorphic to the original mesh. During the simplification, a novel hierarchical mapping method, keyframe mapping , stores specific levels-of-detail to guide the mapping of the original vertices to the base domain. The algorithm implements a scheme for refinement with adaptive resampling of the base domain and backward projects to the original surface. As a byproduct of the remeshing scheme, a surface parameterization is associated with the remesh vertices to facilitate subsequent geometric processing, i.e. texture mapping, subdivision surfaces and spline-based modeling.     

Feature-preserving adaptive mesh generation for molecular shape modeling and simulation

We describe a chain of algorithms for molecular surface and volumetric mesh generation. We take as inputs the centers and radii of all atoms of a molecule and the toolchain outputs both triangular and tetrahedral meshes that can be used for molecular shape modeling and simulation. Experiments on a number of molecules are demonstrated, showing that our methods possess several desirable properties: feature-preservation, local adaptivity, high quality, and smoothness (for surface meshes). We also demonstrate an example of molecular simulation using the finite element method and the meshes generated by our method. The approaches presented and their implementations are also applicable to other types of inputs such as 3D scalar volumes and triangular surface meshes with low quality, and hence can be used for generation/improvement of meshes in a broad range of applications.     

Mesh blending

A new method for smoothly connecting different patches on triangle meshes with arbitrary connectivity, called mesh blending, is presented. A major feature of mesh blending is to move vertices of the blending region to a virtual blending surface by choosing an appropriate parameterization of those vertices. Once blending is completed, the parameterization optimization is performed to perfect the final meshes. Combining mesh blending with multiresolution techniques, an effective blending technique for meshes is obtained. Our method has several advantages: (1) the user can intuitively control the blending result using different blending radii, (2) the shape of cross-section curves can be adjusted to flexibly design complex models, and (3) the resulting mesh has the same connectivity as the original mesh. In this paper, some examples about smoothing, sharpening, and mesh editing show the efficiency of the method.     

网格融合技术在列车过隧道运动网格数值模拟中的应用

在高速列车过隧道问题的数值模拟中,为提高模拟准确性而考虑转向架、受电弓导流罩、车厢连接处等细部结构后,几何模型变得复杂。为了得到质量高、适用性强的计算网格,在列车附近生成非结构化四面体网格,运动网格及计算区域其余部分划分块结构化六面体网格。在融合面上,利用网格融合技术处理四面体网格的三角形面网格和六面体网格的四边形面网格的联结问题,通过控制节点位置的变化满足拓扑一致,实现无缝连接。通过三维数值模拟计算结果与一维实验结果的对比发现,在同等精度要求下,采用网格融合技术及分区思想生成的网格整体上数量更少,生成速率更高,该方法可推广应用于更复杂几何模型的网格划分中。     

Adaptive tetrahedral remeshing for modified solid models

During the engineering design process, a designed engineering component is usually repeatedly modified and analyzed to reach final design objectives, and completely mesh regeneration for each design change is very time consuming. An efficient remeshing approach for modified solid models using existing prior existing meshes is proposed in this paper to resolve this issue. It is mainly achieved via three main steps: different face (between the input model and its modification) identification, local destruction zone generation, and local mesh regeneration. In this approach, by carefully selecting a destruction zone to be removed from the original mesh model, a final geometric adaptive mesh model of the modified model is generated, which is very important for downstream analysis accuracy control. Additionally, the complex boundary of the variation region that needs to be remeshed is set up by merging the boundaries of modified region and the destruction zone without using complex intersection operations, which ensure the approach’s robustness. Experimental results on practical engineering parts are also shown to demonstrate the method’s performance.     

Mesh Parametrization Driven by Unit Normal Flow

Based on mesh deformation, we present a unified mesh parametrization algorithm for both planar and spherical domains. Our approach can produce intermediate frames from the original meshes to the targets. We derive and define a novel geometric flow: ‘unit normal flow (UNF)’ and prove that if UNF converges, it will deform a surface to a constant mean curvature (CMC) surface, such as planes and spheres. Our method works by deforming meshes of disk topology to planes, and spherical meshes to spheres. Our algorithm is robust, efficient, simple to implement. To demonstrate the robustness and effectiveness of our method, we apply it to hundreds of models of varying complexities. Our experiments show that our algorithm can be a competing alternative approach to other state-of-the-art mesh parametrization methods. The unit normal flow also suggests a potential direction for creating CMC surfaces.