相关论文: Compactness Theorems for Geometric Packings
In this note we begin a systematic study of compact conformal manifolds of SCFTs in four dimensions (our notion of compactness is with respect to the topology induced by the Zamolodchikov metric). Supersymmetry guarantees that such…
Roundness of metric spaces was introduced by Per Enflo as a tool to study uniform structures of linear topological spaces. The present paper investigates geometric and topological properties detected by the roundness of general metric…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…
Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…
We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…
We consider immersions admitting uniform representations as an L-Lipschitz graph. In codimension 1, we show compactness for such immersions for arbitrary fixed finite L and uniformly bounded volume. The same result is shown in arbitrary…
This article is a comprised version of my doctoral thesis defended at Basel University in 1995. It concerns circle packings on compact surfaces of any genus.
The conformal compactification is considered in a hierarchy of hypercomplex projective spaces with relevance in physics including Minkowski and Anti-de Sitter space. The geometries are expressed in terms of bicomplex Vahlen matrices and…
Three themes of general topology: quotient spaces; absolute retracts; and inverse limits - are reapproached here in the setting of metrizable uniform spaces, with an eye to applications in geometric and algebraic topology. The results…
We study the problem of partitioning the unit cube $[0,1]^n$ into $c$ parts so that each $d$-dimensional axis-parallel projection has small volume. This natural combinatorial/geometric question was first studied by Kopparty and Nagargoje…
We prove a compactness theorem for metrics with Bounded Integral Curvature on a fixed closed surface $\Sigma$. As a corollary, we obtain a compactification of the space of Riemannian metrics with conical singularities, where an accumulation…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
We consider rigidity properties of compact symmetric spaces $X$ with metric $g_0$ of rank one. Suppose $g$ is another Riemannian metric on $X$ with sectional curvature $\kappa$ bounded by $0 \leq \kappa \leq 1$. If $g$ equals $g_0$ outside…
We investigate the problem of computing a minimal-volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions of the problem are NP-hard so that we cannot expect to find…
The three dimensional structure of large packings of monosized spheres with volume fractions ranging between 0.58 and 0.64 has been studied with X-ray Computed Tomography. We search for signatures of organization, we classify local…
We show that any convex region which contains a unit segment, an equilateral triangle of sides 1/2, and a square of side 1/3 always has area at least 0.227498. Using grid-search algorithm, we attempt to find a configuration of these three…
We study the Generalized Multiple Strip Packing Problem (GMSPP) with heterogeneous per-unit-area costs, in which rectangular items of fixed dimensions must be packed without overlap into multiple open-ended strips of different widths, each…
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…
A rectangular floorplan is a partition of a rectangle into smaller rectangles such that no four rectangles meet at a single point. Rectangular floorplans arise naturally in a variety of applications, including VLSI design, architectural…