Skip to Main content Skip to Navigation
Conference papers

Covering spaces and Delaunay triangulations of the 2D flat torus

Abstract : A previous algorithm was computing the Delaunay triangulation of the flat torus, by using a 9-sheeted covering space. We propose a modification of the algorithm using only a 8-sheeted covering space, which allows to work with 8 periodic copies of the input points instead of 9. The main interest of our contribution is not only this result, but most of all the method itself: this new construction of covering spaces generalizes to Delaunay triangulations of surfaces of higher genus.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Monique Teillaud Connect in order to contact the contributor
Submitted on : Monday, January 26, 2015 - 4:15:55 PM
Last modification on : Saturday, May 1, 2021 - 3:41:21 AM
Long-term archiving on: : Monday, April 27, 2015 - 10:45:57 AM


Files produced by the author(s)


  • HAL Id : hal-01109626, version 1



Mikhail Bogdanov, Monique Teillaud, Gert Vegter. Covering spaces and Delaunay triangulations of the 2D flat torus. 28th European Workshop on Computational Geometry, Mar 2012, Assisi, Italy. ⟨hal-01109626⟩



Record views


Files downloads