Characterizing circles by a convex combinatorial property

Some criteria for circle packing types and combinatorial Gauss-Bonnet Theorem

We investigate criteria for circle packing(CP) types of disk triangulation graphs embedded into simply connected domains in $ \mathbb{C}$. In particular, by studying combinatorial curvature and the combinatorial Gauss-Bonnet theorem involving boundary turns, we show that a disk triangulation graph is CP parabolic if \[ \sum_{n=1}^\infty \frac{1}{\sum_{j=0}^{n-1} (k_j +6)} = \infty, \] where $k_n$ is the degree excess sequence defined by \[ k_n = \sum_{v \in B_n} (\mbox{deg}\, v - 6) \] for combinatorial balls $B_n$ of radius $n$ and centered at a fixed vertex. It is also shown that the simple …

A combinatorial criterion for macroscopic circles in planar triangulations

Given a finite simple triangulation, we estimate the sizes of circles in its circle packing in terms of Cannon's vertex extremal length. Our estimates provide control over the size of the largest circle in the packing. We use them, combined with results from [12], to prove that in a proper circle packing of the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield, the size of the largest circle goes to zero with high probability.

A proof of the Koebe-Andre'ev-Thurston theorem via flow from tangency packings

Recently, Connelly and Gortler gave a novel proof of the circle packing theorem for tangency packings by introducing a hybrid combinatorial-geometric operation, flip-and-flow, that allows two tangency packings whose contact graphs differ by a combinatorial edge flip to be continuously deformed from one to the other while maintaining tangencies across all of their common edges. Starting from a canonical tangency circle packing with the desired number of circles a finite sequence of flip-and-flow operations may be applied to obtain a circle packing for any desired (proper) contact graph with the…

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $U_0$ and $U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $j\in \{0,1,2\}$ and $k\in\{0,1\}$ such that $U_{1-k}$ is included in the convex hull of $U_k\cup(\{A_0,A_1, A_2\}\setminus\{A_j\})$. One could say disks instead of circles. Here we prove the existence of such a $j$ and $k$ for the more general case where $U_0$ and $U_1$ are compact sets in the plane such that $U_1$ is obtained from $U_0$ by a positive homothety or by a translation. Also, we give a short survey to show how lattice theoretical anteceden…

由圆所包围且庞加莱-里布图为树的区域

Regions surrounded by circles whose Poincaré-Reeb graphs are trees

本文研究由圆包围且庞加莱-里布图为树的平面区域，通过从圆盘出发的归纳规则刻画所得树的结构，为实代数映射到指定闭区域的显式构造问题提供组合与几何基础。