Meshing of domains with complex internal geometries

Abstract

Abstract This paper presents a meshing algorithm for domains with internal boundaries. It is an extension of the gridding algorithm presented by Persson and Strang. The resulting triangulation matches all boundaries, and the triangles are all nearly equilateral. Equilateral triangles are beneficial for a finite volume discretization, as fluid flow between elements of very different size is only possible at small timesteps. The mesh generator is compared with the well regarded Triangle programme, where both element quality and simulation performance are checked. It is shown that our mesh generator consistently delivers better meshes. Copyright © 2006 John Wiley & Sons, Ltd.