Questions on the packing of various (two- or three-dimensional) geometric objects.

learn more… | top users | synonyms

2
votes
1answer
47 views

Quarter Circle packing

Just today, I was making tortilla chips, and I began to wonder, what is the most efficient way to pack circular quarters onto the plane? This sort of circle packing is most efficient for circles, ...
1
vote
1answer
31 views

Packing Problem in cuboids

I can't seem to comment on this question Packing problem cube and cuboids but it is related. I just want to know what is the specific method used in the answer so I can try to replicate it for my own ...
2
votes
0answers
37 views

How far can the plane be tiled by congruent regular pentagons?

What is the limit, as the radius of the disk increases, of the greatest area, in proportion to the area of the disk, of the region covered by regular pentagons of the same fixed size, all lying within ...
5
votes
0answers
75 views

Stacking circles

When I tried to stack 21 circles of radii $(30, 31, 32... 50)$ on top of each other in a tube (ID of $100$ wide), I thought they would reach the same height regardless of the order, however I was ...
9
votes
1answer
152 views

smallest square containing sectors of disc

This question occurred to me a while ago when taking leftover slices of a pizza to go. Suppose you have a unit-radius circular disc divided into $n$ equal sectors ("slices"). What is the smallest ...
2
votes
1answer
43 views

Find radius such that packing circles into a fixed rectangle maximises total area of circles

I want to pack equal-sized circles into a rectangle with width $w$, and height $h$. The total area of all of the circles should be maximised. the radius of each circle can vary, but is contrained; ...
0
votes
0answers
7 views

How many points are needed to fill a hypercube “r-dense”

Let $Q=[0,1]^d$. For $P\subset Q$, consider the Haussdorf-distance $d(P,Q):=\sup_{x\in Q}\inf_{p\in P}\|x-p\|$. Let $A_d(r)=\min\{|P|: d(P,Q)\leq r\}$. Considering grids shows that $A_d(r)\leq ...
3
votes
1answer
51 views

Circle Packing in an Elastic Container

A (somewhat) common problem in geometry and optimization deals with how to most efficiently pack $n$ rigid disks inside a given container of some fixed size and shape (e.g. a circular container, a ...
2
votes
1answer
69 views

Algorithm for optimizing placement of unequal circles in a given rectangular area

I am working on a project, in which I have to optimize the placement of N unequal circles in a given rectangular area, such that if these circles are considered as a sensor field, I can possibly ...
1
vote
1answer
45 views

Smallest-circle problem, but with circles instead of points?

I have a growing set of circles (and locations for those circles), each step I add one. I also need the smallest circle that contains all of the circles in my set. I found the wikipedia page about the ...
1
vote
2answers
33 views

Calculating the maximum number of vertices in a packing problem

I want to pack x number of pipes into a circle in two different formations; firstly in square formation, secondly in triangular formation. It seemed obvious to reduce this to a packing problem, ...
1
vote
0answers
36 views

Covering unit square

Now, I am reading this topic http://mathoverflow.net/questions/34145/can-we-cover-the-unit-square-by-these-rectangles. And do some research on it. Guys, who had written in topics, have said, that they ...
11
votes
1answer
3k views

Fractional oblongs in unit square via the Paulhus packing technique

Oblongs of size $ \frac{1}{1} \times \frac{1}{2}$, $ \frac{1}{2} \times \frac{1}{3}$, $ \frac{1}{3} \times \frac{1}{4}$, $ \frac{1}{4} \times \frac{1}{5}$, ... have a total area of 1. ...
2
votes
1answer
33 views

Integral Apollonian circle packing with unique curvatures

I was wondering if it is possible to construct an Apollonian gasket where every circle has a unique integer curvature. Take for instance the following gasket, defined by curvatures (−10, 18, 23, 27): ...
10
votes
1answer
92 views

Stacking circles with $r=\frac{1}{p}$ inside a circle with $r = 1$

Let's start with a circle with radius $1$. Now suppose we would continuously insert circles from above with radii $\frac{1}{p}$ (first a circle with $r = \frac{1}{2}$, then a circle with $r = ...
3
votes
3answers
161 views

What is the smallest square into which one can pack a trisected disc?

In his accepted answer to this question, David Bevan improved my answer to show that a unit disc can be cut into three sectors which fit into a square of side $2-\varepsilon$, where ...
2
votes
1answer
47 views

Circular biscuits in a circular pan.

This question comes from a discussion with my wife about the more efficient way for cooking biscuits. Here the problem: We have a circular pan with a diameter of $30 cm$ and we have two round stamps ...
2
votes
1answer
60 views

Method for optimally packing a group of squares from (1 x 1) to (n x n) into a larger square?

As far as my investigation has gone, I can see that people have worked on the optimal way to pack incrementally larger squares into rectangles (page 2, .pdf), as well as the optimal ways to pack equal ...
0
votes
0answers
39 views

k'th best solution or Top k solutions to the 1-0 knapsack problem via dynamic programming

How do I find the k'th best solution to the 1-0 knapsack problem via the modification of the standard dynamic programming algorithm? LP solution will also be interesting. Thanks, Vladimir
8
votes
1answer
161 views

The smallest 8 cubes to cover a regular tetrahedron

A regular tetrahedron $T$ of edge-length $\sqrt{2}$ fits inside a unit cube:                     (Image from MathWorld.) This means that $8$ ...
1
vote
1answer
92 views

Maximum no. of laddoos of diameter $6$cm in a box of given dimension

What is the maximum number of laddoos having diameter of $6\text{ cm}$ that can be packed in a box whose inner dimensions are $24\times 18\times 17\text{ cm$^3$}$. I found that at the lower label ...
5
votes
1answer
119 views

Arranging circles around a circle

$N$ circles are given by their radii: $r_1$, $r_2$,..., $r_N$. They are arranged around another circle so that they pack, like in this picture (order of $N$ circles should be preserved): What is ...
2
votes
0answers
68 views

packing problem of semicircles into rectangle

I have problem. How can I get the maximum amount of semicircles (for example radius $35\;mm$) into rectangle $(485\times 185\:mm)$. I found many articles about packing of circles but nothing about ...
2
votes
1answer
79 views

Packing of discrete random variables with finite second moment

I am considering a discrete random variable $X \in\mathbb{R}$ with $N$ points (where each point has non-zero probability) and $E[X^2]=1$ and $E[X]=0$. Let $d_l$ be the the smallest distance between ...
2
votes
0answers
75 views

For what hexagon size can I pack $n$ hexagons into a rectangle of $s$ area?

I have a fixed number of identical regular hexagons I use to build a honeycomb looking grid of hexagons. I have a rectangular container of known dimensions. My job is to figure out how big the ...
4
votes
0answers
44 views

Shaking a box of rocks (Optimal Packing)

My coworker was telling me that when he plants seeds on his farm, he puts them all in a large container on the tractor and after a period of just driving, the seeds are more densely packed than when ...
0
votes
0answers
20 views

Sorting Bigger Boxes to Smaller Boxes

I am currently working on a Bin Packing program and need to know what would be the most efficient way of getting boxes (arbitrary width, length, and height) to be sorted in the manner below? ...
5
votes
1answer
116 views

An algorithm for filling a moving truck

I was recently helping a friend move. I stood in the moving truck as other people brought boxes and furniture pieces from inside the house. My job was to arrange these items in an efficient way inside ...
1
vote
1answer
27 views

Is optimal bound for Alcuin's triangular city problem known?

Alcuin's triangular city problem is Problem 28 from Propositiones ad Acuendos Juvenes. There is a triangular city which has one side of 100 feet, another side of 100 feet, and a third of 90 ...
1
vote
1answer
147 views

How many rectangles or squares of (fixed and equal sizes) can fit inside a square of fixed size 320 x 320 ?

Our factory creates graphite sheets. Their machine can only create sheet of one fixed size which is 320 x 320 mm (0.1240 sqm.). Clients come to us with requests for different sheet sizes, all ...
2
votes
1answer
64 views

About the squares in square packing problem with 11 squares

In this web site there are the solutions of a lot of packing squares problems. I know a very simple method to calculate with pen and paper the solution for the ten squares in a square using the same ...
0
votes
1answer
30 views

How many polygons can be packed into a larger polygon?

Let's say I have a polygon and a set of smaller polygons. The question asks "how many of the smaller polygons can be fit into the larger polygon without any overlaps?". Obviously this is a very hard ...
0
votes
0answers
13 views

How to estimate a valid lower bound for this generalized bin packing problem

Given m bins, each has a capacity of capj, and its cost is defined as cj,low+(cj,high-cj,low)*urj, where, urj is the utilization ratio of the bin (of course, the cost is zero when the utilization ...
6
votes
2answers
799 views

Hexagon packing in a circle

Suppose I want to pack hexagons in a circle, as on the drawing below (red indicates "packed" hexagons). I am wondering what is known about this problem. Specifically, I am interested in an ...
1
vote
0answers
35 views

Finding optimal height for objects in 2D packing

I have a problem that I need to find the right algorithm for and I am not sure which avenues are going to be easiest. I have a 'row' of fixed height and we can assume infinite length. fig.1 ...
3
votes
1answer
85 views

What is the maximum number of $15 cm\times 15 cm$-square I can cut from a diameter $50 cm$- circle?

What is the maximum number of $15 cm\times 15 cm$-square I can cut from a diameter $50 cm$- circle?(this square miss angle is ok, only such this square area not than $\frac{1}{5}$ out the ...
3
votes
1answer
38 views

Prove that cube cannot be partitioned into $n>1$ smaller distinct cubes.

Prove that cube cannot be partitioned into $n>1$ cubes, such that each of them has different side length. I believe tallhis is not hard problem, but I just do not have an idea how to start. I ...
2
votes
2answers
46 views

Can there exist $3$, $4$ and $5$-faceted shapes with congruent flat sides in $\mathbb{R}^3$?

I rose this question in my discrete math class (the unit on probability) not too long ago. For instance, a two-sided shape (like a coin) can be one with any geometrical shape as its "side," such as a ...
0
votes
1answer
63 views

Packing custom length squares into a rectangle with a custom ratio

In the image there are 2 rectangles: first with a ratio of 1:2.5 and the second with a ratio 0.65:1. Trying to pack biggest squares possible, in the first example 4 can be packed and in the second ...
6
votes
1answer
147 views

What is the equation to evenly distribute circles in a spiral?

What is the equation to evenly distribute circles in a spiral? I have attached a picture to show what I am trying to achieve and need to know what the equation is for this.
0
votes
0answers
19 views

Lattices, compact orbits, and admissible boxes

A box in $\mathbb{R}^n$ is a set of the form $[-b_1,b_1]\times \cdots \times [-b_n,b_n]$ with $b_i>0$ for all $i$. For any unimodular lattice $\Lambda$ define ...
5
votes
3answers
337 views

Finding the area of the 4th triangle, given the areas of the other 3, and all the 4 form a rectangle

In one of my tutorial classes, when I was studdying in 9th class (I am in 10th now), our tutor gave us a problem saying it’s a difficult one, and to him, it was incomplete. This is that problem: ...
34
votes
2answers
2k views

Why can't three unit regular triangles cover a unit square?

A square with edge length $1$ has area $1$. An equilateral triangle with edge length $1$ has area $\sqrt{3}/4 \approx 0.433$. So three such triangles have area $\approx 1.3$, but it requires four ...
1
vote
0answers
34 views

Packing Problem

Hey I'm trying to solve a problem of figuring out how many rectangles of a certain size would fit within a triangle and a trapezium, is there a formula that can be used for this? Say I had a ...
0
votes
0answers
122 views

Bin packing 3D / container loading problem : algorithm with “real” constraints handling

I search a bin packing 3D (or container loading) algorithm (for truck load) with handle of many differents constraints (for each item : stackability, possibles orientations, multi customers, max ...
0
votes
0answers
29 views

Formulating and solving box unloading as graph problem

I have a set of boxes as those pictured below. I can only remove boxes that dosen't have any boxes on top of it. In every "move" I can move any box that is currently available, but I have limitations ...
2
votes
1answer
45 views

What is the side length of the smallest square containing $n$ dominoes with short side lengths $1,2,\dots,n$?

Erich Friedman has collected solutions and notes: All of these are probably optimal, except for possibly n=20. But by adding the domino areas, one gets: $$A=\frac{20(20+1)(2\cdot20+1)}3=5740$$ ...
2
votes
1answer
51 views

What does it mean by saying that a number is 'asymptotic to ' another number?

The following comes from the book The Geometry of Numbers by C.D. Olds, Anneli Lax and Giuliana Davidoff. After the discussion of the geometry of numbers, its application, lattice-point packing is ...
1
vote
0answers
62 views

population of dots with normal distribution of pitch

I want to generate a plot that shows a rectangle populated with dots, where the dot-to-dot distance (pitch) distribution is a lognormal (or a gaussian). I want to be able to change the mean dot-to-dot ...
0
votes
1answer
49 views

Packing Problem - What do these notations mean?

I am reading 'Finite Packing and Covering' and I find some notations on the first few pages that are not defined in the book. I am guessing those are standard in the discussion of packing problems. As ...