CORC  > 清华大学
An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
Yang, YJ ; Yong, JH ; Sun, JG
2010-05-06 ; 2010-05-06
关键词CCDT finite element methods octree LOCAL TRANSFORMATIONS TRIANGULATIONS Computer Science, Software Engineering
中文摘要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. (c) 2005 Elsevier Ltd. All rights reserved.
语种英语 ; 英语
出版者PERGAMON-ELSEVIER SCIENCE LTD ; OXFORD ; THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND
内容类型期刊论文
源URL[http://hdl.handle.net/123456789/10039]  
专题清华大学
推荐引用方式
GB/T 7714
Yang, YJ,Yong, JH,Sun, JG. An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization[J],2010, 2010.
APA Yang, YJ,Yong, JH,&Sun, JG.(2010).An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization..
MLA Yang, YJ,et al."An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization".(2010).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace