Computing a Dirichlet domain for a hyperbolic surface

12/04/2022
by   Vincent Despré, et al.
0

The goal of this paper is to exhibit and analyze an algorithm that takes a given closed orientable hyperbolic surface and outputs an explicit Dirichlet domain. The input is a fundamental polygon with side pairings. While grounded in topological considerations, the algorithm makes key use of the geometry of the surface. We introduce data structures that reflect this interplay between geometry and topology and show that the algorithm finishes in polynomial time, in terms of the initial perimeter and the genus of the surface.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2020

Minimal Delaunay triangulations of hyperbolic surfaces

Motivated by recent work on Delaunay triangulations of hyperbolic surfac...
research
02/21/2021

Predicting Future Cognitive Decline with Hyperbolic Stochastic Coding

Hyperbolic geometry has been successfully applied in modeling brain cort...
research
03/10/2021

Delaunay triangulations of generalized Bolza surfaces

The Bolza surface can be seen as the quotient of the hyperbolic plane, r...
research
12/04/2018

Topologically Trivial Closed Walks in Directed Surface Graphs

Let G be a directed graph with n vertices and m edges, embedded on a sur...
research
12/10/2019

Flipping Geometric Triangulations on Hyperbolic Surfaces

We consider geometric triangulations of surfaces, i.e., triangulations w...
research
10/22/1998

Computational Geometry Column 33

Several recent SIGGRAPH papers on surface simplification are described....
research
07/16/2023

Surface Geometry Processing: An Efficient Normal-based Detail Representation

With the rapid development of high-resolution 3D vision applications, th...

Please sign up or login with your details

Forgot password? Click here to reset