Computing 3D Periodic Triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Computing 3D Periodic Triangulations

Manuel Caroli
  • Function : Author
  • PersonId : 1078378
Monique Teillaud


This work is motivated by the need for software computing 3D periodic triangulations in numerous domains including astronomy, material engineering, biomedical computing, fluid dynamics etc. We design an algorithmic test to check whether a partition of the 3D flat torus into tetrahedra forms a triangulation (which subsumes that it is a simplicial complex). We propose an incremental algorithm that computes the Delaunay triangulation of a set of points in the 3D flat torus without duplicating any point, whenever possible; our algorithmic test detects when such a duplication can be avoided, which is usually possible in practical situations. Even in cases where point duplication is necessary, our algorithm always computes a triangulation that is homeomorpic to the flat torus. To the best of our knowledge, this is the first algorithm of this kind whose output is provably correct. The implementation will be released in CGAL.
Fichier principal
Vignette du fichier
periodic_triang.pdf (399.15 Ko) Télécharger le fichier
Vignette du fichier
two_cycles.jpg (22.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

hal-02954152 , version 1 (30-09-2020)



Manuel Caroli, Monique Teillaud. Computing 3D Periodic Triangulations. ESA Symposia - 17th European Symposium on Algorithms, Sep 2009, Copenhagen, Denmark. pp.59-70, ⟨10.1007/978-3-642-04128-0_6⟩. ⟨hal-02954152⟩


32 View
140 Download



Gmail Facebook X LinkedIn More