$C^\infty$-convergence of conformal mappings on triangular lattices
Ulrike B\"ucking

TL;DR
This paper proves that discrete conformal maps on triangular lattices converge smoothly to smooth conformal maps, and relates cross-ratios of lattice triangles to the Schwarzian derivative of the conformal map.
Contribution
It improves existing convergence results by establishing $C^ abla$-convergence of discrete conformal maps to smooth conformal maps on triangular lattices.
Findings
Discrete conformal maps converge in $C^ abla$ to smooth conformal maps.
Cross-ratios relate to the Schwarzian derivative of the conformal map.
Enhanced approximation of conformal maps using triangular lattices.
Abstract
Two triangle meshes are conformally equivalent if for any pair of incident triangles the absolute values of the corresponding cross-ratios of the four vertices agree. Such a pair can be considered as preimage and image of a discrete conformal map. In this article we study discrete conformal maps which are defined on parts of a triangular lattice with strictly acute angles. That is, is an infinite triangulation of the plane with congruent strictly acute triangles. A smooth conformal map can be approximated on a compact subset by such discrete conformal maps , defined on a part of for small enough, see [U. B\"ucking, Approximation of conformal mappings using conformally equivalent triangular lattices, in "Advances in Discrete Differential Geometry" (A.I. Bobenko ed.), Springer (2016), 133--149]. We improve this result and show…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
-convergence of conformal mappings for conformally
equivalent triangular lattices
Ulrike Bücking
Abstract.
Two triangle meshes are conformally equivalent if for any pair of incident triangles the absolute values of the corresponding cross-ratios of the four vertices agree. Such a pair can be considered as preimage and image of a discrete conformal map. In this article we study discrete conformal maps which are defined on parts of a triangular lattice with strictly acute angles. That is, is an infinite triangulation of the plane with congruent strictly acute triangles. A smooth conformal map can be approximated on a compact subset by such discrete conformal maps , defined on a part of , see [Büc16]. We improve this result and show that the convergence is in fact in . Furthermore, we describe how the cross-ratios of the four vertices for pairs of incident triangles are related to the Schwarzian derivative of .
1. Introduction
Holomorphic functions build the basis and heart of the rich theory of complex analysis. The subclass of conformal maps consists of holomorphic functions with nowhere vanishing derivatives. These may be characterized as infinitesimal scale-rotations. Möbius transformations are special conformal maps on the Riemann sphere , which preserve all cross-ratios. Recall that the cross-ratio of four distinct points is defined as
[TABLE]
A conformal map infinitesimally preserves cross-ratios. Additionally, the first deviation from being a Möbius transformation can be expressed by the Schwarzian derivative of , which is defined as
[TABLE]
In particular, there holds
[TABLE]
1.1. -convergence for discrete conformal maps on triangular
lattices
In the discrete theory, the idea of characterizing conformal maps as local scale-rotations may be translated into different concepts. Here we consider the discretization coming from a metric viewpoint: Infinitesimally, lengths are scaled by a factor, i.e. by for a conformal function on . The smooth complex domain is replaced in this discrete setting by a triangulation of a connected subset of the plane . The infinitesimal preservation of the cross-ratios is then substituted by the preservation of all length cross-ratios ( absolute values of the cross-ratio) for all pairs of incident triangles. (Note that only Möbius transformations would preserve all cross-ratios of pairs of incident triangles of the triangulation. So this condition would be two restrictive.)
In this article we consider the case where the triangulation is a (part of a) triangular lattice. In particular, let be a lattice triangulation of the whole complex plane with congruent triangles, see Figure 1(a).
The sets of vertices and edges of are denoted by and respectively. Edges will often be written as , where are its incident vertices. For triangular faces we use the notation enumerating the incident vertices with respect to the orientation (counterclockwise) of . We only consider the case of acute angles, i.e., and assume for simplicity that the origin is a vertex.
On a subcomplex of we now define a discrete conformal mapping by the preservation of the length cross-ratios.
Definition 1.1** (see [BPS15]).**
A discrete conformal map is the restriction to the vertices of a continuous and orientation preserving map of a subcomplex of a triangular lattice to . We demand that is locally a homeomorphism in a neighborhood of each interior point and that its restriction to every triangle is a linear map onto the corresponding image triangle, that is the mapping is piecewise linear. Furthermore, the absolute value of the cross-ratio (called length cross-ratio) is preserved for all pairs of adjacent triangles:
[TABLE]
where and are two adjacent triangles of the lattice with common edge and denotes the modulus of .
Note that the values of the cross-ratio on all interior edges determine the map up to a global Möbius transformation, see also Remark 3.2 below for more details.
Remark 1.2** ([BPS15]).**
For a continuous, orientation preserving and piecewise linear map on a simply connected subcomplex the preservation of the length cross-ratios is equivalent to the existence of a function on the vertices, called associated scale factors, such that for all edges there holds
[TABLE]
Thus the lengths of the edges of the triangulation are changed according to scale factors at the vertices. The new triangles are then “glued together” to result in a piecewise linear map, see Figure 2 for an illustration.
In fact, our definition of a discrete conformal map relies on the notion of discretely conformally equivalent triangle meshes. These have been studied by Luo, Gu, Sun, Wu, Guo [Luo04, GLSW, GGL*+*], Bobenko, Pinkall, and Springborn [BPS15] and others.
In [Büc16] we showed that given a smooth conformal map there exists a sequence of discrete conformal maps which approximates the given map on a compact set. In particular, the discrete conformal maps can be obtained from a Dirichlet problem: Given some function on the boundary of a subcomplex , find a discrete conformal map whose associated scale factors agree on the boundary with . Of course, we choose the boundary values according to the given function as . In this article we improve this result and show that the approximation in fact is . Furthermore, as a by-product, we establish the approximation of the Schwarzian derivative of using cross-ratios of pairs of incident triangles.
To be precise, denote by the lattice scaled by .
Theorem 1.3** ([Büc16, Theorem 1.1]).**
Let be a conformal map (i.e. holomorphic with ). Let be a compact set which is the closure of its simply connected interior and assume that . Let be a triangular lattice with strictly acute angles. For each let be a subcomplex of whose support is contained in and is homeomorphic to a closed disc. We further assume that [math] is an interior vertex of . Let be one of its incident edges.
Then if is small enough (depending on , , and ) there exists a unique discrete conformal map on which satisfies the following two conditions:
- •
The associated scale factors satisfy
[TABLE]
- •
The discrete conformal map is normalized according to
[TABLE]
Furthermore, the following estimates for and hold for all vertices and points in the support of respectively with constants depending only on , , and , but not on or :
- (i)
The scale factors approximate uniformly with error of order :
[TABLE] 2. (ii)
The discrete conformal maps converge to for uniformly with error of order :
[TABLE]
*where is the piecewise linear extension of from Definition 1.1. *
In this article the subcomplexes will be chosen such that they approximate the compact set . In particular, we will take for a subcomplex which is simply connected, contained in and contains [math] and is “as large as possible”. This means in particular, that adding any other triangle of which is contained in and shares an edge with a triangle of will result in a subcomplex which ceases to be simply connected.
Theorem 1.4**.**
*Under the assumptions of Theorem 1.3 and with the above definition of , the discrete conformal maps converges in to . *
The proof of Theorem 1.4 is inspired by the methods of the proof of -convergence for hexagonal circle packings in [HS98]. In particular, the main objects are discrete Schwarzians defined in Section 3 as suitably scaled measure of deformation of the Möbius invariant cross-ratios from their original values in the lattice . As the discrete Laplacian of such a discrete Schwarzian is a polynomial in and the discrete Schwarzians, we can deduce their -convergence in Section 4 analogously as in [HS98] from a Regularity lemma 4.2 using some facts on discrete differential operators introduced in Section 2. The necessary boundedness of the discrete Schwarzian itself can be deduced from Theorem 1.3. Finally, the -convergence of is shown in Section 5. Here, we also derive the precise connection between the limits of the discrete Schwarzians and the Schwarzian derivative of the given function . In Section 6 we discuss some generalizations of our proof, for example to the convergence of circle patterns with hexagonal combinatorics and other notions of discrete conformality.
1.2. Other convergence results for discrete conformal maps
Smooth conformal maps can be characterized in various ways. This leads to different notions of discrete conformality. Convergence issues have already been studied for some of these discrete analogs. We only give a very short overview and cite some results of a growing literature.
Linear definitions can be derived as discrete versions of the Cauchy-Riemann equations and have a long and still developing history. Connections of such discrete mappings to smooth conformal functions have been studied for example in [CFL28, LF55, Mer07, CS12, Sko13, BS16, Wer14]. In particular, this includes -convergence for the regular -lattice.
The idea of characterizing conformal maps as local scale-rotations has lead to the consideration of circle packings, more precisely to investigations on circle packings with the same (given) combinatorics of the tangency graph. Thurston [Thu85] first conjectured the convergence of circle packings to the Riemann map, which was then proven by [RS87, HS96, Ste97]. -convergence for hexagonal circle packings was shown in [HS98].
The theory of circle patterns generalizes the case of circle packings. Also, there is a link to integrable structures via isoradial circle patterns. The approximation of conformal maps using circle pattens has been studied in [Sch97] for orthogonal circle patterns with square grid combinatorics and furthermore in [Mat05, Büc07, Büc08, LD07, BBS17], which also contain results on -convergence.
2. Preliminaries on discrete differential operators and
notation
In the following, we introduce useful definitions and notation by generalizing the notions defined in [HS98, Sec. 2].
We consider the regular triangular lattice with edge length . In particular, let
[TABLE]
be the set of vertices. We abbreviate the edge directions by
[TABLE]
and the corresponding edge lengths in as in Figure 1(b) by
[TABLE]
Note in particular, that .
For denote by , the translation along one of the lattice directions. For any subset a vertex is called interior vertex of if all neighboring vertices for are contained in . Set and for each denote by the set of interior vertices of .
Given a function , denote by the function which differs from by a translation :
[TABLE]
Define the (discrete) directional derivative by
[TABLE]
so , where . For further use, note the following rule for the discrete differentiation of a product:
[TABLE]
Furthermore, define the (discrete) Laplacian by
[TABLE]
Note that this is a scaled version of the well-known -Laplacian as . Of course, the operators , , and commute with each other. We will also use to denote the -norm of .
Let be some domain and let be some function. For each , let be some function defined on a set of vertices . Assume that for every there are some such that for all we have .
Then we say that * converges to locally uniformly in *, if for every and every there are such that for every and every with .
If is differentiable, denote by the directional derivative, that is
[TABLE]
Let and suppose that is -smooth. We call * convergent to in * if for every sequence with the functions converges to locally uniformly in . If this holds for all , the convergence is .
The functions are called uniformly bounded in , if for every compact set there is some constant such that holds for every and all small enough. The functions are uniformly bounded in if they are uniformly bounded in for all .
The proofs of the following lemmas are simple adaptions of the corresponding arguments in [HS98, Sect. 2].
Lemma 2.1** (see [HS98, Lemma 2.1]).**
Let . Suppose that the functions are uniformly bounded in . Then for every sequence there is a -function and a subsequence of such that in along this subsequence.
Lemma 2.2** (see [HS98, Lemma 2.2]).**
Suppose that converges in to functions , defined on a domain , and suppose that in . Then the following convergences are in :
- (1)
, 2. (2)
, 3. (3)
, 4. (4)
if then , 5. (5)
.
3. The discrete Schwarzians
Let be a conformal map on a domain in the complex plane , that is, is a holomorphic function with non-vanishing derivative . The Schwarzian derivative of is defined in (1) and is itself holomorphic. Further, for any Möbius transformation we have and if and only if is the restriction of some Möbius transformation. For proofs and further properties of the Schwarzian see for example [Let87, Chap. II].
In the following, we will define Möbius invariants of conformally equivalent triangular lattices and derive their equations. Suitable Möbius invariants and corresponding equations have been worked out in [Sch97] for orthogonal circle patterns and in [HS98] for hexagonal circle packings.
Inspired by [HS98], we will use the Möbius invariants as intermediate means in the study of the convergence problem. The discrete Schwarzians will be defined as suitably scaled measure of deformation of the Möbius invariants from their regular values. The convergence of the discrete Schwarzians is also notable on its own right and increases the connection between analogous notions for smooth and discrete conformal maps.
For any interior edge in with two adjacent triangles and denote by
[TABLE]
the cross-ratio of the four vertices on the quad formed by the the two triangles and and by their images under respectively. Note that where the indices are taken modulo .
We define the discrete Schwarzian at by
[TABLE]
If is a Möbius transformation, we have , analogously to the smooth case.
For any vertex denote , see Figure 3 (left). Let be defined as and . Then obviously, and
[TABLE]
where the indices are taken modulo . Note that , as is a lattice.
Lemma 3.1**.**
Let be an interior vertex in . Then there holds
[TABLE]
for , where the indices are taken modulo , and .
Remark 3.2**.**
If the values of a function all lie in the upper half-plane and holds for all interior vertices , then equations (13)–(14) guarantee that corresponds to a discrete conformal map on (a part of) a triangular lattice . Indeed, start with any triangle of and map it to any triangle in respecting orientation. This defines the values of the discrete conformal map on the first triangle. Then the values of on all incident triangles can now be uniquely determined using (9). Our additional assumptions on show that the pattern is immersed. If is the triangulation of a simply connected domain, this procedure subsequently defines on all vertices. Equations (12)–(14) guarantee that no ambiguities will occur.
Proof of Lemma 3.1..
First note that (12) is an easy consequence of the fact that are cross-ratios of a flower. Furthermore, (14) follows from (12) and (13) by taking the complex conjugation of (13) because using (3).
In order to see (13), add circumcircles to the triangles of the flower around and map to by a Möbius transformation as illustrated in Figure 3 (right).
As the Möbius transformation does not change the values of the ’s, we easily identify equations (12) and (13) as the closing conditions for the image polygon. ∎
Our next goal is to derive from (12)–(14) an expression for the Laplacian of the discrete Schwarzians which equals a polynomial in for . Then, if all discrete Schwarzians are uniformly bounded for small and on , also all Laplacians are uniformly bounded on .
For an interior vertex substitute in (12)–(14), and obtain (using for example a computer algebra program):
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Lemma 3.3**.**
* is equal to a polynomial in the variables , . In particular,*
[TABLE]
where the indices are taken modulo .
Proof.
We consider the case . Fix . Denote , and .
First recall that and . Thus only involves the values of and at .
Take times (15) and add times (16) for and times (17) for . After simplification we obtain
[TABLE]
By cyclic permutation we also have
[TABLE]
Now combine times (15) with times (16) for and times (17) for . This gives
[TABLE]
By cyclic permutation we also have
[TABLE]
Adding up these four equations and dividing by we finally arrive at
[TABLE]
Again, we have used (11). This proves the lemma for . For other values of the lemma is also true by symmetry. ∎
4. Boundedness and convergence of the discrete
Schwarzians
We start by showing that we used a suitable order of in the definition of the discrete Schwarzians, as they are bounded in the limit .
Lemma 4.1**.**
Let be an interior vertex. Then for small enough
[TABLE]
for some constant , which depends only on , and .
Proof.
By our assumptions, the maps are discrete conformal. This means in particular by Definition 1.1, that the absolute values of the cross-ratios and agree. Thus
[TABLE]
Recall that . If we take , then is the sum of the two angles opposite to the edge in the triangles in the lattice (and in fact as we assumed strictly acute angles). Similarly, the angle is the interior intersection angle of the circumcircles of the two image triangles used for the cross-ratio . In particular, is the sum of the two angles in the image pattern opposite to the edge . Thus (18) is satisfied if we can show that holds for some constant which is independent of . For the calculation of the angles in the triangles, we use the following half-angle formula
[TABLE]
with the notation of Figure 1(b). The discrete conformality (3) together with (20) implies that
[TABLE]
where we denote by for the differences of the logarithmic scale factors. Then (5) and the uniform convergence of implies that for small enough we can write
[TABLE]
where we denote for . The notation means that there is a constant , such that holds for all small enough . Note that the constant is independent of due to estimate (5). Now a Taylor expansion in (using for example a computer algebra program) shows that
[TABLE]
This implies that for some constant (independent of ) and finally (18) for small enough. ∎
The following lemma on regularity of solutions of discrete elliptic equations constitutes another main ingredient for our convergence proof.
Lemma 4.2** (Regularity lemma).**
Let be a subset of . Let and let be the Euclidean distance from to . Let be any function. Then
[TABLE]
holds for , where .
Note that this lemma is a version of [HS98, Regularity Lemma 7.1] and we leave the small, but necessary adaptions of the proof to the reader.
Using this Regularity lemma we will deduce convergence of a subsequence of the discrete conformal maps of Theorem 1.4 as we already know from Lemma 4.1 that the discrete Schwarzians are uniformly bounded with a bound independent of . Lemma 3.3 now implies that the functions are also uniformly bounded. By Lemma 4.2 also has such a bound (locally uniformly). Thus it follows by Lemma 2.1 that for some sequence of tending to [math] there exists a continuous limit , which are Lipschitz functions on the interior of . Note that relation (11) implies that
[TABLE]
Together with (15) this gives
[TABLE]
For simplicity, we assume that the boundary of the compact set in Theorem 1.4 has positive reach . This means that for every all points with distance at most to the boundary have a unique projection onto , that is there exists a unique point such that . Any compact set which is the closure of its simply connected interior can be approximated by such compact sets with positive reach.
For every denote by the vertices of which have at least Euclidean distance to any vertex in . As is assumed to have positive reach and as is simply connected, contains all vertices whose distance to the boundary is at least for all .
Lemma 4.3**.**
Let and . There are constants and such that
[TABLE]
holds whenever and . In other words, the functions are uniformly bounded in .
The proof is very similar to the proof of Lemma 8.1 in [HS98].
Proof.
We use induction on . The case has been shown in Lemma 4.1.
So let and assume that the lemma holds for . Consider . Then Lemma 3.3 implies that is a linear combination of functions of the form where is one of the functions , , , , , for . Recall from (15)–(17) that these functions are polynomials in and the ’s. From the product rule (6) it follows by induction that is also a polynomial in and expressions of the form where .
Let , . Then if . Now the induction hypothesis with , and applies and provides a bound for at . Since is a polynomial in and the expressions of the form for and , we deduce that for some constant . As is also bounded on by the induction hypothesis, the Regularity lemma 4.2 implies that is bounded on and therefore the induction step holds. This finishes the proof. ∎
Corollary 4.4**.**
* in as .*
Proof.
By Lemma 4.3 and Lemma 2.1 this claim is true for some subsequence. The general statement will follow later as corollary of Theorem 5.1, when we prove the convergence in full generality. ∎
5. -convergence of the discrete conformal maps
As primary step to the convergence of the discrete conformal maps we consider special Möbius transformations from triangles of to their images under . In particular, define the contact transformation for any interior vertex to be the Möbius transformation which maps the three points [math], , to the three points , , respectively.
Let denote the translation . Then we easily note that
[TABLE]
Furthermore, we have
[TABLE]
These two relations allow us to express in terms of and the transition matrices and :
[TABLE]
The matrix representations of and are
[TABLE]
Note that both and are polynomial in and . Now direct computation gives
[TABLE]
where is the identity matrix and denotes some matrix which is polynomial in . Combined with (23) the discrete derivative may be express as follows:
[TABLE]
Similar computations give
[TABLE]
(Of course, the matrix in differs in general from the one in (24).) As and the expressions for all derivatives can be obtained from (24) and (25).
Recall that [math] is a vertex of and define . Then we deduce from (24) and (25) and the similar expressions for the other that . As and as is part of a (scaled) lattice contained in the compact set we deduce that is bounded, independently of . From the corresponding relations for we deduce that for ,
[TABLE]
As the elements of the matrix in the -term are polynomials in and for , Lemma 4.3 implies that the -term is bounded in . Therefore, repeated differentiation of (26) shows that is bounded in . Now we can again deduce from Lemma 2.1 that along some subsequence the limit exists and that the convergence is in . Moreover, equations (24) and (25) imply
[TABLE]
These relations show that , which means that is a matrix-valued analytic function. As the determinant of is constant and we deduce that is a Möbius transformation.
Our next step is to show that also converges for some subsequence of . To this end we will show that is bounded independently of and converges.
Denote by the image of by the Möbius transformation . First recall that by Theorem 1.3 we know that for , where is a vertex nearest to . Further note that and . Thus, for small enough the three points , and are pairwise different. Let be two vertices which are nearest to and - respectively. Then maps , , (which are points close to , , ) to points close to , , respectively. This shows that exists and is the Möbius transformation which maps , , to , , . By similar arguments, we see that the same is also true for the other transformations . Thus, we obtain -convergence along some subsequence .
Theorem 5.1**.**
[TABLE]
This theorem implies that the convergence of holds along every subsequence, which proves Corollary 4.4.
Proof.
We have already shown that
[TABLE]
is a Möbius transformation and . From (24) we deduce the relation
[TABLE]
which implies that and satisfy the same differential equation
[TABLE]
Therefore constant and . This implies (with ) for the Schwarzian of that
[TABLE]
Now using , and the identity (22), it is easy to check that that (29) holds. ∎
As is discrete conformal, we deduce from (19) that () are purely imaginary. Therefore, it follows from (30) that
[TABLE]
Finally we deduce the -convergence of the discrete conformal maps .
Proof of Theorem 1.4.
Recall that . We have already shown that the Möbius transformations
[TABLE]
converge for in to the Möbius transformation . Then converges to and converges to and as and the determinant of is nonzero. Consequently, Lemma 2.1 implies that converges in to . ∎
6. Remarks on generalizations
Discrete analogues of conformal maps already have a long history. The methods for a proof of -convergence considered in this article for discrete conformal based on conformally equivalent triangular meshes also works very similarly for circle patterns on hexagonal lattices. Here we take the circumcircles of all triangles in and demand that the intersection angles of these circumcircles are preserved. In other words, such discrete maps preserve the arguments of the cross-ratios . Note that in this case, equations (12) and (13) are still valid. Only (14) has to be replaced by a similar equation where certain unitary numbers (quotients of ’s) appear instead of quotients of absolute values of ’s. Therefore, given convergence (in or say) of such circle patterns and some bounds on the discrete Schwarzians, the rest of the proof could be applied with only minor adaptions to show -convergence of regular hexagonal circle patterns. Similar ideas have already been worked out in [LD07] for orthogonal circle patterns with square grid combinatorics using other Möbius invariants and in [Büc08] for the more general case of isoradial circle patterns studying the radius function. Note that similarly to the method of the proof of [Büc08], -approximation of the discrete conformal maps considered in this article can also be shown based on estimates for the discrete Laplacian of the scale factors .
Generalizing the notion of a conformal map to include both, Definition 1.1 and hexagonal circle patterns, we may consider maps such that a fixed linear combination of the real and the imaginary part of the cross-ratios remains constant:
[TABLE]
for some fixed constants and . Again, equations (12) and (13) are still valid and only (14) has to be adapted. This generalized notion of discrete conformality has not been studied yet. But if there was a suitable convergence result (for example uniform convergence of and bounds on the discrete Schwarzians) the methods of our proof of -convergence could be applied analogously.
Acknowledgement
This research was supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics”. The author is grateful to A.I. Bobenko for discussions on the topic of discrete conformal maps on hexagonal lattices.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BBS 17] Alexander I. Bobenko, Ulrike Bücking, and Stefan Sechelmann, Discrete minimal surfaces of Koebe type , Modern Approaches to Discrete Curvature (L. Najman and P. Romon, eds.), Lecture Notes in Mathematics, Springer, to appear in 2017.
- 2[BPS 15] Alexander I. Bobenko, Ulrich Pinkall, and Boris Springborn, Discrete conformal maps and ideal hyperbolic polyhedra , Geometry and Topology 19 (2015), 2155–2215, eprint ar Xiv:1005.2698 [math.GT].
- 3[BS 16] Alexander I. Bobenko and Mikhail Skopenkov, Discrete Riemann surfaces: linear discretization and its convergence , J. Reine Angew. Math. 720 (2016), 217–250.
- 4[Büc 07] Ulrike Bücking, Approximation of conformal mappings by circle patterns and discrete minimal surfaces , Ph.D. thesis, Technische Universität Berlin, 2007, published online at http://opus.kobv.de/tuberlin/volltexte/2008/1764/ .
- 5[Büc 08] by same author, Approximation of conformal mappings by circle patterns , Geom. Dedicata 137 (2008), 163–197.
- 6[Büc 16] by same author, Approximation of conformal mappings using conformally equivalent triangular lattices , Advances in Discrete Differential Geometry (A.I. Bobenko, ed.), Springer, 2016, pp. 133–149.
- 7[CFL 28] Richard Courant, Kurt Friedrichs, and Hans Lewy, Über die partiellen Differenzengleichungen der mathematischen Physik , Math. Ann. 100 (1928), 32–74, English transl.: IBM Journal (1967), 215–234.
- 8[CS 12] Dmitry Chelkak and Stanislav Smirnov, Universality in the 2D Ising model and conformal invariance of fermionic observables , Invent. math. 189 (2012), 515–580, eprint ar Xiv:0910.2045 [math-ph].
