کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10336521 692089 2005 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Graphics - Volume 29, Issue 4, August 2005, Pages 606-615
نویسندگان
, , ,