A discrete uniformization theorem for polyhedral surfaces (Q1754468): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1309.4175 / rank
 
Normal rank

Revision as of 21:47, 18 April 2024

scientific article
Language Label Description Also known as
English
A discrete uniformization theorem for polyhedral surfaces
scientific article

    Statements

    A discrete uniformization theorem for polyhedral surfaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2018
    0 references
    Let \(S\) be a closed orientable surface and let \(V \subset S\) be a non-empty finite set. A PL-metric \(d\) on \((S,V)\) is a flat metric on \(S\) whose cone points are contained in \(V\). The discrete curvature of \(d\) is the map \(K:V \to (-\infty, 2\pi)\) defined as \(K(v)=2\pi-\) cone angle at \(v\). Examples of this situation are coming from the gluing of a finite collection of Euclidean triangles or by holomorphic quadratic forms on Riemann surfaces. In the paper under review, the notion for a PL-metric \(d'\) on \((S,V)\) to be conformal to \(d\) is provided, this involving the concept of Delaunay triangulations. Then main result is, for given \(K^{*}:V \to (-\infty, 2\pi)\), such that \(\sum_{v \in V} K^{*}(v)=2 \pi \chi(S)\), there exists a discrete conformal metric \(d'\) whose discrete curvature is \(K^{*}\). It is also shown that such a \(d'\) can be obtained using a finite dimensional variational principle. The particular constant case \(K^{*}(v)=2 \pi \chi(S)/|V|\) is a discrete version of the uniformization theorem.
    0 references
    polyhedral metrics
    0 references
    discrete uniformization
    0 references
    discrete conformality
    0 references
    variational principle
    0 references
    Delaunay triangulation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references