Memory-efficient boundary-preserving tetrahedralization of large three-dimensional meshes

• Published in: Engineering with computers Vol. 40; no. 2; pp. 867 - 883
• Main Authors: Erkoç, Ziya, Güdükbay, Uğur, Si, Hang
• Format: Journal Article
• Language: English
• Published: London Springer London 01.04.2024; Springer Nature B.V
• Subjects: Algorithms; Apexes; CAE) and Design; Calculus of Variations and Optimal Control; Optimization; Classical Mechanics; Computer Science; Computer-Aided Engineering (CAD; Computers; Control; Decomposition; Math. Applications in Chemistry; Mathematical and Computational Engineering; Mesh generation; Original Article; Partitioning; Simulation; Systems Theory; Triangulation; Boundary-preserving tetrahedralization; Divide-and-conquer; Memory efficiency; Three-dimensional mesh; Parallelization

We propose a divide-and-conquer algorithm to tetrahedralize three-dimensional meshes in a boundary-preserving fashion. It consists of three stages: Input Partitioning , Surface Closure , and Merge . We first partition the input into several pieces to reduce the problem size. We apply 2D Triangulatio...