CAJ | 학술논문

针对矩形布局求解问题,研究和分析矩形在布局空间中的可行域,提出一种以矩形可行域为依据的布局求解方法,其内容包括矩形可行域的确定、布局空间的分割和确定以及布局子空间的选择等算法.算例表明,该方法可以获得良好的布局方案,是一种行之有效的布局求解方法,具有广泛的实用性.
침대구형포국구해문제,연구화분석구형재포국공간중적가행역,제출일충이구형가행역위의거적포국구해방법,기내용포괄구형가행역적학정、포국공간적분할화학정이급포국자공간적선택등산법.산례표명,해방법가이획득량호적포국방안,시일충행지유효적포국구해방법,구유엄범적실용성.
Aming at rectangle packing problem,studies rectangle's feasible region in packing space,presents a packing algorithm based on rectangle's feasible region,its main contents include:rectangle's feasible region calculation,packing space division and determination,packing subspaces selection.A large number of examples indicate that the algorithm is an effective method approach to solve rectangle packing problem,which can produce optimal packing results and have wide applicability in engineering practice.