Related papers: Counter Examples to Invariant Circle Packing
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…
Granular convergence is a property of a granular pack as it is repeatedly sheared in a cyclic, quasistatic fashion, as the packing configuration changes via discrete events. Under suitable conditions the set of microscopic configurations…
We give an overview of the 2025 Computational Geometry Challenge targeting the problem Minimum Non-Obtuse Triangulation: Given a planar straight-line graph G in the plane, defined by a set of points in the plane (representing vertices) and…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
We consider some planar triangular maps. These maps preserve certain fibration of the plane. We assume that there exists an invariant attracting fiber and we study the limit dynamics of those points in the basin of attraction of this…
We consider differentiability issues associated to the problem of minimizing the accumulation of a granular cohesionless material on a certain surface. The design variable or control is determined by source locations and intensity thereof.…
We prove the existence of weak solutions of a class of multi-species cross-diffusion systems as well as the propagation of chaos result by means of nonlocal approximation of the nonlinear diffusion terms, coupling methods and compactness…
How can one change a system, in order to change its statistical properties in a prescribed way? In this note we consider a control problem related to the theory of linear response. Given an expanding map of the unit circle with an…
Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust combinatorial optimization to date made the assumption that every…
A simple proof of Thue theorem on Circle Packing is given. The proof is only based on density analysis of Delaunay triangulation for the set of points that are centers of circles in a saturated circle configuration.
We prove that the half plane version of the uniform infinite planar triangulation (UIPT) is recurrent. The key ingredients of the proof are a construction of a new full plane extension of the half plane UIPT, based on a natural…
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…
We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…
Random packings of granular chains are presented as a model polymer system to investigate the contribution of entanglements to strain-stiffening in the absence of Brownian motion. The chain packings are sheared in triaxial compression…
We analyze the pattern forming ability and pattern stability for a one-dimensional non-linear transport-diffusion equation on the circle. We show that the trivial steady state is stable when diffusion is sufficiently strong. In the limit…
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…
We discuss counterexamples to the validity of the weak Maximum Principle for linear elliptic systems with zero and first order couplings and prove, through a suitable reduction to a nonlinear scalar equation, a quite general result showing…
The problem of packing unequal circles into a circular container stands as a classic and challenging optimization problem in computational geometry. This study introduces a suite of innovative and efficient methods to tackle this problem.…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
Nandakumar asked whether there is a tiling of the plane by pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker result is obtained: there is a tiling of the plane by pairwise non-congruent triangles of equal…