Challenging mathematical problems with elementary solutions
Challenging mathematical problems with elementary solutions
A time-and space-optimal algorithm for Boolean mask operations for orthogonal polygons
Computer Vision, Graphics, and Image Processing
A genetic algorithm for a 2D industrial packing problem
Computers and Industrial Engineering
Advanced 3-D Game Programming Using Directx 8.0
Advanced 3-D Game Programming Using Directx 8.0
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Orthogonal Polyhedra: Representation and Computation
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
The Three-Dimensional Bin Packing Problem
Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Heuristic approaches for the two- and three-dimensional knapsack packing problem
Computers and Operations Research
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
INFORMS Journal on Computing
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems
Engineering Applications of Artificial Intelligence
Evolving reusable 3d packing heuristics with genetic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
INFORMS Journal on Computing
A review of optimization techniques in metal cutting processes
Computers and Industrial Engineering
An efficient placement heuristic for three-dimensional rectangular packing
Computers and Operations Research
A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
| Hi-index | 0.00 |
This paper presents an abstract data type (ADT) for producing higher-dimensional rectilinear packings using constructive methods, the Skyline ADT. Furthermore, a novel method and several approaches from the literature are presented in the form of concrete implementations of the presented ADT. Formal definitions of two three-dimensional packing problems are given, the concept of gaps is explained, and the polynomial growth worst-case behaviour of gaps is shown. The complexity of both the best-fit algorithm and implementations of the ADT are presented, and comparative runtime speeds are analysed over a range of data sets from the literature.