Abstract
The paper presents an algorithm of volume meshing by using the Advancing Front Technique (AFT) combined with the Delaunay Triangulation. The tetrahedronization starts with the surface mesh with the elements oriented towards the interior 3-D domain. The main idea is based upon AFT, with simultaneous points insertion and tetrahedra creation. The characteristic feature of the approach is the part of AFT in the case, when a new calculated point on the current face of the front is not accepted then the existing point in the front is found to create a new tetrahedron by using the Delaunay triangulation on the given set of points. Additionally the algorithm takes a mesh size function into account.
Highlights
The purpose of the paper is to describe a method of grid generation for 3-D domains
The Advancing Front Technique gives the possibility of terahedronization of complex geometries [1]
When the Advancing Front Technique is combined with the Delaunay triangulation, very neatly looking meshes can be obtained
Summary
The purpose of the paper is to describe a method of grid generation for 3-D domains. The problem plays an important role in finite element applications. The approach presented here is based mainly upon AFT with simultaneous points insertion and triangulation [4, 5], but when different parts of the front ”meet” and the point to be inserted at this time is not accepted, on the considered triangle of the front the tetrahedron is built by using as a lacking vertex the point from the front. It is done by using the idea of the Delaunay.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.