Fast Tetrahedral Meshing in the Wild
share
We propose a new tetrahedral meshing technique, fTetWild, to convert triangle soups into high-quality tetrahedral meshes. Our method builds upon the TetWild algorithm, inheriting its unconditional robustness, but dramatically reducing its computation cost and guaranteeing the generation of a valid tetrahedral mesh with floating point coordinates. This is achieved by introducing a new problem formulation, which is well suited for a pure floating point implementation and naturally leads to a parallel implementation. Our algorithm produces results qualitatively and quantitatively similar to TetWild, but at a fraction of the computational cost, with a running time comparable to Delaunay-based tetrahedralization algorithms.
READ FULL TEXT