Display options
Cite
Bronson JR, Sastry SP, Levine JA, et al. Adaptive and Unstructured Mesh Cleaving. Procedia Eng. 2014;82:266-278doi: 10.1016/j.proeng.2014.10.389.
Bronson, J. R., Sastry, S. P., Levine, J. A., & Whitaker, R. T. (2014). Adaptive and Unstructured Mesh Cleaving. Procedia engineering, 82266-278. https://doi.org/10.1016/j.proeng.2014.10.389
Bronson, Jonathan R, et al. "Adaptive and Unstructured Mesh Cleaving." Procedia engineering vol. 82 (2014): 266-278. doi: https://doi.org/10.1016/j.proeng.2014.10.389
Bronson JR, Sastry SP, Levine JA, Whitaker RT. Adaptive and Unstructured Mesh Cleaving. Procedia Eng. 2014;82:266-278. doi: 10.1016/j.proeng.2014.10.389. PMID: 26137171; PMCID: PMC4484869.
Copy Download .nbib Format: NLM
Share it on

Procedia Eng. 2014;82:266-278. doi: 10.1016/j.proeng.2014.10.389.

Adaptive and Unstructured Mesh Cleaving.

Procedia engineering

Jonathan R Bronson, Shankar P Sastry, Joshua A Levine, Ross T Whitaker

Affiliations

  1. Scientific Computing and Imaging Institute, Salt Lake City, UT, U.S.A.
  2. School of Computing, Clemson University, Clemson, SC, U.S.A.

PMID: 26137171 PMCID: PMC4484869 DOI: 10.1016/j.proeng.2014.10.389

Abstract

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 difficulty 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 stuffing and lattice cleaving algorithms to unstructured background meshes.

Keywords: Bounded; Meshing; Multimaterial; Quality; Tetrahedral; Unstructured

References

  1. IEEE Trans Vis Comput Graph. 2008 Nov-Dec;14(6):1539-46 - PubMed
  2. IEEE Trans Vis Comput Graph. 2011 Apr;17(4):426-39 - PubMed
  3. Eng Comput. 2012 Oct 1;28(4):331-344 - PubMed
  4. Proc Int Meshing Roundtable. 2013;2013:191-209 - PubMed

Publication Types

Grant support