...
首页> 外文期刊>IEEE Transactions on Magnetics >Automatic generation of 3D meshes for complicated solids
【24h】

Automatic generation of 3D meshes for complicated solids

机译:自动生成复杂实体的3D网格

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

获取外文期刊封面封底 >>

       

摘要

To approach full automatic mesh generation, three problems have to be solved: (1) full automatic generation of geometry specifying the mesh from the solid model; (2) a constrained triangulation algorithm for adding a new point to an existing mesh; and (3) a description and realization of the user's mesh distribution desires which may be implied by the problem itself, as in the case of self-adaptive finite element analysis. The authors merge a novel mesh control idea (see J.M. Zhou, 1989) with the constrained Delaunay triangulation algorithm and an initial triangulation algorithm to achieve efficient, flexible, and reliable triangulation of complicated solids. A new strategy for adaptive mesh refinement is also included.
机译:为了实现全自动网格生成,必须解决三个问题:(1)全自动生成从实体模型指定网格的几何图形; (2)约束三角剖分算法,用于向现有网格添加新点; (3)像自适应有限元分析那样,问题本身可能暗含的用户网格分布期望的描述和实现。作者将约束控制的Delaunay三角剖分算法和初始三角剖分算法融合了一种新颖的网格控制思想(请参见Zhou,1989年),以实现对复杂实体的高效,灵活和可靠的三角剖分。还包括用于自适应网格细化的新策略。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号