Skip to Main content Skip to Navigation
Conference papers

Perturbing Slivers in 3D Delaunay Meshes

Jane Tournois 1 Rahul Srinivasan 1 Pierre Alliez 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Pierre Alliez Connect in order to contact the contributor
Submitted on : Friday, November 6, 2009 - 5:01:29 PM
Last modification on : Thursday, January 20, 2022 - 5:30:30 PM
Long-term archiving on: : Thursday, June 17, 2010 - 7:34:28 PM


Files produced by the author(s)


  • HAL Id : inria-00430202, version 1



Jane Tournois, Rahul Srinivasan, Pierre Alliez. Perturbing Slivers in 3D Delaunay Meshes. 18th International Meshing Roundtable, Sandia Labs, Oct 2009, Salt Lake City, United States. pp.157-173. ⟨inria-00430202⟩



Record views


Files downloads