Abstract
Let $P$ be a locally finite disk pattern on the complex plane $\mathbb{C}$ whose combinatorics are described by the one-skeleton $G$ of a triangulation of the open topological disk and whose dihedral angles are equal to a function $\Theta\colon E\to [0,\pi/2]$ on the set of edges. Let $P^\ast$ be a combinatorially equivalent disk pattern on the plane with the same dihedral angle function. We show that $P$ and $P^\ast$ differ only by a euclidean similarity.
In particular, when the dihedral angle function $\Theta$ is identically zero, this yields the rigidity theorems of B. Rodin and D. Sullivan, and of O. Schramm, whose arguments rely essentially on the pairwise disjointness of the interiors of the disks. The approach here is analytical, and uses the maximum principle, the concept of vertex extremal length, and the recurrency of a family of electrical networks obtained by placing resistors on the edges n the contact graph of the pattern.
A simlar rigidity property holds for locally finite disk patterns in the hyperbolic plane, where the proof follows by a simple use of the maximum princple. Also, we have a uniformization result for disk patterns.
In a future paper, the techniques of this paper will be extended to the case when $0\le \Theta\lt \pi$. In particular, we will show a rigidity property for a class of infinite convex polyhedra in the $3$-dimensional hyperbolic space.
