On Packing 2D Irregular Shapes

Authors:
Alexandros Bouganis;Murray Shanahan
Affiliations:
Department of Computing, Imperial College London, London SW7 2AZ, U.K., email: {alexandros.bouganis, m.shanahan}@imperial.ac.uk;Department of Computing, Imperial College London, London SW7 2AZ, U.K., email: {alexandros.bouganis, m.shanahan}@imperial.ac.uk
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 4
Cited 0

An Efficiently Computable Metric for Comparing Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer and Robot Vision

Computer and Robot Vision
A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem

Operations Research
Automated packing systems-a systems engineering approach

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

Designing and implementing an intelligent system that tackles the problem of placing two-dimensional shapes on a surface, such that no shapes overlap and the uncovered surface area is minimized, is highly important in industrial applications. However, it is also interesting from the scientific perspective, in terms of artificial intelligence, since autonomous systems developed up to now have found it difficult to compete with humans in this task. This paper presents a new algorithm which addresses the on-line packing of two-dimensional irregular shapes, and achieves high quality solutions in short computational times. The key point of this algorithm is the utilization of techniques drawn from computer vision and artificial intelligence.