Delaunay triangulations of closed Euclidean d-orbifolds

Manuel Caroli (1) , Monique Teillaud (2)

1 GEOMETRICA - Geometric computing
2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility

We give a definition of the Delaunay triangulation of a point set in a closed Euclidean d-manifold, i.e. a compact quotient space of the Euclidean space for a discrete group of isometries (a so-called Bieberbach group or crystallographic group). We describe a geometric criterion to check whether a partition of the manifold actually forms a triangulation (which subsumes that it is a simplicial complex). We provide an incremental algorithm to compute the Delaunay triangulation of the manifold defined by a given set of input points, if it exists. Otherwise, the algorithm returns the Delaunay triangulation of a finite-sheeted covering space of the manifold. The algorithm has optimal randomized worst-case time and space complexity. It extends to closed Euclidean orbifolds. An implementation for the special case of the 3D flat torus has been released in Cgal 3.5. To the best of our knowledge, this is the first general result on this topic.

Mots clés: orbit space; Delaunay triangulation; implementation; incremental algorithm; covering space; orb- ifolds; closed Euclidean manifolds; crystallographic groups

Domaines: Géométrie algorithmique [cs.CG]

Manuel Caroli, Monique Teillaud. Delaunay triangulations of closed Euclidean d-orbifolds. Discrete and Computational Geometry, 2016, 55 (4), pp.827--853. ⟨10.1007/s00454-016-9782-6⟩. ⟨hal-01294409⟩