Related papers: Circle Packing for Origami Design Is Hard
We analyze the problem of packing squares in an online fashion: Given a semi-infinite strip of width 1 and an unknown sequence of squares of side length in [0,1] that arrive from above, one at a time. The objective is to pack these items as…
How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and…
During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…
Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
Let $S_g$ denoting the genus $g$ closed orientable surface. An {\em origami} (or flat structure) on $S_g$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom…
The tangram and Sei Shonagon Chie no Ita are popular dissection puzzles consisting of seven pieces. Each puzzle can be formed by identifying edges from sixteen identical right isosceles triangles. It is known that the tangram can form 13…
We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…
Folding a sheet of paper along a curve can lead to structures seen in decorative art and utilitarian packing boxes. Here we present a theory for the simplest such structure: an annular circular strip that is folded along a central circular…
Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together with the result $s(6)=3$ by Keaney and Shiu, these results…
Rigid foldability allows an origami pattern to fold about crease lines without twisting or stretching component panels. It enables folding of rigid materials, facilitating the design of foldable structures. Recent study shows that rigid…
In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as…
This is the fifth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
A translation surface is a surface formed by identifying edges of a collection of polygons in the complex plane that are parallel and of equal length using only translations. We determined that the same circle packing can be realized on…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
"Flat origami" refers to the folding of flat, zero-curvature paper such that the finished object lies in a plane. Mathematically, flat origami consists of a continuous, piecewise isometric map $f:P\subseteq\mathbb{R}^2\to\mathbb{R}^2$ along…
Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so…