Abstract

AbstractA technical description of the algorithms employed in the modified quadtree mesh generator is given. Although the basis of the mesh generator is the same as the original version developed by Yerry and Shephard,1,2 the actual algorithms on which it is built have been entirely changed for the purpose of ensuring the robustness of the technique. As demonstrated in the paper the algorithmic changes made do ensure the robustness of the approach, but introduce additional algorithmic difficulties, the solutions of which are also presented. In addition to examples showing the capability of the mesh generator, the linear computational growth rate of the mesh generator is demonstrated.

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 call

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.