Fast Tetrahedral Meshing in the Wild

Abstract

We propose a new tetrahedral meshing method, fTetWild, to convert triangle soups into high-quality tetrahedral meshes. Our method builds on the TetWild algorithm, replacing the rational triangle insertion with a new incremental approach to construct and optimize the output mesh, interleaving triangle insertion and mesh optimization. Our approach makes it possible to maintain a valid floating-point tetrahedral mesh at all algorithmic stages, eliminating the need for costly constructions with rational numbers used by TetWild, while maintaining full robustness and similar output quality. This allows us to improve on TetWild in two ways. First, our algorithm is significantly faster, with running time comparable to less robust Delaunay-based tetrahedralization algorithms. Second, our algorithm is guaranteed to produce a valid tetrahedral mesh with floating-point vertex coordinates, while TetWild produces a valid mesh with rational coordinates which is not guaranteed to be valid after floating-point conversion. As a trade-off, our algorithm no longer guarantees that all input triangles are present in the output mesh, but in practice, as confirmed by our tests on the Thingi10k dataset, the algorithm always succeeds in inserting all input triangles.

References in corpus (2)

• Thingi10K: A Dataset of 10,000 3D-Printing Models
• Nonobtuse triangulations of PSLGs

Cited by in corpus (12)

• Learning Skeletal Articulations with Neural Blend Shapes
• Hex-Mesh Generation and Processing: a Survey
• Surface Multigrid via Intrinsic Prolongation
• Differentiable solver for time-dependent deformation problems with contact
• Symmetric Volume Maps: Order-Invariant Volumetric Mesh Correspondence with Free Boundary
• Meshless Monte Carlo Radiation Transfer Method for Curved Geometries using Signed Distance Functions
• A Novel Simulation-Based Quality Metric for Evaluating Grasps on 3D Deformable Objects
• Cobiveco: Consistent biventricular coordinates for precise and intuitive description of position in the heart -- with MATLAB implementation
• Deformation-Aware Data-Driven Grasp Synthesis
• Physics-informed neural networks to learn cardiac fiber orientation from multiple electroanatomical maps
• Smoothness and continuity of cost functionals for ECG mismatch computation
• A Robust Grid-Based Meshing Algorithm for Embedding Self-Intersecting Surfaces