Learn More
The contacts graph, or nerve, of a packing, is a combinatorial graph that describes the combinatorics of the packing. Let G be the 1-skeleton of a triangulation of an open disk. G is said to be CP parabolic respectively CP hyperbolic], if there is a locally nite disk packing P in the plane respectively, the unit disk] with contacts graph G. Several criteria(More)
Let P be a locally finite disk pattern on the complex plane C whose combinatorics is described by the one-skeleton G of a triangulation of the open topological disk and whose dihedral angles are equal to a function Θ : E → [0, π/2] on the set of edges. Let P ∗ be a combinatorially equivalent disk pattern on the plane with the same dihedral angle function.(More)
A physically natural potential energy for simple closed curves in R3 is shown to be invariant under Möbius transformations. This leads to the rapid resolution of several open problems: round circles are precisely the absolute minima for energy; there is a minimum energy threshold below which knotting cannot occur; minimizers within prime knot types exist(More)
Aerosol nanoparticle generation is a key step in calibrating aerosol instruments, examining nanoparticle properties, and investigating aerosol formation mechanism in photochemical smog systems. An aerosol nanoparticle generation system (including an atomizer and a diffusion dryer) was developed and evaluated in this study. Aqueous solution of NaCl and(More)
Rodin and Sullivan (1987) proved Thurston’s conjecture that a scheme based on the Circle Packing Theorem converges to the Riemann mapping, thereby providing a refreshing geometric view of Riemann’s Mapping Theorem. We now present a new proof of the Rodin–Sullivan theorem. This proof is based on the argument principle, and has the following virtues. 1. It(More)