中文
相关论文

相关论文: A Simple Proof of Thue's Theorem on Circle Packing

200 篇论文

Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…

计算几何 · 计算机科学 2007-12-13 Siu-Wing Cheng , Tamal K. Dey

A weak form of the Circle Criterion for Lur'e systems is stated. The result allows prove global boundedness of all system solutions. Moreover such a result can be employed to enlarge the set of nonlinearities for which the standard Circle…

混沌动力学 · 物理学 2008-06-27 Donatello Materassi , Murti Salapaka , Michele Basso

Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…

一般拓扑 · 数学 2011-12-02 V. V. Filippov , E. Yu. Mychka

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…

度量几何 · 数学 2020-07-07 John C. Bowers

Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. It is possible for every circle in such a packing to have integer radius of curvature, and we call such a…

数论 · 数学 2007-05-23 R. L. Graham , J. C. Lagarias , C. L. Mallows , A. R. Wilks , C. H. Yan

We prove some rigidity theorems for configurations of closed disks. First, fix two collections $\mathcal{C}$ and $\tilde{\mathcal{C}}$ of closed disks in the Riemann sphere $\hat{\mathbb{C}}$, sharing a contact graph which…

度量几何 · 数学 2015-10-08 Andrey M. Mishchenko

This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a…

离散数学 · 计算机科学 2011-07-25 Wenqi Huang , Tao Ye , Duanbing Chen

Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…

度量几何 · 数学 2017-06-19 K. Böröczky , A. Heppes , E. Makai

We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.

数论 · 数学 2014-03-03 Lahoucine Elaissaoui

We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…

组合数学 · 数学 2025-05-20 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

We give a simple proof of Bourgain's theorem on the singularity of Ornstein's maps.

动力系统 · 数学 2015-09-01 El Houcein El Abdalaoui

We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…

软凝聚态物质 · 物理学 2022-05-23 Paolo Amore , Tenoch Morales

We provide a simple proof of the existence of a planar separator by showing that it is an easy consequence of the circle packing theorem. We also reprove other results on separators, including: (A) There is a simple cycle separator if the…

计算几何 · 计算机科学 2025-10-07 Sariel Har-Peled

Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…

计算几何 · 计算机科学 2016-12-12 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh , Nikolay Martynchuk

We consider the complexity of Delaunay triangulations of sets of points in R^3 under certain practical geometric constraints. The spread of a set of points is the ratio between the longest and shortest pairwise distances. We show that in…

计算几何 · 计算机科学 2007-05-23 Jeff Erickson

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

计算几何 · 计算机科学 2015-03-30 Milos Tatarevic

Motivated by Guo-Luo's generalized circle packings on surfaces with boundary \cite{GL2}, we introduce the generalized Thurston's sphere packings on 3-dimensional manifolds with boundary. Then we investigate the rigidity of the generalized…

几何拓扑 · 数学 2023-09-07 Xu Xu , Chao Zheng

Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…

软凝聚态物质 · 物理学 2016-05-05 Yoav Kallus

In the case of smooth manifolds, we use Forman's discrete Morse theory to realize combinatorially any Thom-Smale complex coming from a smooth Morse function by a couple triangulation-discrete Morse function. As an application, we prove that…

几何拓扑 · 数学 2008-12-18 Etienne Gallais

A variant of the Circle Packing Theorem states that the combinatorial class of any convex polyhedron contains elements midscribed to the unit sphere centered at the origin, and that these representatives are unique up to M\"obius…

度量几何 · 数学 2018-11-06 Zsolt Lángi