Related papers: Packing Disks by Flipping and Flowing

Given a triangulated surface $M$, we use Ge-Xu's $\alpha$-flow \cite{Ge-Xu1} to deform any initial inversive distance circle packing metric to a metric with constant $\alpha$-curvature. More precisely, we prove that the inversive distance…

We establish the existence of a cusp in the curvature of a solid sheet at its contact with a liquid subphase. We study two configurations in floating sheets where the solid-vapor-liquid contact line is a straight line and a circle,…

In this paper we generalize the classical theorem of Thue about the optimal circular disc packing in the plane. We are given a family of circular discs, not necessarily of equal radii, with the property that the inflation of every disc by a…

An extremal $k$-packing is a collection of $k$ mutually disjoint metric discs, embedded in a surface, whose radius is maximal for the given topology. We study compact non-orientable surfaces of genus $g\ge 3$ containing extremal…

The maximum principle for hyperbolic inversive distance circle packings on polyhedral surfaces is established,which unifies and generalizes existing maximum principles for various types of circle packings in the literature.As an application…

Using the well-known ``displace, cut and reflect'' method used to generate disks from given solutions of Einstein field equations, we construct static charged disks made of perfect fluid based on the Reissner-Nordstr\"{o}m solution in…

We experimentally demonstrate that the flow rate of granular material through an aperture is controlled by the exit velocity imposed to the particles and not by the pressure at the base, contrary to what is often assumed in previous works.…

To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph…

Let $\mathcal{P}$ be a packing of circular disks of radius $\rho>0$ in the Euclidean, spherical, or hyperbolic plane. Let $0\leq\lambda\leq\rho$. We say that $\mathcal{P}$ is a $\lambda$-separable packing of circular disks of radius $\rho$…

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

The Andreev-Thurston Circle Packing Theorem is generalized to packings of convex bodies in planar simply connected domains. This turns out to be a useful tool for constructing conformal and quasiconformal mappings with interesting geometric…

A decomposition of $K_{n(g)}\setminus L$, the complete n-partite equipartite graph with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum group divisible packing of $K_{n(g)}$ with G if L…

Let $G=(V, E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal C}$ be an arrangement of disks with a bijection between the disks…

Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…

Thurston's circle packing approximation of the Riemann Mapping (proven to give the Riemann Mapping in the limit by Rodin-Sullivan) is largely based on the theorem that any topological disk with a circle packing metric can be deformed into a…

The problem of diffraction of an electromagnetic plane wave by a perfectly conducting circular disk and its complementary problem, diffraction by a circular hole in an infinite conducting plate, are rigorously solved using the method of the…

Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…

We consider a one-parameter family of invertible maps of a two-dimensional lattice, obtained by discretising the space of planar rotations. We let the angle of rotation approach $\pi/2$, and show that the limit of vanishing discretisation…

For triangulated surfaces, we introduce the combinatorial Calabi flow which is an analogue of smooth Calabi flow. We prove that the solution of combinatorial Calabi flow exists for all time. Moreover, the solution converges if and only if…

Let $\mathcal{D}$ be a set of $n$ disks in the plane. The disk graph $G_\mathcal{D}$ for $\mathcal{D}$ is the undirected graph with vertex set $\mathcal{D}$ in which two disks are joined by an edge if and only if they intersect. The…