Bin packing places a given set of polygons in standard single/multiple rectangular sheet(s), to minimize the use of the sheet(s).
-
Updated
Feb 8, 2023 - Java
Bin packing places a given set of polygons in standard single/multiple rectangular sheet(s), to minimize the use of the sheet(s).
Visualization of the algorithms needed to solve three-dimensional knapsack problems.
Square Packing As Algorithmic Art
A fully functional application that helps putting blocks of different sizes and dimensions in a container
Knapsack3D is a visual and algorithmic tool that solves a 3D knapsack-filling problem using both Cuboids and Pentominoes. The aim is to optimize how space is filled within a 3D volume based on different goals, either maximizing space usage or score.
Circle Packer is a versatile Java-based application designed to optimize the placement of various packable objects within a rectangular area.
Add a description, image, and links to the packing-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the packing-algorithm topic, visit your repo's landing page and select "manage topics."