Adaptive and Unstructured Mesh Cleaving
Bronson, Jonathan R. and Shankar P. Sastry, Joshua A. Levine, Ross T. Whitaker
23rd International Meshing Roundtable, Elsevier Ltd., October 12-15 2014
23rd International Meshing Roundtable
Scientific Computing and Imaging Institute, Salt Lake City, UT, U.S.A.
School of Computing, Clemson University, Clemson, SC, U.S.A.
We propose a new strategy for boundary conforming meshing that decouples the problem of building tetrahedra of proper size and
shape from the problem of conforming to complex, non-manifold boundaries. This approach is motivated by the observation that
while several methods exist for adaptive tetrahedral meshing, they typically have diculty at geometric boundaries. The proposed
strategy avoids this conflict by extracting the boundary conforming constraint into a secondary step. We first build a background
mesh having a desired set of tetrahedral properties, and then use a generalized stenciling method to divide, or ìcleaveî, these
elements to get a set of conforming tetrahedra, while limiting the impacts cleaving has on element quality. In developing this new
framework, we make several technical contributions including a new method for building graded tetrahedral meshes as well as a
generalization of the isosurface stung and lattice cleaving algorithms to unstructured background meshes.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article