TY - JOUR
T1 - Tetrahedral meshing via maximal Poisson-disk sampling
AU - Guo, Jianwei
AU - Yan, Dongming
AU - Chen, Li
AU - Zhang, Xiaopeng
AU - Deussen, Oliver
AU - Wonka, Peter
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2016/2/15
Y1 - 2016/2/15
N2 - In this paper, we propose a simple yet effective method to generate 3D-conforming tetrahedral meshes from closed 2-manifold surfaces. Our approach is inspired by recent work on maximal Poisson-disk sampling (MPS), which can generate well-distributed point sets in arbitrary domains. We first perform MPS on the boundary of the input domain, we then sample the interior of the domain, and we finally extract the tetrahedral mesh from the samples by using 3D Delaunay or regular triangulation for uniform or adaptive sampling, respectively. We also propose an efficient optimization strategy to protect the domain boundaries and to remove slivers to improve the meshing quality. We present various experimental results to illustrate the efficiency and the robustness of our proposed approach. We demonstrate that the performance and quality (e.g., minimal dihedral angle) of our approach are superior to current state-of-the-art optimization-based approaches.
AB - In this paper, we propose a simple yet effective method to generate 3D-conforming tetrahedral meshes from closed 2-manifold surfaces. Our approach is inspired by recent work on maximal Poisson-disk sampling (MPS), which can generate well-distributed point sets in arbitrary domains. We first perform MPS on the boundary of the input domain, we then sample the interior of the domain, and we finally extract the tetrahedral mesh from the samples by using 3D Delaunay or regular triangulation for uniform or adaptive sampling, respectively. We also propose an efficient optimization strategy to protect the domain boundaries and to remove slivers to improve the meshing quality. We present various experimental results to illustrate the efficiency and the robustness of our proposed approach. We demonstrate that the performance and quality (e.g., minimal dihedral angle) of our approach are superior to current state-of-the-art optimization-based approaches.
UR - http://hdl.handle.net/10754/596364
UR - http://linkinghub.elsevier.com/retrieve/pii/S016783961630005X
UR - http://www.scopus.com/inward/record.url?scp=84975782938&partnerID=8YFLogxK
U2 - 10.1016/j.cagd.2016.02.004
DO - 10.1016/j.cagd.2016.02.004
M3 - Article
SN - 0167-8396
VL - 43
SP - 186
EP - 199
JO - Computer Aided Geometric Design
JF - Computer Aided Geometric Design
ER -