⚡ Box Packing is Hard - Keegan R

Published on ● Video Link: https://www.youtube.com/watch?v=E9WCI_kkO6k



Duration: 17:48
3,177 views
143


A seemingly simple talk about trying to put boxes in boxes. What could go wrong?

No prizes for guessing, but quite a lot actually. We'll explore what assumptions we can make to simplify this box packing problem, explore algorithms that might (or might not) help, and see if we can find any reasonable guarantee depending on the dimension.

Challenge:
Can you find an equation, or algorithm, for determining the maximum number of boxes that can be packed using the strategy mentioned at 12:34 ? The more efficient your time complexity, the better!

Further Reading:
https://en.wikipedia.org/wiki/Square_packing_in_a_square
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r126/pdf

Talk by Keegan R

00:00 - Introduction
01:07 - Motivation
03:37 - How do we even solve this?
07:04 - What about 2D?
09:26 - Oh Dear
13:19 - The Third Dimension
16:15 - Final Attempt







Tags:
computing
uwcs
university
society
coding
programming
discrete maths
mathematics
discrete
bin packing
shape fitting
containers
NP
NP-Complete
NP-Hard
algorithms
maths
problem-solving
lightning talk
computing society
talk
optimisation
box packing
square packing
packing problems
computer science
trigonometry
logistic problem
box packing problem
square packing problem
shape packing
geometry
computationally hard