基于空间分割的求解布局几何可行域的算法  

An algorithm for solving geometrical feasible region of packing based on space partition

作　　者：朱丽苹[1] 王金敏[1] 

机构地区：[1]天津职业技术师范大学机械工程学院,天津300222

出　　处：《天津职业技术师范大学学报》2012年第2期30-33,共4页Journal of Tianjin University of Technology and Education

基　　金：国家自然科学基金资助项目(60975046)

摘　　要：通过研究空间布局问题,提出了一种基于空间分割的求解可行域的算法。布局物体的可行域与布局物体本身密切相关,通过缩小的布局空间和所有扩张后的已布入的布局物体进行减运算,即可获得待布物体的可行域。分析和实例表明:该算法简单有效,有着较强的应用前景。For three-dimensional packing problem, the paper presents a new algorithm based on space division. The feasible region of packing items is closely related to packing items themselves. Through the subtraction between narrowed packing space and all of the expended packing items which have been packed into the layout space, the feasible region can be obtained. Analysis and examples prove that this algorithm is simple and efficient and it has wide application in practice.

关 键 词：布局空间 布局物体 减运算 可行域 

分 类 号：O18[理学—数学]