基于特征保持的三维模型四面体化及优化

三维模型四面体化是一种重要的有限元网格生成技术.介绍了一种特征保持的四面体网格生成及优化算法.首先使用三维模型主成分分析进行预处理,然后用体心立方构建初始四面体,接着通过拉普拉斯坐标改变模型边界切点的移动方式保持模型的局部特征,最后构造改进的密度能量误差函数优化四面体网格质量.实验结果表明,该方法可行、有效,且能很好地保持模型特征.     

3D boundary recovery by constrained Delaunay tetrahedralization

Three‐dimensional boundary recovery is a fundamental problem in mesh generation. In this paper, we propose a practical algorithm for solving this problem. Our algorithm is based on the construction of a constrained Delaunay tetrahedralization (CDT) for a set of constraints (segments and facets). The algorithm adds additional points (so‐called Steiner points) on segments only. The Steiner points are chosen in such a way that the resulting subsegments are Delaunay and their lengths are not unnecessarily short. It is theoretically guaranteed that the facets can be recovered without using Steiner points. The complexity of this algorithm is analyzed. The proposed algorithm has been implemented. Its performance is reported through various application examples. Copyright © 2010 John Wiley & Sons, Ltd.     

Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique

Local transformation, or topological reconnection, is one of the effective procedures for mesh improvement method, especially for three‐dimensional tetrahedral mesh. The most frequently used local transformations for tetrahedral mesh are so‐called elementary flips, such as 2‐3 flip, 3‐2 flip, 2‐2 flip, and 4‐4 flip. Owing to the reason that these basic transformations simply make a selection from several possible configurations within a relatively small region, the improvement of mesh quality is confined. In order to further improve the quality of mesh, the authors recently suggested a new local transformation operation, small polyhedron reconnection (SPR) operation, which seeks for the optimal tetrahedralization of a polyhedron with a certain number of nodes and faces (typically composed of 20–40 tetrahedral elements). This paper is an implementation of the suggested method. The whole process to improve the mesh quality by SPR operation is presented; in addition, some strategies, similar to those used in advancing front technique, are introduced to speed up the operation. The numerical experiment shows that SPR operation is quite effective in mesh improvement and more suitable than elementary flips when combined with smoothing approach. The operation can be applied to practical problems, gaining high mesh quality with acceptable cost for computational time. Copyright © 2009 John Wiley & Sons, Ltd.     

Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes

In this paper, we investigate boundary recovery, the problem that has troubled researchers ever since Delaunay-based methods were applied to generate mesh. There are a number of algorithms for boundary recovery already and most of them depend heavily on adding extra nodes. In this paper, we make an effort to seek a method to recover boundaries without using extra nodes. It was noted that some previous algorithms imposed artificial boundary constraints on a meshing problem at the recovering stage; we first try to discard these artificial constraints and thus make things easier. Then a new method is proposed by which the boundaries can be recovered by means of two operations: (1) creating a segment in the mesh and (2) removing a segment from the mesh. Both operations are special cases of a general local transformation called small polyhedron reconnection operation. The method works well when coupled with the sphere-packing method proposed by the first author. If the mesh sizing function is suitable, a good configuration of nodes will be created accordingly by the sphere-packing method and the boundary can be recovered by the local transformation presented here without inserting extra nodes. Copyright © 2007 John Wiley & Sons, Ltd.     

Complex conforming Delaunay triangulation

A novel algorithm of conforming Delaunay triangulation for curved geometry is presented in the paper.A progress has been made for the problem puzzled Delaunay refinement where curved constraints cannot be accepted as input directly.The algorithm is based on a new sufficient condition for the existence of constraints in triangulation.It requires computing only the intersection between constraints and Voronoi edges or faces instead of the circum-sphere of curved constraint.For the termination of the algorithm...     

Interface handling for three‐dimensional higher‐order XFEM‐computations in fluid–structure interaction

Three‐dimensional higher‐order eXtended finite element method (XFEM)‐computations still pose challenging computational geometry problems especially for moving interfaces. This paper provides a method for the localization of a higher‐order interface finite element (FE) mesh in an underlying three‐dimensional higher‐order FE mesh. Additionally, it demonstrates, how a subtetrahedralization of an intersected element can be obtained, which preserves the possibly curved interface and allows therefore exact numerical integration. The proposed interface algorithm collects initially a set of possibly intersecting elements by comparing their ‘eXtended axis‐aligned bounding boxes’. The intersection method is applied to a highly reduced number of intersection candidates. The resulting linearized interface is used as input for an elementwise constrained Delaunay tetrahedralization, which computes an appropriate subdivision for each intersected element. The curved interface is recovered from the linearized interface in the last step. The output comprises triangular integration cells representing the interface and tetrahedral integration cells for each intersected element. Application of the interface algorithm currently concentrates on fluid–structure interaction problems on low‐order and higher‐order FE meshes, which may be composed of any arbitrary element types such as hexahedra, tetrahedra, wedges, etc. Nevertheless, other XFEM‐problems with explicitly given interfaces or discontinuities may be tackled in addition. Multiple structures and interfaces per intersected element can be handled without any additional difficulties. Several parallelization strategies exist depending on the desired domain decomposition approach. Numerical test cases including various geometrical exceptions demonstrate the accuracy, robustness and efficiency of the interface handling. Copyright © 2009 John Wiley & Sons, Ltd.     

基于四面体剖分的并行地质块体建模方法

针对传统三维地质建模面临的内存消耗大,运行效率低的问题,提出了一种基于非结构四面体网格的并行地质块体建模方法。该方法采用“分治合并”的思想。首先将地质层位散点融合分割成若干个独立封闭块体;然后对每个块体进行表面三角形网格剖分,限定四面体剖分等步骤,形成块体的四面体网格剖分;最后将所有块体网格合并成最终地质模型。该方法中的块体剖分步骤应用多进程并行进行,提高了方法效率,并分摊计算机内存压力,可满足大尺度地质构造块体建模需求。该方法可为基于非结构网格的数值方法（如有限体积法、有限元方法等）的地震正演、偏移等算法提供合适的模型数据。     

面向四面体网格生成的曲面Delaunay三角化算法

提出了一种曲面域Delaunay三角网格的直接构造算法。该算法在曲面网格剖分的边界递归算法和限定Delaunay四面体化算法的基础上,利用曲面采样点集的空间Delaunay四面体网格来辅助曲面三角网格的生成,曲面上的三角网格根据最小空球最小准则由辅助四面体网格中选取,每个三角形都满足三维Delaunay空球准则,网格质量有保证,并且极大的方便了进一步的曲面边界限定下的Delaunay四面体化的进行。     

医学断层图像三维重建的辅助轮廓线法

在原有的轮廓线基础上生成与之相似的辅助轮廓线．然后把各轮廓线三角化形成一层层的三角面片，最后按一定的规则把各层三角面片从外到内直接连接形成四面体，从而完成三维重构．文中算法尤其适合基于断层轮廓线的医学图象三维重构，与已有的三维重构法（如MC．MT，Delaunay四面体化）相比，具有算法简单、思路自然、易于实现的特点．