2022/08/15 by Aman Timalsina, Timalsina, Aman, Matthew G. Knepley +1
Computer Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #Digital Image Processing Techniques #FOS: Computer and information sciences #FOS: Mathematics #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.2208.07128
openalex publication_date 2022/08/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.