Lattice cleaving: A multimaterial tetrahedral meshing algorithm with guarantees

Jonathan Bronson; Joshua A. Levine; Ross Whitaker

doi:10.1109/TVCG.2013.115

Lattice cleaving: A multimaterial tetrahedral meshing algorithm with guarantees

Jonathan Bronson, Joshua A. Levine, Ross Whitaker

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Abstract

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.

Original language	English (US)
Article number	6579593
Pages (from-to)	223-237
Number of pages	15
Journal	IEEE Transactions on Visualization and Computer Graphics
Volume	20
Issue number	2
DOIs	https://doi.org/10.1109/TVCG.2013.115
State	Published - Feb 2014
Externally published	Yes

Keywords

Adaptive meshing
Biomedical
Conformal meshing
Guaranteed meshing
Mesh quality
Multilabel
Multimaterial
Tetrahedral meshing
Watertight

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Computer Graphics and Computer-Aided Design

Access to Document

10.1109/TVCG.2013.115

Cite this

@article{acb9c1b9bffe45a68e8c14da6e778f13,

title = "Lattice cleaving: A multimaterial tetrahedral meshing algorithm with guarantees",

abstract = "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.",

keywords = "Adaptive meshing, Biomedical, Conformal meshing, Guaranteed meshing, Mesh quality, Multilabel, Multimaterial, Tetrahedral meshing, Watertight",

author = "Jonathan Bronson and Levine, {Joshua A.} and Ross Whitaker",

year = "2014",

month = feb,

doi = "10.1109/TVCG.2013.115",

language = "English (US)",

volume = "20",

pages = "223--237",

journal = "IEEE Transactions on Visualization and Computer Graphics",

issn = "1077-2626",

publisher = "IEEE Computer Society",

number = "2",

}

TY - JOUR

T1 - Lattice cleaving

T2 - A multimaterial tetrahedral meshing algorithm with guarantees

AU - Bronson, Jonathan

AU - Levine, Joshua A.

AU - Whitaker, Ross

PY - 2014/2

Y1 - 2014/2

N2 - 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.

AB - 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.

KW - Adaptive meshing

KW - Biomedical

KW - Conformal meshing

KW - Guaranteed meshing

KW - Mesh quality

KW - Multilabel

KW - Multimaterial

KW - Tetrahedral meshing

KW - Watertight

UR - http://www.scopus.com/inward/record.url?scp=84891521948&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891521948&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2013.115

DO - 10.1109/TVCG.2013.115

M3 - Article

C2 - 24356365

AN - SCOPUS:84891521948

SN - 1077-2626

VL - 20

SP - 223

EP - 237

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

IS - 2

M1 - 6579593

ER -

Lattice cleaving: A multimaterial tetrahedral meshing algorithm with guarantees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this