Abstract
In this paper we describe an algorithm for generating a triangular mesh within an arbitrary planar domain. When is applied the finite element method to numerical simulation, the discretization of the domain becomes on essential part of the procedure. There are many reports on automatic mesh generation methods, such as coordinate transformation, blending function, the Quadtree method, the Delaunay method, and the advancing front method. The main characteristic of the proposed algorithm is that the position of the nodes is generated in the original polygonal region as much as possible in the form of an equilateral triangle and the triangulation of the inner nodes is carried out by the bucket method of computational geometry prior to the global construction of the triangular mesh model. Then the triangulation of the remaining region is carried out utilizing the advancing front method. The processing scheme is developed and applied to several examples. The numerical results are demonstrated and the effectiveness is discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
