pith. sign in

arxiv: 2511.09368 · v2 · submitted 2025-11-12 · 🧮 math.GT · math.CV· math.DG· math.MG

Characterizations of infinite circle patterns and convex polyhedra in hyperbolic 3-space

Huabin Ge , Longsong Jia , Hao Yu , Puchun Zhou This is my paper

Pith reviewed 2026-05-17 22:33 UTC · model grok-4.3

classification 🧮 math.GT math.CVmath.DGmath.MG
keywords circle patternshyperbolic polyhedrarigidityuniformization theoremdisk triangulation graphstrivalent polyhedrahyperbolic 3-spaceinfinite patterns
0
0 comments X

The pith

Infinite regular circle patterns with intersection angles below pi are rigid and classified by a uniformization theorem that also characterizes infinite convex trivalent polyhedra in hyperbolic 3-space.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper completes earlier work on circle patterns by proving both rigidity and a uniformization theorem for infinite patterns whose contact graphs are disk triangulations and whose intersection angles satisfy zero up to but not including pi. These regular patterns are singled out because they avoid singular configurations and correspond directly to trivalent polyhedra. The uniformization result solves the classification problem by showing that prescribed angle data determine the pattern up to isometry. The same statements then yield existence and rigidity for the associated infinite convex trivalent polyhedra in hyperbolic three-space.

Core claim

The authors establish the existence and rigidity of infinite regular circle patterns and prove a uniformization theorem for them, which solves the classification problem for regular circle patterns. Thereby the existence and rigidity of infinite convex trivalent polyhedra in hyperbolic 3-space are obtained.

What carries the argument

The uniformization theorem for regular circle patterns whose contact graphs are disk triangulations, which classifies them by their intersection angles and produces the corresponding convex trivalent polyhedra.

Load-bearing premise

The combinatorial restriction to disk-triangulation contact graphs is narrow enough to exclude singular configurations while still capturing all intended infinite regular patterns and their polyhedral counterparts.

What would settle it

An explicit infinite disk-triangulation graph together with angle data 0 ≤ Θ < π for which either no circle pattern exists or two non-isometric patterns exist would falsify the uniformization and rigidity claims.

Figures

Figures reproduced from arXiv: 2511.09368 by Hao Yu, Huabin Ge, Longsong Jia, Puchun Zhou.

Figure 1
Figure 1. Figure 1: two circle configuration abstract angled graph (G, Θ), it is called realized by a circle pattern P if G is the contact graph of P and Θ is the intersection angle of P, and it is called weakly realized by P if it can be extended to an angled graph (G, ˜ Θ) ˜ which is realized by P and has the same vertex set as G. In order to characterize the geometry and combinatorics of CPs, a natural question arises [PI… view at source ↗
Figure 2
Figure 2. Figure 2: two reducible edges Problem 2.1. Given an abstract angled graph (G, Θ) with angle 0 ≤ Θ < π, can it be realized (or weakly realized) by some circle pattern P? And if it does, is the circle pattern unique? Before addressing Problem 2.1, we first clarify the difference between the definition of “P realizes (G, Θ)” here and the original definition of He in [40], where the angled graph (G, Θ) being considered … view at source ↗
Figure 3
Figure 3. Figure 3: He’s reducible configuration (Bowers-Stephenson’s extraneous tangencies) [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: two adjacent triangle configuration phenomenon does not occur in case Θ ∈ [0, π/2]E, where such relationships are determined solely by (G, Θ). This phenomenon makes the obtuse angle case significantly more difficult to handle, rendering it impossible to add reducible edges without considering the disk radii. Now come back to Problem 2.1. It is well posed when further assuming Θ ≤ π/2. In fact, by Koebe-And… view at source ↗
Figure 5
Figure 5. Figure 5: three circle configuration (1) in Euclidean geometry, ∂ϑi ∂ri < 0, rj ∂ϑi ∂rj = ri ∂ϑj ∂ri ≥ 0. (2) in hyperbolic geometry, ∂ϑi ∂ri < 0, sinh rj ∂ϑi ∂rj = sinh ri ∂ϑj ∂ri ≥ 0, ∂ Area (∆vivjvk) ∂ri > 0, where Area (∆vivjvk) denotes the area of ∆vivjvk. In particular, set ui = ln ri (or ln tanh (ri/2) resp.) in the Euclidean (or hyperbolic resp.) background geometry, then we have ∂νi ∂uj = ∂νj ∂ui , (2.8) wh… view at source ↗
Figure 6
Figure 6. Figure 6: the geometric meaning of rj ∂ϑi ∂rj . Proof. Let Li , Lj and Lk be straight lines passing through the intersection points of the pairs {Cj , Ck}, {Ci , Ck} and {Ci , Cj} respectively. By [28, Lemma A-1], as shown in [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: critical three-circle configurations. Lemma 2.12. As shown in [PITH_FULL_IMAGE:figures/full_fig_p015_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: the local configuration of Di ∩ Dj ∩ Dk = ∅. 16 [PITH_FULL_IMAGE:figures/full_fig_p016_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: the configuration of Di and S j∈N(i) Dj  ∪ S(i). Lemma 2.15. Let T = (V, E, F) be a disk triangulation and let Θ ∈ [0, π) E be an intersection angle function. Suppose that P = {Di}i∈V is a CP that realizes (T , Θ). If further assume that condition (Z1) holds, then Di ⊂ [ j∈N(i) Dj  ∪ S(i). Proof. We divide the proof into three steps. Step 1. We show ∂Di ⊂ S j∈N(i) Dj . We argue by contradiction. Without … view at source ↗
Figure 10
Figure 10. Figure 10: the configuration of Di ⊂ S j∈N(i) Dj For each edge [l, m] with ends l, m ∈ N(i), let Kl,m = Dl ∩ Dm\ ∪s∈N(i)\{l,m} Ds and let Em l = ∂Kl,m ∩ Dl . We claim that Di ∩ ∂Kl,m ⊂ Em l ∪ El m for each edge [l, m] with two ends 19 [PITH_FULL_IMAGE:figures/full_fig_p019_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: the structure of TC(r) (P) associated with VC(r) (P) Clearly, Ai , B[i,j] and C[i,j,k] are non-empty disjoint sets that divide Carr(P) = Ω. We construct a subcomplex TC(r) (P) ⊂ T associated with VC(r) (P). For any point p ∈ C(r), it belongs to one of the above three types of domains. We will discuss separately as follows: • If p ∈ Ai for some i ∈ V , then p corresponds to i ∈ TC(r) (P). • If p ∈ B[i,j] f… view at source ↗
Figure 12
Figure 12. Figure 12: three types of generalized cycles The following geodesic curvature provides a convenient parameter for generalized cycles. Definition 5.1 (Geodesic curvature). Let ri be the Euclidean radius of Ci , and oi be the center of Ci in C. If Ci is a hyperbolic circle, we denote by ρi the hyperbolic radius of Ci with respect to U. If Ci is a hypercycle, we denote by αi the intersection angle of Ci and ∂U. The geo… view at source ↗
Figure 13
Figure 13. Figure 13: the configuration of three generalized cycles [PITH_FULL_IMAGE:figures/full_fig_p037_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Two types of THPs It is clear that this definition does not depend on the choice of exhausting sequence. Since it is easy to draw in two dimensions, one can use this simple two-dimensional case to imagine the three-dimensional situation. In two dimensions, a parabolic “hyperbolic polygon” has a single accumulation point, whereas a hyperbolic “hyperbolic polygon” has two accumulation points, which are anti… view at source ↗
Figure 15
Figure 15. Figure 15: an example that violates conditions (Z1) and (Z2) Conversely, we consider the inverse process of the above construction, i.e. how to go from THP to RCPs. Given a THP P = T i∈V Hi , which is combinatorically equivalent to the Poincare´ dual of T , with dihedral angles that satisfy Θ(e ∗ ) = Θ(e) for e ∈ E. Each region Hi ⊂ H3 corresponds to a circle Ci , defined as ∂Hi ∩ ∂H3 . Then P = {Ci}i∈V (6.2) is obv… view at source ↗
Figure 16
Figure 16. Figure 16: a four circle configuration For any i, j ∈ V , recall d(i, j) is the combinatorial distance in the graph induced by T . By Lemma 2.15, we only need to prove Di ∩ Dj = ∅, for any i, j ∈ V with d(i, j) = 2. We prove this by contradiction. If the previous property is not true, then we assume Di ∩ Dj ̸= ∅. From Lemma 2.15, we have Di ∩ Dj ⊂ [ k∈N(i) Dk 59 [PITH_FULL_IMAGE:figures/full_fig_p059_16.png] view at source ↗
read the original abstract

Since Thurston pioneered the connection between circle packing (abbr. CP) and three-dimensional geometric topology, the characterization of CPs and hyperbolic polyhedra has become increasingly profound. Some milestones have been achieved, for example, Rodin-Sullivan \cite{Rodin-Sullivan} and Schramm \cite{schramm91} proved the rigidity of infinite CPs with the intersection angle $\Theta=0$. Rivin-Hodgson \cite{RH93} fully characterized the existence and rigidity of compact convex polyhedra in $\mathbb{H}^3$. He \cite{He} proved the rigidity and uniformization theorem for infinite CPs with $0\leq\Theta\leq \pi/2$. Therefore, the remaining unresolved issues are the rigidity and uniformization theorems for infinite CPs with $0\leq\Theta<\pi$, as well as for infinite hyperbolic polyhedra. In fact, He specifically claimed in the abstract of \cite{He} that ``in a future paper, the techniques of this paper will be extended to the case when $0\leq\Theta<\pi$. In particular, we will show a rigidity property for a class of infinite convex polyhedra in the 3-dimensional hyperbolic space". The objective of the article is to accomplish the work claimed in \cite{He} by proving the rigidity and uniformization theorem for infinite CPs with $0\leq\Theta<\pi$, as well as infinite trivalent hyperbolic polyhedra. We will pay special attention to CPs whose contact graphs are disk triangulation graphs. Such CPs are called regular because they exclude some singular configurations and correspond well to hyperbolic polyhedra. We will establish the existence and rigidity of infinite regular CPs. Moreover, we will prove a uniformization theorem for regular CPs, which solves the classification problem for regular CPs. Thereby, the existence and rigidity of infinite convex trivalent polyhedra are obtained.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proves existence and rigidity theorems for infinite regular circle patterns (CPs) with 0 ≤ Θ < π whose contact graphs are disk triangulations, along with a uniformization theorem that classifies these regular CPs. It thereby derives existence and rigidity results for infinite convex trivalent polyhedra in H^3, extending prior work by Rodin-Sullivan, Schramm, Rivin-Hodgson, and He on infinite CPs and hyperbolic polyhedra.

Significance. If the central theorems hold, the work completes the program outlined by He for the remaining cases of infinite CPs with intersection angles up to but not including π and supplies corresponding characterizations for infinite trivalent hyperbolic polyhedra. The restriction to regular CPs (disk triangulation contact graphs) is presented as a means to exclude singularities while preserving correspondence with polyhedra, yielding a uniformization result that solves the classification problem in this subclass.

major comments (2)
  1. [Abstract] Abstract and Introduction: The claim that the uniformization theorem for regular CPs implies existence and rigidity for infinite convex trivalent polyhedra ('thereby obtained') is load-bearing for the central result. The manuscript must explicitly verify that every infinite convex trivalent polyhedron in H^3 induces a contact graph that is a disk triangulation without accumulation points or unavoidable singularities at infinity; absent this verification, the implication classifies only a proper subclass and does not resolve the full classification problem for trivalent polyhedra.
  2. [§2] §2 (Definitions of regular CPs): The assertion that disk triangulation contact graphs exclude singular configurations and ensure good correspondence with hyperbolic polyhedra requires a precise statement of what constitutes a singularity in the infinite setting and a proof that no infinite convex trivalent polyhedron falls outside this combinatorial class. If some polyhedra produce non-triangulated faces or accumulation points, the rigidity and uniformization statements would not apply to the intended full class.
minor comments (2)
  1. [Abstract] The abstract's phrasing 'abbr. CP' could be expanded to 'abbreviated as CP' for improved readability on first use.
  2. [Introduction] Notation for the range of intersection angles Θ could be introduced with a brief reminder of the distinction from the compact case treated by Rivin-Hodgson.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and for identifying these important points about the correspondence between regular circle patterns and infinite convex trivalent polyhedra. We address each major comment below and will revise the manuscript accordingly to strengthen the exposition and proofs.

read point-by-point responses

  1. Referee: [Abstract] Abstract and Introduction: The claim that the uniformization theorem for regular CPs implies existence and rigidity for infinite convex trivalent polyhedra ('thereby obtained') is load-bearing for the central result. The manuscript must explicitly verify that every infinite convex trivalent polyhedron in H^3 induces a contact graph that is a disk triangulation without accumulation points or unavoidable singularities at infinity; absent this verification, the implication classifies only a proper subclass and does not resolve the full classification problem for trivalent polyhedra.

    Authors: We agree that the load-bearing implication requires explicit verification in the infinite setting. The manuscript currently relies on the standard polar dual construction (extending the finite case of Rivin-Hodgson) together with the definition of regular CPs to assert the correspondence, but we acknowledge that a self-contained argument for the infinite case is needed. In the revised manuscript we will add a dedicated paragraph in the introduction and a short subsection following the definition of regular CPs that proves: (i) every infinite convex trivalent polyhedron in H^3 determines a locally finite circle pattern whose contact graph is a disk triangulation, (ii) convexity and trivalence preclude accumulation points at infinity, and (iii) no unavoidable singularities arise. This will make the derivation of existence and rigidity for the full class of trivalent polyhedra rigorous. revision: yes

  2. Referee: [§2] §2 (Definitions of regular CPs): The assertion that disk triangulation contact graphs exclude singular configurations and ensure good correspondence with hyperbolic polyhedra requires a precise statement of what constitutes a singularity in the infinite setting and a proof that no infinite convex trivalent polyhedron falls outside this combinatorial class. If some polyhedra produce non-triangulated faces or accumulation points, the rigidity and uniformization statements would not apply to the intended full class.

    Authors: We will revise §2 to include a precise definition of singularities for infinite circle patterns: a configuration is singular if the pattern fails to be locally finite, if intersection angles accumulate to π at infinity, or if the contact graph contains non-triangular faces or accumulation points that prevent the pattern from being a proper disk triangulation. We will then prove that no infinite convex trivalent polyhedron produces such singularities. The argument proceeds by noting that trivalence implies the dual graph is a triangulation, convexity of the polyhedron ensures the circles remain disjoint except at tangency points, and the absence of accumulation follows from the proper embedding in H^3. This proof will be inserted into the revised §2 and cross-referenced in the polyhedra section. revision: yes

Circularity Check

0 steps flagged

No significant circularity; theorems extend independent prior results

full rationale

The paper defines regular circle patterns combinatorially via disk triangulation contact graphs and proves existence, rigidity, and uniformization theorems for them with 0 ≤ Θ < π, then obtains corresponding results for infinite convex trivalent polyhedra. These steps build directly on cited independent prior theorems (Rodin-Sullivan, Schramm, Rivin-Hodgson, He) without any quoted equation or claim reducing the new results to fitted parameters, self-definitions, or unverified self-citations by construction. The derivation chain remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claims rest on standard axioms of hyperbolic geometry and combinatorial graph theory with no free parameters fitted to data and no new entities postulated.

axioms (2)
  • standard math Hyperbolic 3-space satisfies the standard axioms of constant negative curvature and the properties of circle intersections therein.
    Invoked as background for all geometric constructions and rigidity arguments.
  • domain assumption Contact graphs that are disk triangulations exclude singular configurations and correspond to trivalent polyhedra.
    Used to define the regular class of circle patterns studied in the paper.

pith-pipeline@v0.9.0 · 5662 in / 1445 out tokens · 67057 ms · 2026-05-17T22:33:22.937414+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes
    ?
    echoes

    ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

    We will pay special attention to CPs whose contact graphs are disk triangulation graphs. Such CPs are called regular... prove a uniformization theorem for regular CPs... existence and rigidity of infinite convex trivalent polyhedra

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

87 extracted references · 87 canonical work pages · 1 internal anchor

  1. [1]

    Addario-Berry, M

    L. Addario-Berry, M. Albenque,The scaling limit of random simple triangulations and random simple quadrangulations. Ann. Probab. 45, no. 5, 2767-2825, 2017

    work page 2017

  2. [2]

    S. I. Agafonov,Embedded circle patterns with the combinatorics of the square grid and discrete Painlev´e equations. Discrete Comp. Geom. 29, 305-319, 2003

    work page 2003

  3. [3]

    L. V . Ahlfors,Lectures on quasiconformal mappings. Amer. Math. Soc., 2006

    work page 2006

  4. [4]

    A. D. Alexandrov,Convex polyhedra. Springer Verlag, 2005

    work page 2005

  5. [5]

    A. D. Alexandrov,Existence of a convex polyhedron and of a convex surface with a given metric. Mat. Sb. (N.S.) 53, no. 1, 15-65, 1942

    work page 1942

  6. [6]

    Anandam,Harmonic functions and potentials on finite or infinite networks

    V . Anandam,Harmonic functions and potentials on finite or infinite networks. volume 12 of Lecture Notes of the Unione Matematica Italiana. Springer, Heidelberg; UMI, Bologna, 2011. 61 Characterizations of infinite circle patterns and convex polyhedra in hyperbolic 3-space

    work page 2011

  7. [7]

    E. M. Andreev,Convex polyhedra in Loba ˘chevski˘i spaces. Mat. Sb. (N.S.) 81, no. 123, 445- 478, 1970

    work page 1970

  8. [8]

    E. M. Andreev,Convex polyhedra of finite volume in Loba ˘chevski˘i spaces. Mat. Sb. (N.S.) 83, no. 125, 255-260, 1970

    work page 1970

  9. [9]

    Angel, M

    O. Angel, M. T. Barlow, O. Gurel-Gurevich, A. Nachmias,Boundaries of planar graphs, via circle packings. Ann. Probab. 44, no. 3, 1956-1984, 2016

    work page 1956

  10. [10]

    Angel, T

    O. Angel, T. Hutchcroft, A. Nachmias, G. Ray,Unimodular hyperbolic triangulations: vircle packing and random walk. Invent. Math. 206, no. 1, 229-268, 2016

    work page 2016

  11. [11]

    X. Bao, F. Bonahon,Hyperideal polyhedra in hyperbolic 3-space. Bull. Soc. Math. Fr. 130, 457-491, 2022

    work page 2022

  12. [12]

    A. F. Beardon, K. Stephenson,The uniformization theorem for circle packings. Indiana Univ. Math J. 39, 1383-1425, 1990

    work page 1990

  13. [13]

    Benjamini, R

    I. Benjamini, R. Lyons, Y . Peres, O. Schramm,Uniform spanning forests. Ann. Probab. 29, no. 1, 1-65, 2001

    work page 2001

  14. [14]

    Benjamini, O

    I. Benjamini, O. Schramm,Harmonic functions on planar and almost planar graphs and manifolds, via circle packings. Invent. Math. 126, no. 3, 565-587, 1996

    work page 1996

  15. [15]

    Benjamini, O

    I. Benjamini, O. Schramm,Recurrence of distributional limits of finite planar graphs. Elec- tron. J. Probab. 6, no. 23, 1-13, 2001

    work page 2001

  16. [16]

    Bernardi, N

    O. Bernardi, N. Holden, X. Sun,Percolation on triangulations: a bijective path to Liouville quantum gravity. vol. 289, Mem. Amer. Math. Soc. 1440, American Mathematical Society, Providence, RI, 2023

    work page 2023

  17. [17]

    A. I. Bobenko, T. Hoffmann,Hexagonal circle patterns and integrable systems: patterns with constant angles. Duke Math. J. 116, no. 3, 525-566, 2003

    work page 2003

  18. [18]

    A. I. Bobenko, T. Hoffmann, B. Springborn,Minimal surfaces from circle patterns: geom- etry from combinatorics. Ann. Math. 164, no. 1, 231-264, 2006

    work page 2006

  19. [19]

    A. I. Bobenko, I. Izmestiev,Alexandrov’s theorem, weighted Delaunay triangulations, and mixed volumes. Ann. Inst. Fourier 58, no. 2, 447-505, 2008

    work page 2008

  20. [20]

    A. I. Bobenko, U. Pinkall, B. A. Springborn,Discrete conformal maps and ideal hyperbolic polyhedra. Geom. Topol. 19, no. 4, 2155-2215, 2015

    work page 2015

  21. [21]

    A. I. Bobenko, B. A. Springborn,Variational principles for circle patterns and Koebe’s theorem. Trans. Amer. Math. Soc. 356, no. 2, 659-689, 2004

    work page 2004

  22. [22]

    Bonsante, M

    F. Bonsante, M. Wolf,Projective rigidity of circle packings. Adv. Math. 461, Paper no. 110024, 51, 2025. 62 Characterizations of infinite circle patterns and convex polyhedra in hyperbolic 3-space

    work page 2025

  23. [23]

    J. C. Bowers, P. L. Bowers, K. Pratt,Rigidity of circle polyhedra in the 2-sphere and of hyperideal polyhedra in hyperbolic 3-space. Trans. Amer. Math. Soc. 371, no. 6, 4215- 4249, 2019

    work page 2019

  24. [24]

    Bowers, K

    P. Bowers, K. Stephenson,A branched Andreev-Thurston theorem for circle packings for the sphere. Proc. London Math. Soc. 73, no. 3, 185-215, 1996

    work page 1996

  25. [25]

    J. W. Cannon,The combinatorial Riemann mapping theorem. Acta Math. 173, no. 2, 155- 234, 1994

    work page 1994

  26. [26]

    Q. Chen, J. M. Schlenker,Hyperideal polyhedra in the 3-dimensional anti-de Sitter space. Adv. Math. 404, part B, Paper no. 108441, 61 pp, 2022

    work page 2022

  27. [27]

    Chelkak, B

    D. Chelkak, B. Laslier, M. Russkikh,Dimer model and holomorphic functions on t- embeddings of planar graphs. Proc. Lond. Math. Soc. 126, no. 5, 1656-1739, 2023

    work page 2023

  28. [28]

    B. Chow, F. Luo,Combinatorial Ricci flows on surfaces. J. Differential Geom. 63, no. 1, 97-129, 2023

    work page 2023

  29. [29]

    Curien,Peeling random planar maps

    N. Curien,Peeling random planar maps. Lecture notes from the 2019 Saint-Flour proba- bility summer school. Lecture Notes in Mathematics 2335. Springer, Berlin, 2023

    work page 2019

  30. [30]

    J. Ding, E. Gwynne,The fractal dimension of Liouville quantum gravity: universality, monotonicity, and bounds. Comm. Math. Phy. 374, 1877-1934, 2020

    work page 1934

  31. [31]

    Duplantier, S

    B. Duplantier, S. Sheffield,Liouville quantum gravity and KPZ. Invent. Math. 185, no. 2, 333-393, 2011

    work page 2011

  32. [32]

    H. Ge, B. Hua, Z. Zhou,Combinatorial Ricci flows for ideal circle patterns. Adv. Math. 383, no. 107698, 26 pp, 2021

    work page 2021

  33. [33]

    H. Ge, B. Hua, Z. Zhou,Circle patterns on surfaces of finite topological type. Amer. J. Math. 143, no. 5, 1397-1430, 2021

    work page 2021

  34. [34]

    H. Ge, H. Yu,Circle patterns with hyperbolic background via topological degree method. Calc. Var. PDE. 64, article no. 167, 2025

    work page 2025

  35. [35]

    H. Ge, H. Yu, P. Zhou,Infinite ideal polyhedra in hyperbolic 3-space: existence and rigid- ity. arXiv:2506.19528, 2025

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  36. [36]

    Georgakopoulos,The boundary of a square tiling of a graph coincides with the Poisson boundary

    A. Georgakopoulos,The boundary of a square tiling of a graph coincides with the Poisson boundary. Invent. Math. 203, no. 3, 773-821, 2016

    work page 2016

  37. [37]

    Gu ´eritaud,On an elementary proof of Rivin’s characterization of convex ideal hyperbolic polyhedra by their dihedral angles

    F. Gu ´eritaud,On an elementary proof of Rivin’s characterization of convex ideal hyperbolic polyhedra by their dihedral angles. Geom. Dedicata 108, 111-124, 2004

    work page 2004

  38. [38]

    Gurel-Gurevich, A

    O. Gurel-Gurevich, A. Nachmias,Recurrence of planar graph limits. Ann. Math. 177, no. 2, 761-781, 2013. 63 Characterizations of infinite circle patterns and convex polyhedra in hyperbolic 3-space

    work page 2013

  39. [39]

    Gwynne,Random surfaces and Liouville quantum gravity

    E. Gwynne,Random surfaces and Liouville quantum gravity. Notices Amer. Math. Soc. 67, no. 4, 484-491, 2020

    work page 2020

  40. [40]

    He,Rigidity of infinite disk patterns

    Z. He,Rigidity of infinite disk patterns. Ann. Math., 149, no. 1, 1-33, 1999

    work page 1999

  41. [41]

    Z. He, J. Liu,On the Teichm ¨uller theory of circle patterns. Trans. Amer. Math. Soc., 365, no. 12, 6517-6541, 2013

    work page 2013

  42. [42]

    Z. He, O. Schramm,Fixed points, Koebe uniformization and circle packings. Ann. Math. 137, 369-406, 1993

    work page 1993

  43. [43]

    Z. He, O. Schramm,Hyperbolic and parabolic packings. Discrete Comput. Geom. 14, no

    work page

  44. [44]

    C. D. Hodgson,Deduction of Andreev’s theorem from Rivin’s characterization of convex hyperbolic polyhedra, Topology ’90 (Columbus, OH, 1990), 185-193, Ohio State Univ. Math. Res. Inst. Publ., 1 Walter de Gruyter & Co., Berlin, 1992

    work page 1990

  45. [45]

    Holden, X

    N. Holden, X. Sun,Convergence of uniform triangulations under the Cardy embedding. Acta Math. 230, 93-203, 2023

    work page 2023

  46. [46]

    Huang, J

    X. Huang, J. Liu,Characterizations of circle patterns and finite convex polyhedra in hy- perbolic 3-space.Math. Ann. 368, 213-231, 2017

    work page 2017

  47. [47]

    Ivrii, V

    O. Ivrii, V . Markovi´c,Homogenization of random quasiconformal mappings and random Delauney triangulations. J. Differential Geom. 124, no. 3, 523-551, 2023

    work page 2023

  48. [48]

    Kenyon, W

    R. Kenyon, W. Y . Lam, S. Ramassamy, M. Russkikh,Dimers and circle patterns. Ann. Sci. ´Ec. Norm. Sup´er. 55, 865-903, 2022

    work page 2022

  49. [49]

    Koebe,Kontaktprobleme der konformen abbildung

    P. Koebe,Kontaktprobleme der konformen abbildung. Ber. S ¨achs. Akad. Wiss. Leipzig, Math. Phys. Kl. 88, 1936

    work page 1936

  50. [50]

    Kojima, S

    S. Kojima, S. Mizushima, S. P. Tan,Circle packings on surfaces with projective structures. J. Differential Geom. 63 (3), 349-397, 2003

    work page 2003

  51. [51]

    W. Y . Lam,Minimal surfaces from infinitesimal deformations of circle packings. Adv. Math. 362, 106939, 2020

    work page 2020

  52. [52]

    W. Y . Lam,Quadratic differentials and circle patterns on complex projective tori. Geom. Topol. 25 (2), 961-997, 2021

    work page 2021

  53. [53]

    G. F. Lawler, O. Schramm, W. Werner,Values of Brownian intersection exponents. I. Half- plane exponents. Acta Math. 187 (2),, 237-273, 2001

    work page 2001

  54. [54]

    Lis,Circle patterns and critical Ising models

    M. Lis,Circle patterns and critical Ising models. Comm. Math. Phys. 370, 507-530, 2019

    work page 2019

  55. [55]

    Le Gall,Random geometry on the sphere

    J.-F. Le Gall,Random geometry on the sphere. In Proceedings of the ICM-Seoul, vol. 1, pp. 421-442, 2014. 64 Characterizations of infinite circle patterns and convex polyhedra in hyperbolic 3-space

    work page 2014

  56. [56]

    J. Liu, Z. Zhou,How many cages midscribe an egg. Invent. Math. 203, no. 2, 655-673, 2016

    work page 2016

  57. [57]

    Jiang, Q

    Y . Jiang, Q. Luo, Z. Zhou,Circle patterns on surfaces of finite topological type revisited. Pacific J. Math. V ol. 306, No. 1, 203-220, 2020

    work page 2020

  58. [58]

    J. P. Otal,Thurston’s hyperbolization of Haken manifolds, in Surveys in Differential Ge- ometry. V ol. III, 77-194, Int. Press, Boston, MA, 1998

    work page 1998

  59. [59]

    Martelli,An introduction to geometric topology

    B. Martelli,An introduction to geometric topology. Publisher: Independently published, 488 pages, 3rd Edition, ISBN-13: 979-8858790709, 2023

    work page 2023

  60. [60]

    Marden, B

    A. Marden, B. Rodin,On Thurston’s formulation and proof of Andreev’s theorem. In: Com- putational Methods and Function Theory, Valparaso, 1989, in: Lecture Notes in Math., vol. 1435, Springer, Berlin, pp. 103-115, 1990

    work page 1989

  61. [61]

    Ratcliffe,Foundations of hyperbolic manifolds, Graduate texts in mathematics 149, Springer-Verlag, 1994

    J. Ratcliffe,Foundations of hyperbolic manifolds, Graduate texts in mathematics 149, Springer-Verlag, 1994

    work page 1994

  62. [62]

    Nachmias,Planar maps, random walks and circle packing

    A. Nachmias,Planar maps, random walks and circle packing. Lecture Notes in Mathemat- ics, Springer Open, 2020

    work page 2020

  63. [63]

    Rivin,Euclidean structures of simplicial surfaces and hyperbolic volume

    I. Rivin,Euclidean structures of simplicial surfaces and hyperbolic volume. Ann. Math. 139, no. 3, 553-580, 1994

    work page 1994

  64. [64]

    Rivin,A characterization of ideal polyhedra in hyperbolic 3-space

    I. Rivin,A characterization of ideal polyhedra in hyperbolic 3-space. Ann. Math. 143, 51-70, 1996

    work page 1996

  65. [65]

    Rivin,Combinatorial optimization in geometry

    I. Rivin,Combinatorial optimization in geometry. Adv. Appl. Math. 31, 242-271, 2003

    work page 2003

  66. [66]

    Rivin,Intrinsic geometry of convex ideal polyhedra in hyperbolic 3-space

    I. Rivin,Intrinsic geometry of convex ideal polyhedra in hyperbolic 3-space. In Analysis, Algebra, and Computers in Mathematical Research. Lecture Notes in Pure and Appl. Math., vol. 156, pp. 275–291. Marcel Dekker, Inc., New York, 1994

    work page 1994

  67. [67]

    Rivin, C

    I. Rivin, C. D. Hodgson,Characterization of compact convex polyhedra in hyperbolic 3- space. Invent. Math. 111, 77-111, 1993

    work page 1993

  68. [68]

    Rodin,Schwarz’s lemma for circle packings

    B. Rodin,Schwarz’s lemma for circle packings. Invent. Math. 89, 271-289, 1987

    work page 1987

  69. [69]

    Rodin, D

    B. Rodin, D. Sullivan,The convergence of circle packings to the Riemann mapping. J. Differential Geom. 26, 349-360, 1987

    work page 1987

  70. [70]

    R. K. W. Roeder, J. H. Hubbard, W. D. Dunbar,Andreev’s Theorem on hyperbolic polyhe- dra. Annales de l’institut Fourier, 57 no. 3, p. 825-882, 2007

    work page 2007

  71. [71]

    Rohde,Oded Schramm: from circle packing to SLE

    S. Rohde,Oded Schramm: from circle packing to SLE. Ann. Probab. 39 (5), 1621-1667, 2011

    work page 2011

  72. [72]

    Rousset,Sur la rigidit ´e e poly`edres hyperboliques en dimension 3: cas de volume fini, cas hyperid´eal, cas fuchsien

    M. Rousset,Sur la rigidit ´e e poly`edres hyperboliques en dimension 3: cas de volume fini, cas hyperid´eal, cas fuchsien. Bull. Soc. Math. Fr. 132, 233-261, 2004. 65 Characterizations of infinite circle patterns and convex polyhedra in hyperbolic 3-space

    work page 2004

  73. [73]

    J. M. Schlenker,Dihedral angles of convex polyhedra. Discrete Comput. Geom. 23: 409- 417, 2000

    work page 2000

  74. [74]

    J. M. Schlenker,Hyperideal circle patterns. Math. Res. Lett. 12 (1), 85-102, 2005

    work page 2005

  75. [75]

    Schramm,Rigidity of infinite (circle) packings

    O. Schramm,Rigidity of infinite (circle) packings. J. Amer. Math. Soc. 4, 127-149, 1991

    work page 1991

  76. [76]

    Schramm,How to cage an egg

    O. Schramm,How to cage an egg. Invent. Math., 107, 543-560, 1992

    work page 1992

  77. [77]

    Smirnov,Discrete complex analysis and probability

    S. Smirnov,Discrete complex analysis and probability. In Proceedings of the ICM, vol. I, 595-621, 2010

    work page 2010

  78. [78]

    Springborn,Ideal hyperbolic polyhedra and discrete uniformization

    B. Springborn,Ideal hyperbolic polyhedra and discrete uniformization. Discrete Comput. Geom. 64, no. 1, 63-108, 2020

    work page 2020

  79. [79]

    Springborn,A variational principle for weighted Delaunay triangulations and hyper- ideal polyhedra

    B. Springborn,A variational principle for weighted Delaunay triangulations and hyper- ideal polyhedra. J. Differential Geom., 78 (2), 333-367, 2008

    work page 2008

  80. [80]

    Stephenson,Introduction to circle packing

    K. Stephenson,Introduction to circle packing. The theory of discrete analytic functions. Cambridge University Press, Cambridge, 2005

    work page 2005

Showing first 80 references.