Tetrahedral mesh generation in convex primitives
作者:
Lauri Kettunen,
Kimmo Forsman,
期刊:
International Journal for Numerical Methods in Engineering
(WILEY Available online 1995)
卷期:
Volume 38,
issue 1
页码: 99-117
ISSN:0029-5981
年代: 1995
DOI:10.1002/nme.1620380107
出版商: John Wiley&Sons, Ltd
关键词: Automatic mesh generation;Tetrahedral mesh;Finite element techniques
数据来源: WILEY
摘要:
AbstractThis paper presents a method for generating tetrahedral meshes in three‐dimensional primitives. Given a set of closed and convex polyhedra having non‐zero volume and some mesh controlling parameters, the polyhedra are automatically split to tetrahedra satisfying the criteria of standard finite element meshes. The algorithm tries to generate elements close to regular tetrahedra by maximizing locally the minimum solid angles associated to a set of a few neighbouring tetrahedra. The input parameters define the size of the tetrahedra and they can be used to increase or decrease the discretization locally. All the new nodes, which are not needed to describe the geometry, are generated automatica
点击下载:
PDF
(1023KB)
返 回