RECORD
On rigidity and convergence of circle patterns
Complex Variables · Submitted 4 May 2016
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Then a subsequence of the corresponding discrete conformal maps converges to a Riemann map between the given domains.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a hyperbolic isometry. Furthermore, we prove an analogous rigidity statement for the complex plane if all exterior intersection angles of neighboring circles are uniformly bounded away from $0$. Finally, we study a sequence of two circle patterns with the same combinatorics each of which approximates a given simply connected domain. Assume that all kites are convex and all angles in the kites are uniformly bounded and the radii of one circle pattern converge to $0$. Then a subsequence of the corresponding discrete conformal maps converges to a Riemann map between the given domains.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. | background 1.00 | 0.13 | 0.06 | hedged possibility 0.79 |
| s1 | We show that two locally finite circle patterns covering the unit disc are related by a hyperbolic isometry. | result 0.98 | 0.93 | 0.43 | asserted 1.00 |
| s2 | Furthermore, we prove an analogous rigidity statement for the complex plane if all exterior intersection angles of neighboring circles are uniformly bounded away from $0$. | result 0.96 | 0.92 | 0.19 | asserted 1.00 |
| s3 | Finally, we study a sequence of two circle patterns with the same combinatorics each of which approximates a given simply connected domain. | contribution 0.99 | 0.84 | 0.04 | asserted 0.74 |
| s4 | Assume that all kites are convex and all angles in the kites are uniformly bounded and the radii of one circle pattern converge to $0$. | method 0.43 | 0.28 | 0.03 | unclear 0.54 |
| s5 | Then a subsequence of the corresponding discrete conformal maps converges to a Riemann map between the given domains. | result 1.00 | 0.87 | 0.43 | asserted 0.98 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a hyperbolic isometry. Furthermore, we prove an analogous rigidity statement for the complex plane if all exterior intersection angles of neighboring circles are uniformly bounded away from $0$. Finally, we study a sequence of two circle patterns with the same combinatorics each of which approximates a given simply connected domain. Assume that all kites are convex and all angles in the kites are uniformly bounded and the radii of one circle pattern converge to $0$. Then a subsequence of the corresponding discrete conformal maps converges to a Riemann map between the given domains.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites
Cites as background 1 paper
-
Note that convergence issues on q-bounded kite patterns for Dirichlet problems with respect to the linear Laplacian (see [ref] below) have recently been investigated in [ref] .
Discrete analytic functions on non-uniform lattices without global geometric control · Introduction · 0.86
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.