Simplicial Meshing with Automatic Length Scale Computation

, 1997

MESHING
RESEARCH
CORNER

Department of Mechanical Engineering
The University of British Columbia
http://www.mech.ubc.ca/~cfog/

Abstract
This paper presents a new approach to unified generation of boundary and interior discretizations. A length scale for the mesh is automatically computed from the polygonal or polyhedral boundary definition and used to refine both the boundary and interior discretizations at once. An algorithm for automatic length scale computation ss presented. Conceptually, this approach can be extended to meshing from CAD data and to anisotropic mesh generation. A generic set of mesh manipulation primitives point insertion, point deletion, local reconnection, and smoothing - for mesh refinement and improvement are described. A mesh generation algorithm based on the length scale and primitives is presented. A useful new variant on an existing algorithm for tetrahedralization of a polyhedral domain is given. Several mesh generation examples, in both two and three dimensions, are shown.