Abstract : We show how to compute Delaunay triangulations and Voronoi diagrams of a set of points in hyperbolic space in a very simple way. While the algorithm follows from [CCCG92], we elaborate on arithmetic issues, observing that only rational computations are needed. This allows an exact and efficient implementation.
Type de document :
Communication dans un congrès
XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain. 2011
https://hal.inria.fr/hal-00850586
Contributeur : Olivier Devillers
<>
Soumis le : mercredi 7 août 2013 - 13:31:14
Dernière modification le : samedi 27 janvier 2018 - 01:31:00
Document(s) archivé(s) le : mercredi 5 avril 2017 - 19:43:11
