An adaptive method for the automatic triangulation of 3D parametric surfaces
An adaptive method for the automatic triangulation of 3D parametric surfaces
复制标题
DOI：
10.1016/s0010-4485(97)00085-7
复制
发表时间：
1998-02-01
影响因子：
4.3
通讯作者：
Cuilliere, JC
中科院分区：
文献类型：
--
作者：
Cuilliere, JC
我们已经开发了自动网格生成程序的基础上推进前的方法和具有先验的节点密度计算。在整个方法中的一个关键步骤包括离散化的边缘和表面的输入B-Rep结构的能力，尽可能密切地尊重这个节点的密度函数的一部分，这是非常有趣的分析或表示的目的。这里提出的工作集中在三维参数曲面的离散化与强烈的曲率变化相对于一个节点密度函数与陡峭的梯度。该算法特别适合于有限元网格生成的目的，也在许多工程应用中，一个三维模型进行三角剖分。我们将处理，在这种情况下，使用的技术，以网格参数曲面与指定的离散化公差。在本文中，我们还提出了一个新的质量指标，三角形和四面体网格的先验节点密度约束的背景下。(C)1998爱思唯尔科技有限公司版权所有。
We have developed automatic mesh generation procedures based on advancing front methods and featuring a priori nodal density calculations. A crucial step in the overall method consists of discretizing the edges and surfaces of an input B-Rep structure with the ability to respect as closely as possible this nodal density function across the part, which is highly interesting for analysis or representation purposes. The work presented here focuses on the discretization of three-dimensional parametric surfaces with strong variations of curvature with respect to a nodal density function with steep gradients. This algorithm is particularly suitable for FE mesh generation purposes and also in many engineering applications for which a 3D model has to be triangulated. We will tackle, in this context, the use of the technique in order to mesh parametric surfaces with a specified discretization tolerance. In this paper, we also present a new quality indicator for triangular and tetrahedral meshes in the context of a priori nodal density constraints. (C) 1998 Elsevier Science Ltd. All rights reserved.