By Topic

DTS: A Tree Based Representation for 3D-Block Packing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Fujiyoshi, K. ; Tokyo Univ. of Agric. & Technol. ; Kawai, H. ; Ishihara, K.

3D packing problem is to arrange rectangular boxes (blocks) of given sizes in a rectangular box of the minimum volume without overlapping each other. As a representation for 3D packings, this paper proposes a novel encoding method, called DTS (double tree and sequence). The feature of the DTS is: (1) It can represent any minimal packings. (2) The size of the solution space (the number of codes) of DTS is much smaller than any conventional representation which can represent any packings. Experimental comparisons with conventional representations indicate the superiority of the proposed representation DTS

Published in:

Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on

Date of Conference:

27-30 May 2007