Abstract
Adaptive grid generation is a relatively new scheme for finite element analysis. A number of algorithms have been suggested by several authors. The methods have many limitations in their implementation. In this paper a simplified method for adaptive mesh generation by dividing complex domain into convex polygons based on Joe and Simpson and Delaunay triangulation is presented. The algorithm is applied to a number of two-dimensional problems to demonstrate the suitability of the method.
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.
