首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Data set generation for rectangular placement problems
Institution:1. Department of Computer Science MS 4A5, George Mason University, Fairfax, VA 22030-4444, USA;2. Department of Computer Science, Cardiff University, P.O. Box 916, Cardiff CF24 3XF, UK;1. College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai 200234, China;2. Department of Electrical and Computer Engineering, State University of New York at Stony Brook, Stony Brook, NY 11790, United States;3. College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing 314001, China;4. Department of Computer Science and Engineering, Shaoxing University, Shaoxing 312000, China;1. Department of Theatre, Film and TV, University of York, UK;2. Stockholm Environment Institute (SEI), UK;3. Institut de Recherche et Coordination Acoustique/Musique (IRCAM), Paris;1. Department of Computer Science, Manipur University, Canchipur 795003, India;2. Department of Computer Science, South East Manipur College, Komlathabi 795135, India
Abstract:This paper describes a recursive process for generating data sets of rigid rectangles that can be placed into rectangular regions with zero waste. The generation procedure can be modified to guarantee that the aspect and area ratios of the rectangles in the generated data sets satisfy user-specified parameters. This recursive process can thus be employed to create a variety of data sets that can be used to evaluate the efficiency and scalability of rectangular cutting and packing algorithms.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号