-net algorithm implementation on hyperbolic surfaces
From MaRDI portal
\(\varepsilon\)-net algorithm implementation on hyperbolic surfaces
Cites work
- An acyclicity theorem for cell complexes in d dimensions
- Benjamini-Schramm convergence and spectra of random hyperbolic surfaces of high genus
- Building triangulations using \({\epsilon}\)-nets
- Computing a Dirichlet domain for a hyperbolic surface
- Delaunay refinement algorithms for triangular mesh generation
- Delaunay triangulations of generalized Bolza surfaces
- Flipping geometric triangulations on hyperbolic surfaces
- Geometry and spectra of compact Riemann surfaces
- Growth of Weil-Petersson volumes and random hyperbolic surface of large genus
- scientific article; zbMATH DE number 3838373 (Why is no real title available?)
- scientific article; zbMATH DE number 52229 (Why is no real title available?)
- scientific article; zbMATH DE number 54045 (Why is no real title available?)
- Hyperbolic Delaunay complexes and Voronoi diagrams made practical
- Hyperbolic octagons and Teichmüller space in genus 2
- Implementing Delaunay triangulations of the Bolza surface
- On sorting triangles in a Delaunay tessellation
- Random construction of Riemann surfaces
- Random regular graphs and the systole of a random surface
- Surfaces and planar discontinuous groups. Revised and expanded transl. from the German by J. Stillwell
- The worst visibility walk in a random Delaunay triangulation is O( n)
- WALKING IN A TRIANGULATION
This page was built for publication: \(\varepsilon\)-net algorithm implementation on hyperbolic surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322464)
