Issue No. 02 - Feb. (2014 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2013.115
Jonathan Bronson , Sch. of Comput., Univ. of Utah, Salt Lake City, UT, USA
Joshua A. Levine , Sch. of Comput., Univ. of Utah, Salt Lake City, UT, USA
Ross Whitaker , Sch. of Comput., Univ. of Utah, Salt Lake City, UT, USA
We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach.
Lattices, Materials, Topology, Geometry, Finite element analysis, Joining processes, Biological system modeling
J. Bronson, J. A. Levine and R. Whitaker, "Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees," in IEEE Transactions on Visualization & Computer Graphics, vol. 20, no. 2, pp. 223-237, 2014.