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 metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/inria-00430202
Contributor : Pierre Alliez <>
Submitted on : Friday, November 6, 2009 - 5:01:29 PM
Last modification on : Saturday, January 27, 2018 - 1:31:04 AM
Long-term archiving on : Thursday, June 17, 2010 - 7:34:28 PM

File

slivers_paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00430202, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

635

Files downloads

340