Computer tool for maximizing the placement of congruent polyhedra
Given multiple identical polyhedral objects and a parallelepiped container, how should one place the objects so that the largest number fits inside the container? This simple question is important in many applications, yet the answer is elusive. In fact, we know of no published solution for this ver...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2015
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.8/1419 |
| País: | Portugal |
| Oai: | oai:iconline.ipleiria.pt:10400.8/1419 |