18th International Meshing Roundtable
Salt Lake City, UT, USA.
October 25-28, 2009
INRIA Sophia Antipolis - M¥editerran¥ee, France
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.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article