基于工业CT图像重构的网格模型的保特征简化方法

对基于工业CT图像重构的网格模型进行网格简化时,大多数现有网格模型简化算法会丢失特征,出现网格质量不好的问题。因此提出一种网格模型保特征简化方法,该方法用三角形折叠法对原始模型进行简化,当简化后模型的平均二面角角度误差达到允许误差后,再使用边折叠法对模型进行简化。在三角形折叠法中提出了利用被折叠三角形的法向量、各个顶点的高斯曲率及其在周边三角形上的投影确定该三角形的折叠点,利用局部体积误差与二面角角度误差的无因次化和确定折叠代价的方法;在边折叠法中提出了将二面角角度误差引入到二次误差测度(QEM)法的折叠代价中的改进QEM法。实验结果表明:与其他算法相比,该方法能够生成保特征、高质量、低几何误差的网格模型。     

基于工业CT图像的自适应三维网格模型重建

针对X射线扫描得到的工业CT图像重建三角网格模型存在尖锐特征丢失、狭长三角形和三角面片数量多等问题，提出一种自适应三维网格模型重建算法。首先对图像进行预处理；其次采用八叉树结构确定体元；然后利用二次误差函数（QEF）构建自适应八叉树；最后剖分四边形生成三角网格。使用立方体数据和两组实际扫描的CT数据对所提算法的性能进行验证分析，实验结果表明：所提算法在简化网格的同时仍能保持物体的尖锐特征，减少了狭长三角形的数量。利用所提算法生成三角网格模型的简化率可达90%，简化后网格质量大于0.3的三角网格平均占比为99%，有效地提高了由工业CT图像重建三角网格模型的质量。     

基于质心Voronoi图重构的UDSM边折叠简化

城市数字表面模型网格(UDSM)的相邻网格常常出现曲率剧变,而这些位置是UDSM的细节部分,简化过程中应当尽量保持。针对该情况,引入了质心Voronoi图重划分网格,将曲率较小的表面的点云密度大大降低。重划分的网格表面细节与周围的平滑表面的三角网格尺寸悬殊,在该基础上使用二次误差矩阵边折叠进行LOD构建时网格发生明显变化,范围大大减少。算法在时间性能与网格误差与直接边折叠相近的前提下,更多地保存简化后的网格细节。     

基于工业CT图像重构的网格模型的全局优化方法

针对用工业CT切片图像直接重构得到的网格模型质量不高的问题,提出一种不受拓扑结构限制的隐式曲面重构全局优化方法。该方法将三维表面模型用隐式函数来表示,通过模型提供的点云信息计算出隐式函数,提取等值面,实现曲面重构。针对隐式曲面重构数据处理量大的问题,引入FFTW快速傅里叶变换来提高效率。实验结果表明,该方法能够同时实现三角网格模型的去噪、网格平滑、简化以及孔洞修补,与保特征的均匀化网格平滑算法相比,去噪效果更好,效率更高。     

保特征的自适应三角网格规范化算法

为了提高基于工业CT图像重构的三角网格质量，提出了顶点调整和特征因子相结合的网格规范化算法。引入模型特征因子和局部网格质量提高程度作为网格调整的控制条件，保留原始模型的局部细节特征；采用法矢量阈值按规律递增的方式自适应控制网格调整，实现不同曲率特征的自动识别。实验结果表明，与现有方法相比，该方法能更好地规范模型的三角网格，同时保留了原始模型的细节特征。     

二维矢量边界推进非结构网格生成方法

提出二维矢量边界推进生成非结构三角形网格方法并证明其可行性.根据流场边界尺度布置边界节点并运用矢量边界推进方法生成背景网格,运用符号面积函数和概率筛选方法布置初始点阵,提出Spring-Laplace方法优化节点位置,同时利用边交换技术优化网格结构.该方法可包含任意点源、线源和内嵌边界,可自由进行局部自适应加密或稀疏,实现任意平面域内与尺度要求一致的高效光滑三角网格剖分.     

三角B-B曲面在非结构网格生成中的应用

基于生成非结构化网格的Delaunay三角形化方法,应用三次三角Bernstein-Bézier曲面来控制网格点的分布情况。对于给定边界,利用三次非均匀B样条进行边界的拟合及重新离散。对初始化形成的Delaunay三角形,应用三次三角Bernstein-Bézier曲面来计算位于其中的点的长度标尺,通过对三角Bernstein-Bézier曲面边界点的定义来控制三角形内长度标尺的分布。对复杂通道网格剖分的实例表明,此方法可以很好地控制内部网格点的分布情况。     

多点择优推进阵面法生成曲面三角形网格

在现有曲面非结构网格生成法的基础上,提出了一种新的曲面网格生成法——多点择优推进阵面法.它可在曲面上直接进行三角形网格划分,克服了映射法的网格变形问题,并且可以在网格生成结束后,对曲面网格直接进行Laplace格点松弛光顺.该方法使用简单,不受曲面块类型的限制,且网格质量高,可以为三维非结构网格生成提供高质量的初始阵面,并给出了若干个算例.     

多边形交错网格的守恒重映算法

提出基于细分和数值积分思想的一种离散的守恒重映方法——质点重映方法.密度分布可采用一阶精度的分片常数分布,或二阶精度的分片线性分布.分片线性密度分布函数采用面平均方法构造.重映过程中,借助四边形辅助网格,实现了交错网格节点量的重映.质点重映方法既适用于结构网格,也适用于非结构网格,且不要求新旧网格之间一一对应.数值结果表明,一阶精度重映算法健壮性好,但会产生较大的扩散效应;二阶精度重映算法可较好地保持密度分布的特性,但存在单调性问题.为改善二阶精度重映方法单调性,将结构网格质量守恒调整算法推广到非结构网格上,以限制新网格的质量密度.给出了一些重映的例子,并进行了误差分析.     

内部带特征约束的任意平面域的三角形网格生成方法

基于Ｄｅｌａｕｎａｙ三角化方法 ,给出了内部带有任意复杂特征约束的任意平面域的三角形网格生成方法。区域内部特征约束可以是点、直线、圆、圆弧、平面样条曲线以及由它们组合构成的封闭环或者不封闭环。     

OPTIMIZATION OF SIMPLIFIED MODELS MESHED WITH FINITE TRIANGULAR PLATE ELEMENTS

Designers often want to analyze more and more sophisticated structures, thus leading to very large finite element models (typically 10 00 000 degrees of freedom for a body car, for example). These models being too costly for the early stages of design and optimization can be reduced by a substructure analysis or a mesh simplification of the components. A methodology is proposed in this paper for simplifying finite triangular plate element models leading to a dramatic reduction in the number of degrees of freedom while preserving the dynamical properties of the initial system. In particular, the proposed method is developed for models composed of the plate element STIFF63 generated by the software ANSYS. The principle consists in determining the parameters (thickness, Young's modulus, density) of the triangular elements of a coarse model which replaces a large set of elements of the refined model. The simplified mesh must satisfy one of two criteria. The first requires that the mass and stiffness matrices of the simplified model be as close as possible to the Guyan condensed matrices of the refined model on the reduced node set, whilst the second requires that the dynamical properties of the global structure be preserved. The application of these approaches is illustrated on two test structures using the gradient method to solve the resulting optimization problem. The second approach is shown to give the best results. Typically, the size of the models can be reduced by a factor of 20 whilst preserving the dynamical properties of the structure at low frequencies.     

Adaptive model simplification in real-time rendering for visualization

In this paper, we propose four different geometric measures to identify appropriate triangles to be simplified in 3D complex model. Each measure yields different weight on the same surface and produces a unique simplified model that worth to be analyzed. The proposed measures involve consideration on the resulting of the surfaces collapse, the high peak and low peak of the triangles mesh, the irregular triangle shape, the capacity and boundary view on the triangles mesh. The chosen triangle is to be collapsed based criterion on Half-edge Collapse Transformation method. From the empirical results, one of the proposed measures presents almost excellence in all the criteria mentioned above. The empirical results include the quality of the surface models (visualization purpose), the efficiency of the measures and the overall appearance preservation of the simplified models. The proposed measures are then to be compared to three existing measures. From the analyzed results, we combine the measures to adapt to the user’s response for generating the user-desired simplified models.     

A hybrid variational front tracking-level set mesh generator for problems exhibiting large deformations and topological changes

We present a method for generating 2-D unstructured triangular meshes that undergo large deformations and topological changes in an automatic way. We employ a method for detecting when topological changes are imminent via distance functions and shape skeletons. When a change occurs, we use a level set method to guide the change of topology of the domain mesh. This is followed by an optimization procedure, using a variational formulation of active contours, that seeks to improve boundary mesh conformity to the zero level contour of the level set function. Our method is advantageous for Arbitrary-Lagrangian–Eulerian (ALE) type methods and directly allows for using a variational formulation of the physics being modeled and simulated, including the ability to account for important geometric information in the model (such as for surface tension driven flow). Furthermore, the meshing procedure is not required at every time-step and the level set update is only needed during a topological change. Hence, our method does not significantly affect computational cost.     

三维非结构网格自动生成

采用各向异性平面非结构网格生成技术对曲面的参数平面进行三角剖分,从而得到曲面的非结构网格,作为三维非结构网格的边界网格.应用推进面法生成网格内点,增量法将生成的内点逐点插入现有网格进行网格细化,得到三维计算域的Delaunay非结构网格.讨论了非结构网格质量优化方法.给出几个算例说明方法的应用.     

A Pseudo-Stokes Mesh Motion Algorithm

This work presents a moving mesh methodology based on the solution of a pseudo flow problem. The mesh motion is modeled as a pseudo Stokes problem solved by an explicit finite element projection method. The mesh quality requirements are satisfied by employing a null divergent velocity condition. This methodology is applied to triangular unstructured meshes and compared to well known approaches such as the ones based on diffusion and pseudo structural problems. One of the test cases is an airfoil with a fully meshed domain. A specific rotation velocity is imposed as the airfoil boundary condition. The other test is a set of two cylinders that move toward each other. A mesh quality criterion is employed to identify critically distorted elements and to evaluate the performance of each mesh motion approach. The results obtained for each test case show that the pseudo-flow methodology produces satisfactory meshes during the moving process.     

弧形调强放射治疗对剂量计算方法的要求

在弧形调强放射治疗的治疗计划设计中, 由于包含有很多照射方向, 调强最优化的射束元矩阵计算需要很大的计算量和存储量, 为提高计算效率常使用简化剂量计算模型计算射束元矩阵, 因此有必要研究简化模型对治疗计划质量产生影响。 对一个模拟例子和一个临床实例, 使用没考虑散射效应的原射线剂量计算模型计算射束元矩阵, 由此进行最优化计算。 在得到最优化强度分布后, 通过比较原射线剂量计算模型和微分卷积剂量计算模型得到的剂量分布, 研究了不同射束数目条件下, 使用简化剂量计算模型计算射束元剂量矩阵对最终的剂量分布质量的影响。 结果表明, 在射线束很多的情况下(对应弧形调强照射）, 用简化的剂量计算模型, 即不考虑散射来计算射束元剂量矩阵, 会导致靶区剂量分布的质量大大低于预期的剂量分布质量, 因此, 弧形调强放射治疗的最优化计算中, 有效考虑散射的影响是必要的。 In the treatment planning for arc intensity modulated radiation therapy, because many irradiation directions are involved, the computing time and storage space needed for calculating beamlet dose matrices in optimization is quite heavy. In order to improve the computation efficiency, the simplified dose calculation is often used for the calculation of the dose matrices. Thus, it is deserved to study how this simplification could influence the quality of the treatment plan. In this paper, a simulation and a clinical case are adopted. Using the primary dose calculation model without taking into account the scattering effect to generate the dose matrices of beamlets, the optimization for beam intensity profile are firstly carried out. Then, based on the obtained intensity profile, the dose distributions are recalculated by using the primary dose calculation model and the differential convolution superposition dose calculation model which is more accurate but more time consuming. By comparing dose distributions obtained by this two models, the influence of using simplified model for dose matrix calculation on beam profile optimization is studied. The results demonstrate that when the beam number is large(corresponding to the arc modulated radiation), using the simplified model for the calculation of dose matrix of beamlets will reduce the quality of dose distribution greatly comparing with the expected dose distribution quality. Thus it is very necessary to correctly take into account the scattering effect in beam profile optimization for the arc intensity modulated radiation therapy.     

Free Mesh Method: fundamental conception, algorithms and accuracy study

The finite element method (FEM) has been commonly employed in a variety of fields as a computer simulation method to solve such problems as solid, fluid, electro-magnetic phenomena and so on. However, creation of a quality mesh for the problem domain is a prerequisite when using FEM, which becomes a major part of the cost of a simulation. It is natural that the concept of meshless method has evolved. The free mesh method (FMM) is among the typical meshless methods intended for particle-like finite element analysis of problems that are difficult to handle using global mesh generation, especially on parallel processors. FMM is an efficient node-based finite element method that employs a local mesh generation technique and a node-by-node algorithm for the finite element calculations. In this paper, FMM and its variation are reviewed focusing on their fundamental conception, algorithms and accuracy.