Tetrahedralization of a Hexahedral Mesh
Computational Geometry
2023-01-23 v2 Numerical Analysis
Numerical Analysis
Abstract
Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for tetrahedralization of a hexahedral complex is the marching tetrahedron algorithm which limits pre-selection of face divisions. We generalize a procedure for tetrahedralizing triangular prisms to tetrahedralizing cubes, and combine it with certain heuristics to design an algorithm that can triangulate any hexahedra.
Cite
@article{arxiv.2208.07128,
title = {Tetrahedralization of a Hexahedral Mesh},
author = {Aman Timalsina and Matthew G. Knepley},
journal= {arXiv preprint arXiv:2208.07128},
year = {2023}
}
Comments
The previous version had an error in the proof of Observation 2.1, which has since been rectified in this version. Formatting and title changed