SAND99-2852
Unlimited Release
October 1999
Integration of Mesh Optimization with
3D All-Hex Mesh Generation,
LDRD Subcase 3504340000,
Final Report
Patrick Knupp
Scott A. Mitchell
Parallel Computing Sciences
Dept. 9226, MS0847
Sandia National Laboratories
Albuquerque, NM 87185-0847
Abstract
In an attempt to automatically produce high-quality all-hex meshes, we investigated a mesh improvement strategy: given an initial poor-quality all-hex mesh, we iteratively changed the element connectivity, adding and deleting elements and nodes, and optimized the node positions. We found a set of hex reconnection primitives. We improved the optimization algorithms so they can untangle a negative-Jacobian mesh, even considering Jacobians on the boundary, and subsequently optimize the condition number of elements in an untangled mesh. However, even after applying both the primitives and optimization we were unable to produce high-quality meshes in certain regions. Our experiences suggest that many boundary configurations of quadrilaterals admit no hexahedral mesh with positive Jacobians, although we have no proof of this.