首页> 外文期刊>Computers & Graphics >An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
【24h】

An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization

机译:基于约束Delaunay四面体化的四面体网格生成算法

获取原文
获取原文并翻译 | 示例

摘要

An unstructured tetrahedral mesh generation algorithm for 3D model with constraints is presented. To automatically generate a tetrahedral mesh for model with constraints, an advancing front algorithm is presented based on conforming constrained Delaunay tetrahedralization (CCDT). To reduce the number of visibility tests between vertices with respect to model faces as well as the computation of constrained Delaunay tetrahedra, a sufficient condition for DT (constrained Delaunay tetrahedralization whose simplexes are all Delaunay) existence is presented and utilized coupled to uniform grid and advancing front techniques in our algorithm. The mesh generator is robust and exhibits a linear time complexity for mechanical models with uniform density distribution.
机译:提出了一种带约束的3D模型非结构化四面体网格生成算法。为了自动生成具有约束条件的模型的四面体网格,提出了一种基于约束的Delaunay四面体化(CCDT)的前锋算法。为了减少相对于模型面的顶点之间的可见性测试次数以及受约束的Delaunay四面体的计算,提出了存在DT(受约束的Delaunay四面体,其单纯形均为Delaunay)的充分条件,并将其用于均匀网格和前进算法中的前沿技术。网格生成器是鲁棒的,并且对于具有均匀密度分布的机械模型表现出线性时间复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号