 This corresponds to a generation rate of over 55 million tetrahedra per second which is, to our best knowledge, three times the rate reached by the current fastest implementation. It is finally shown how this very efficient parallel Delaunay triangulation can be integrated in a Delaunay refinement mesh generator taking as input the  boundary of the domain to mesh.
<clarity>  This corresponds to a generation rate of over 55 million tetrahedra per second which is, to our best knowledge, three times the rate reached by the current fastest implementation. It is finally shown how this very efficient parallel Delaunay triangulation can be integrated in a Delaunay refinement mesh generator taking as input the  boundary of the domain to mesh.
 This corresponds to a generation rate of over 55 million tetrahedra per second . We finally show how this very efficient parallel Delaunay triangulation can be integrated in a Delaunay refinement mesh generator taking as input the boundary of the domain to mesh.