spawn small rectangles into a larger rectangle
-
Updated
Jan 19, 2021 - JavaScript
spawn small rectangles into a larger rectangle
This project analyzes various gate packing algorithms, focusing on the Tetris-based algorithm. It achieves superior space optimization compared to more complex methods like the Sleator algorithm, in spite of its simple implementation. The project features visualizations and performance comparisons across multiple test cases.
An application of constraint programming and satisfiability modulo theories to the NP-complete problem known as optimal rectangle packing
PerfectPacking.jl - Different exhaustive algorithms for perfect rectangle packing implemented in Julia
Book Content Compressor API
Rectangle packing library in C++
Rectangle packing algorithm in Prolog and ASP
Combinatiorial Optimization applied to the rectangle packing problem, using Minizinc and Z3 solvers
Pack multiple images of different sizes or formats into one image.
Monte Carlo Tree Search on Perfect Rectangle Packing Problem Instances
Tiny yet powerful utility for packaging multiple images to new one with custom aspect ratio and size.
benchmark solutions for selected packing problems: circle, rectangle, cube, cuboid, polygon packings
📦 greedy rectangle packing algorithm
A solver to find a solution of the 2D rectangle packing problem by simulated annealing (SA) optimization.
A solver for (geometrical) packing problems
A lightweight memory allocator for hardware-accelerated machine learning
2D irregular bin packaging and nesting library written in modern C++
Add a description, image, and links to the rectangle-packing topic page so that developers can more easily learn about it.
To associate your repository with the rectangle-packing topic, visit your repo's landing page and select "manage topics."