Related papers: Partitioning Regular Polygons into Circular Pieces…

The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…

Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…

In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…

Motivated by map labeling, Funke, Krumpe, and Storandt [IWOCA 2016] introduced the following problem: we are given a sequence of $n$ disks in the plane. Initially, all disks have radius $0$, and they grow at constant, but possibly…

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…

We consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Our rectangle packer chooses the x-coordinates of all the rectangles before any of the y-coordinates. We…

Using a calculus of variations approach, we determine the shape of a typical plane partition in a large box (i.e., a plane partition chosen at random according to the uniform distribution on all plane partitions whose solid Young diagrams…

T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is greater than 4. We also answer the analogous question for regular…

We investigate the optimal selection of weight windows for the problem of weighted least squares. We show that weight windows should be symmetric around its center, which is also its peak. We consider the class of tapered rectangle window…

Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its…

Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…

While rectangular and box-shaped objects dominate the classic discourse of theoretic investigations, a fascinating frontier lies in packing more complex shapes. Given recent insights that convex polygons do not allow for constant…

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

We present a new, simple, fast algorithm to numerically evolve disks of inelastically colliding particles surrounding a central star. Our algorithm adds negligible computational cost to the fastest existing collisionless N-body codes, and…

A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…

In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…

We have recently devised organizing principles to obtain maximally dense packings of the Platonic and Archimedean solids, and certain smoothly-shaped convex nonspherical particles [Torquato and Jiao, Phys. Rev. E 81, 041310 (2010)]. Here we…

We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number of convex faces, such that no point of P is contained in the…