ﻻ يوجد ملخص باللغة العربية
Circle packings with specified patterns of tangencies form a discrete counterpart of analytic functions. In this paper we study univalent packings (with a combinatorial closed disk as tangent graph) which are embedded in (or fill) a bounded, simply connected domain. We introduce the concept of crosscuts and investigate the rigidity of circle packings with respect to maximal crosscuts. The main result is a discrete version of an indentity theorem for analytic functions (in the spirit of Schwarz Lemma), which has implications to uniqueness statements for discrete conformal mappings.
The main purpose of this article is to demonstrate three techniques for proving algebraicity statements about circle packings. We give proofs of three related theorems: (1) that every finite simple planar graph is the contact graph of a circle packin
We obtain explicit and simple conditions which in many cases allow one decide, whether or not a Denjoy domain endowed with the Poincare or quasihyperbolic metric is Gromov hyperbolic. The criteria are based on the Euclidean size of the complement. As
A simple graph G=(V,E) is 3-rigid if its generic bar-joint frameworks in R3 are infinitesimally rigid. Block and hole graphs are derived from triangulated spheres by the removal of edges and the addition of minimally rigid subgraphs, known as blocks,
We consider the problem of characterising the generic rigidity of bar-joint frameworks in $mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu and L. Ther
We prove that a Finsler metric is nonpositively curved in the sense of Busemann if and only if it is affinely equivalent to a Riemannian metric of nonpositive sectional curvature. In other terms, such Finsler metrics are precisely Berwald metrics of