0

How to find expected number of items (3D irregular shape) fit in one Box (Bulk Packing)?

Look into below image example

1

Each items have same dimension. I am looking for simple algo for this problem.

vimuth
  • 5,064
  • 33
  • 79
  • 116
chessmaster
  • 1
  • 2

1 Answers1

0

the obvious (and far from precise) limits are:

max = volume(bin) / volume(object)
min = volume(bin) / volume(OBB(object))

however the real number will be somewhere between the two. You could apply bin packing algorithms on your bin and objects however that would probably take too much time so instead I would use packing coefficient k so the computation time is not too big:

n = k*volume(bin) / volume(OBB(object))

Where k can be obtained on some "small" bin volume (while its dimensions are a multiple of object OBB) using any bin packing algorithm or simply measure it.

Spektre
  • 49,595
  • 11
  • 110
  • 380
  • What is OBB? As per my knowledge, bin packing algo is only for 3d rectangular items. – chessmaster Aug 30 '22 at 10:33
  • @chessmaster [OBB is Oriented Bounding Box](https://stackoverflow.com/a/62284464/2521214). No expert on the matter but Yes analytical Bin packing algorithms are for regular shapes or BBOX es however there are also stochastic (randomized position using RANSAC using gready approach) and [field simulation based approaches](https://stackoverflow.com/a/42970086/2521214) (where you use gravity or charge based physics to pack into smallest possible volume) both can be combined ... – Spektre Aug 30 '22 at 13:49