A circle pattern algorithm via combinatorial Ricci flows (Q2419331): Difference between revisions

In this work, the authors deal with the problem of circle packings for given, finite triangulations in either hyperbolic or Euclidean geometry. They present algorithms, based on combinatorial Ricci flows, which find the radii of circle patterns \((T, \Theta)\). Here, \(T\) is a finite triangulation and \(\Theta\) is the intersection angle of the circles, \(\Theta \in [0, \tfrac{1}{2}]\). In particular, if \(\Theta = 0\), then the circle pattern is a circle packing. The presented algorithms find the radii of the circles and converge exponentially fast. The main difference to the pioneering work of \textit{W. P. Thurston} [Geometry and topology of 3-manifolds. Princeton: Department of Princeton University (1979)] is that the algorithm is not locally optimizing radii, but globally and that the convergence rate is exponential instead of polynomial. After the introduction, the necessary concepts are defined. Then, the iterative process is described and proofs for the exponential convergence rate are given in the case \(\Theta = 0\), i.e., for circle packings. The work is closed with a couple of examples. The algorithms do not work for spherical geometry. For the entire collection see [Zbl 1410.30002].