Meshing 3D domains bounded by piecewise smooth surfaces

Laurent Rineau (1) , Mariette Yvinec (2)

1 GF - Geometry Factory [Sophia Antipolis]
2 GEOMETRICA - Geometric computing

This paper proposes an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm handle multivolume domains defined by surfaces that may be non connected or non manifold. The boundary and subdivision surfaces are assumed to be described by a complex formed by surface patches stitched together along curve segments. The meshing algorithm is a Delaunay refinement and it uses the notion of restricted Delaunay triangulation to approximate the input curve segments and surface patches. The algorithm yields a mesh with good quality tetrahedra and offers a user control on the size of the tetrahedra. The vertices in the final mesh have a restricted Delaunay triangulation to any input feature which is a homeomorphic and accurate approximation of this feature. The algorithm also provides guarantee on the size and shape of the facets approximating the input surface patches. In its current state the algorithm suffers from a severe angular restriction on input constraints. It basically assumes that two linear subspaces that are tangent to non incident and non disjoint input features on a common point form an angle measuring at least 90 degrees.

Mots clés: mesh generation; Delaunay refinement; restricted Delaunay triangulation}

Domaines: Géométrie algorithmique [cs.CG]; Modélisation et simulation

Laurent Rineau, Mariette Yvinec. Meshing 3D domains bounded by piecewise smooth surfaces. [Research Report] RR-7912, INRIA. 2012. ⟨hal-00681581⟩