Robust, geometrically based, automatic two‐dimensional mesh generation

Abstract

A 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.