Computing an $\varepsilon$-net of a closed hyperbolic surface
Résumé
An $\varepsilon$-net of a metric space $X$ is a set of points $P$ of $X$ such that the balls of radius $\varepsilon$ centered at points of $P$ cover $X$, and two distinct points of $P$ are at least $\varepsilon$ apart. We present an algorithm to compute an $\varepsilon$-net of a closed hyperbolic surface and analyze its complexity.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|