The main result of this thesis is a rigidity theorem for configurations of closed disks in the plane. More precisely, fix two collections C and C' of closed disks, sharing a contact graph which (mostly-)triangulates the complex plane, so that for all corresponding pairs of intersecting disks Di, Dj in C and Di', Dj' in C', we have that the intersection angle between the boundary circles of Di and Dj equals the analogous angle for Di' and Dj'. We require the extra condition that the collections C and C' are thin, meaning that no pair of disks of C meet in the interior of a third, and similarly for C'. Then C and C' differ by a Euclidean similarity. Our proof is elementary, using essentially only plane topology arguments and manipulations by...
Disk intersection (respectively, touching) graphs are the inersection graphs of closed disks in the ...
We have previously explored cylindrical packings of disks and their relation to sphere packings. Her...
We show that a jammed packing of disks with generic radii, in a generic container, is such that the ...
Let P be a locally flnite disk pattern on the complex plane C whose combinatorics are described by t...
We study the combinatorial and rigidity properties of disc packings with generic radii. We show that...
We present three results which support the conjecture that a graph is minimally rigid in d-dimension...
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems...
A simple graph is 3-rigid if its generic embeddings in R^3 are infinitesimally rigid. Necessary and ...
The Koebe-Andreev-Thurston Circle Packing Theorem states that every triangulated planar graph has a ...
We prove that uniformly random packings of copies of a certain simply connected figure in the plane ...
William Thurston first proposed that real circles could be used to approximate the underlying infini...
AbstractIn Ludwig Danzer’s Habilitatiionsschrift [L. Danzer, Endliche Punktmengen auf der 2-Sphäre m...
Let D be a set of disks and G be the intersection graph of D. A drawing of G is obedient to D if eve...
We answer two questions of Beardon and Minda which arose from their study of the conformal symmetrie...
A Sierpi\'nski packing in the $2$-sphere is a countable collection of disjoint, non-separating conti...
Disk intersection (respectively, touching) graphs are the inersection graphs of closed disks in the ...
We have previously explored cylindrical packings of disks and their relation to sphere packings. Her...
We show that a jammed packing of disks with generic radii, in a generic container, is such that the ...
Let P be a locally flnite disk pattern on the complex plane C whose combinatorics are described by t...
We study the combinatorial and rigidity properties of disc packings with generic radii. We show that...
We present three results which support the conjecture that a graph is minimally rigid in d-dimension...
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems...
A simple graph is 3-rigid if its generic embeddings in R^3 are infinitesimally rigid. Necessary and ...
The Koebe-Andreev-Thurston Circle Packing Theorem states that every triangulated planar graph has a ...
We prove that uniformly random packings of copies of a certain simply connected figure in the plane ...
William Thurston first proposed that real circles could be used to approximate the underlying infini...
AbstractIn Ludwig Danzer’s Habilitatiionsschrift [L. Danzer, Endliche Punktmengen auf der 2-Sphäre m...
Let D be a set of disks and G be the intersection graph of D. A drawing of G is obedient to D if eve...
We answer two questions of Beardon and Minda which arose from their study of the conformal symmetrie...
A Sierpi\'nski packing in the $2$-sphere is a countable collection of disjoint, non-separating conti...
Disk intersection (respectively, touching) graphs are the inersection graphs of closed disks in the ...
We have previously explored cylindrical packings of disks and their relation to sphere packings. Her...
We show that a jammed packing of disks with generic radii, in a generic container, is such that the ...