|Libraries||Shapely, generateDS, Tkinter, matplotlib|
|AI fields||Graph search, Constrained search, 2D geometry, Collision detection|
|Production time||2 years|
|Role||Algorithm design, Programming|
This packing application places a set of 2D polygonal shapes into a rectangular container which is made as small as possible for a given computation time.
- Input: a set of polygonal pieces (wooden puzzle, cloth patterns, metal, etc.)
- Output: a list of translations and rotations for each piece + the size of the final rectangular container, where the container size has been minimized
- Real-world application: sprite packing in games, cutting patterns in cloth, etc.
This program was developed as part of my research on Irregular Packing for my Master of Science in Artificial Intelligence at Keio University, Hagiwara Laboratory.
- NestingXML data set on the ESICUP website for various set of pieces in XML to use in benchmarks