Surgical Planning Laboratory - Brigham & Women's Hospital - Boston, Massachusetts USA - a teaching affiliate of Harvard Medical School

Surgical Planning Laboratory

The Publication Database hosted by SPL

All Publications | Upload | Advanced Search | Gallery View | Download Statistics | Help | Import | Log in

Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees

Institution:
School of Computing, University of Utah, Salt Lake City, UT, USA.
Publisher:
IEEE Computer Society
Publication Date:
Feb-2014
Journal:
IEEE Trans Vis Comput Graph
Volume Number:
20
Issue Number:
2
Pages:
223-37
Citation:
IEEE Trans Vis Comput Graph. 2014 Feb;20(2):223-37.
PubMed ID:
24356365
PMCID:
PMC4142801
Keywords:
Tetrahedral meshing, multimaterial, multilabel, biomedical, conformal meshing, watertight, mesh quality, adaptive meshing, guaranteed meshing
Appears in Collections:
SPL, NA-MIC
Sponsors:
P41 GM103545/GM/NIGMS NIH HHS/United States
Generated Citation:
Bronson J.R., Levine J.A., Whitaker R. Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees. IEEE Trans Vis Comput Graph. 2014 Feb;20(2):223-37. PMID: 24356365. PMCID: PMC4142801.
Downloaded: 706 times. [view map]
Paper: Download, View online
Export citation:
Google Scholar: link

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.

Additional Material
1 File (201.646kB)
Bronson-IEEETransVisComputGraph2014-fig9.jpg (201.646kB)