Skip to Main content Skip to Navigation
Conference papers

Covering spaces and Delaunay triangulations of the 2D flat torus

Mikhail Bogdanov 1 Monique Teillaud 1 Gert Vegter 2
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
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 metadatas

Cited literature [12 references]  Display  Hide  Download


https://hal.inria.fr/hal-01109626
Contributor : Monique Teillaud <>
Submitted on : Monday, January 26, 2015 - 4:15:55 PM
Last modification on : Tuesday, April 30, 2019 - 5:14:02 PM
Long-term archiving on: : Monday, April 27, 2015 - 10:45:57 AM

Files

hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01109626, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

334

Files downloads

458