A circle pattern algorithm via combinatorial Ricci flows
Euclidean geometries (general) and generalizations (51M05) Hyperbolic and elliptic geometries (general) and generalizations (51M10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
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].
- Combinatorial Ricci flows for ideal circle patterns
- Convergence of combinatorial Ricci flows to degenerate circle patterns
- On rigidity and convergence of circle patterns
- Combinatorial Ricci flow for degenerate circle packing metrics
- On combinatorial Calabi flow with hyperbolic circle patterns
- On the Teichmüller theory of circle patterns
- Minimal surfaces from circle patterns: geometry from combinatorics
- A note on circle patterns on surfaces
- The circle pattern uniformization problem
- Approximation of conformal mappings by circle patterns
- Imbedded circle patterns with the combinatorics of the square grid and discrete Painlevé equations
- A circle packing algorithm
- Combinatorial Ricci flows for ideal circle patterns
- A linearized circle packing algorithm
- On the Teichmüller theory of circle patterns
- scientific article; zbMATH DE number 2152054 (Why is no real title available?)
- Circle patterns on surfaces of finite topological type
- Convergence of combinatorial Ricci flows to degenerate circle patterns
- Variational principles for branched circle patterns
This page was built for publication: A circle pattern algorithm via combinatorial Ricci flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419331)
