Questions tagged [packing-problem]

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

Packing is distinct from tiling in that the given shapes may have gaps between them; the goal is often to minimise the relative area of those gaps, or maximise the density. For example, the best packing of equal circles in the plane is $\pi/\sqrt{12}=0.907$, and that of equal spheres $\pi/(3\sqrt2)=0.740$ (the content of Hales's theorem). Packing within a bounded region poses very different challenges due to the boundaries and is an active research topic. is often paired with this tag.

494 questions
0
votes
1 answer

Circle packing problem

How did he calculate triangle packing in this site https://www.engineeringtoolbox.com/circles-within-rectangle-d_1905.html This site calculate number of circle in a square using 2 methods , normal method and triangle method, the question is how…
0
votes
1 answer

Packing 2x1x1 prisms into larger prisms

I'm currently having an issue where I need to pack 2x1x1 prisms into a larger prism of size 2x2x3. How many such ways is possible? What about for generic prisms of size 2x2xk? I've tried to figure out patterns or ways to order the different…
0
votes
1 answer

What is the minimum of squares to fit within rectangular box 10 x 16?

I'm trying to apply circle packing data to a 10 x 16 inch sheet for printing, here: http://hydra.nat.uni-magdeburg.de/packing/csq/csq.html#Applications And I want to achieve the least waste by figuring out if I can divide this 10x16 rectangle into…
0
votes
0 answers

How can I find the maximum number of different sized (given range) spheres fitting inside a cube?

I have spheres of diameter d1, d2, d3 and d4. I have a cube of dimension L. How can I find the numbers of different sized spheres to have a densest possible packing? I have looked below in this page but that is for uniform size (just one size…
Rafat
  • 11
  • 1
0
votes
0 answers

Sphere packing in a cuboid algorithm

Given a (3D) cuboid and an integer N, how can I position N spheres that fit inside without touching such that the radius of the spheres is maximised? Is there some group theory that I need to know, or are there "jiggling" algorithms that can…
Dijkstra
  • 163
0
votes
1 answer

Fitting smaller rectangles into bigger

I need to fit following rectangles into one big rectangle of N" * 72". Length * width - No of rectangles of this dimension 20" * 18" - 4 count. 12" * 12" - 6 count. 24" * 6" - 2 count. 20" * 8" - 2 count. 16" * 12" - 6 count. 8" * 10 " - 4…
N Jain
  • 1
0
votes
2 answers

Equilateral Triangle Packing Problem

Prove that an equilateral triangle allows for the greatest packing density when only packing one circle into a triangle. I have though of starting with the unit circle inscribed in an equilateral triangle, then using the ratio of the area of the…
0
votes
1 answer

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 either square or rectangular in shape. Visually it's…
Sam
  • 1
0
votes
1 answer

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 9. I'm no mathematician so although there's clearly…
Sašo
  • 101
0
votes
1 answer

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 I cannot find similar discussion on the…
Nighty
  • 2,152
1 2
3