Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
