Abstract : Isotropic tetrahedron meshes generated by Delaunay refinement algorithms are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper stability of numerical simulations we aim at removing them while keeping the triangulation Delaunay for simplicity. The solution which explicitly perturbs the slivers through random vertex relocation and Delaunay connectivity update is very effective but slow. In this paper we present a perturbation algorithm which favors deterministic over random perturbation. The added value is an improved efficiency and effectiveness. Our experimental study applies the proposed algorithm to meshes obtained by Delaunay refinement as well as to carefully optimized meshes.
https://hal.inria.fr/inria-00430202
Contributeur : Pierre Alliez
<>
Soumis le : vendredi 6 novembre 2009 - 17:01:29
Dernière modification le : samedi 27 janvier 2018 - 01:31:04
Document(s) archivé(s) le : jeudi 17 juin 2010 - 19:34:28
Jane Tournois, Rahul Srinivasan, Pierre Alliez. Perturbing Slivers in 3D Delaunay Meshes. 18th International Meshing Roundtable, Oct 2009, Salt Lake City, United States. pp.157-173, 2009. 〈inria-00430202〉
