Skip to Main content Skip to Navigation

# Representing infinite hyperbolic periodic Delaunay triangulations using finitely many Dirichlet domains

1 GAMBLE - Geometric Algorithms and Models Beyond the Linear and Euclidean realm
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : The Delaunay triangulation of a set of points $P$ on a hyperbolic surface is the projection of the Delaunay triangulation of the set $\tilde{P}$ of lifted points in the hyperbolic plane. Since $\tilde{P}$ is infinite, the algorithms to compute Delaunay triangulations in the plane do not generalize naturally. Assuming that the surface comes with a Dirichlet domain, we exhibit a finite set of points that captures the full triangulation. Indeed, we prove that an edge of a Delaunay triangulation has a combinatorial length (a notion we define in the paper) smaller than $12g-6$ with respect to a Dirichlet domain. On the way, we prove that both the edges of a Delaunay triangulation and of a Dirichlet domain have some kind of distance minimizing properties that are of intrinsic interest. The bounds produced in this paper depend only on the topology of the surface. They provide mathematical foundations for hyperbolic analogs of the algorithms to compute periodic Delaunay triangulations in Euclidean space.
Keywords :
Document type :
Preprints, Working Papers, ...
Domain :
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03045921
Contributor : Benedikt Kolbe Connect in order to contact the contributor
Submitted on : Tuesday, July 13, 2021 - 11:28:04 AM
Last modification on : Tuesday, December 14, 2021 - 4:54:02 PM

### File

versionHAL.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-03045921, version 2

### Citation

Vincent Despré, Benedikt Kolbe, Monique Teillaud. Representing infinite hyperbolic periodic Delaunay triangulations using finitely many Dirichlet domains. 2021. ⟨hal-03045921v2⟩

### Metrics

Les métriques sont temporairement indisponibles