Hyperbolic Delaunay triangulations and Voronoi diagrams made practical
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.
Domains
Computational Geometry [cs.CG]
Fichier principal
hal.pdf (325.17 Ko)
Télécharger le fichier
thumbnail.jpg (35.13 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Loading...