Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Minimal Delaunay triangulations of hyperbolic surfaces (2011.09847v1)

Published 19 Nov 2020 in cs.CG, math.CO, and math.GT

Abstract: Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we will show that every hyperbolic surface of genus $g$ has a simplicial Delaunay triangulation with $O(g)$ vertices, where edges are given by distance paths. Then, we will construct a class of hyperbolic surfaces for which the order of this bound is optimal. Finally, to give a general lower bound, we will show that the $\Omega(\sqrt{g})$ lower bound for the number of vertices of a simplicial triangulation of a topological surface of genus $g$ is tight for hyperbolic surfaces as well.

Citations (5)

Summary

We haven't generated a summary for this paper yet.