Discrete uniformization of finite branched covers over the Riemann sphere via hyper-ideal circle patterns
classification
🧮 math.MG
cs.CGmath.DGmath.GT
keywords
discreteuniformizationcirclehyper-idealsurfacesbranchedcoversfinite
read the original abstract
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral surfaces with non-positive curvature. We show that in the case of such surfaces discrete uniformization via hyper-ideal circle patterns always exists and is unique. We also propose a numerical algorithm, utilizing convex optimization, that constructs the desired discrete uniformization.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.