This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees
Feb. 2014 (vol. 20 no. 2)
pp. 223-237
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.
Index Terms:
Lattices,Materials,Topology,Geometry,Finite element analysis,Joining processes,Biological system modeling,adaptive meshing,Lattices,Materials,Topology,Geometry,Finite element analysis,Joining processes,Biological system modeling,guaranteed meshing,Tetrahedral meshing,multimaterial,multilabel,biomedical,conformal meshing,watertight,mesh quality
Citation:
Jonathan Bronson, Joshua A. Levine, Ross Whitaker, "Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees," IEEE Transactions on Visualization and Computer Graphics, vol. 20, no. 2, pp. 223-237, Feb. 2014, doi:10.1109/TVCG.2013.115
Usage of this product signifies your acceptance of the Terms of Use.