Related papers: Square packing with $O(x^{0.6})$ wasted area
For a set of n points in the plane, we consider the axis--aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this paper, we consider the boxes to be either squares or…
This is a follow up on our previous work in which we have presented a modified, simpler version of the remarkable recent result of Christodoulou on the formation of trapped surfaces. In this paper we prove two related results. First we…
In the planar range skyline reporting problem, we store a set P of n 2D points in a structure such that, given a query rectangle Q = [a_1, a_2] x [b_1, b_2], the maxima (a.k.a. skyline) of P \cap Q can be reported efficiently. The query is…
We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits…
I develop a transfer matrix algorithm for computing the exact partition function of a square lattice polymer with nearest-neighbor interaction, by extending a previous algorithm for computing the total number of self-avoiding walks. The…
We calculate a projective space of essential measured laminations in a surface pair, which will be used in another paper to help describe spaces of "finite height laminations."
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
In this paper, we give a faster width-dependent algorithm for mixed packing-covering LPs. Mixed packing-covering LPs are fundamental to combinatorial optimization in computer science and operations research. Our algorithm finds a $1+\eps$…
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by…
The most widely used algorithm for floating point complex division, known as Smith's method, may fail more often than expected. This document presents two improved complex division algorithms. We present a proof of the robustness of the…
We show that geometric confinement dramatically affects the shear-induced configurations of dense mono-disperse colloidal suspensions; a new structure emerges, where layers of particles buckle to stack in a more efficient packing. The…
The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an…
We give a new example of Euclidean tight 6-design in $\mathbb R^{22}$.
A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give…
We prove that one can cover the $1 \times b$ rectangle by equal squares on both sides in one layer iff $b = p \pm \sqrt{p^2 - r^2} $, where $p \ge r \ge 0$ and $p,q \in \mathbb{Q}$.
We present a new algorithm having a time complexity of O(N log N) and designed to retrieve the phase at which an input signal and a set of not necessarily orthogonal templates match best in a weighted chi-squared sense. The proposed…
This paper proposes a new approach to construct high quality space-filling sample designs. First, we propose a novel technique to quantify the space-filling property and optimally trade-off uniformity and randomness in sample designs in…
In previous work, the authors introduced "soft" methods to prove the effective (i.e. with power savings error) equidistribution of "shears" in cusped hyperbolic surfaces. In this paper, we study the same problem but now allow full use of…
Packings of equal disks in the plane are known to have density at most $\pi/\sqrt{12}$, although this density is never achieved in the square torus, which is what we call the plane modulo the square lattice. We find packings of disks in a…
We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by…