摘要
分析了布局问题的特性，综合利用“爬山”策略思想和实体的八叉树操作语言，提出一种适合于三维实体布局的优化算法．实例表明，该算法能从任一初始布局方案快速收敛到一个局部最优的布局方案．此外。
According to the analysis of packing problems and with the help of operating language for object octree, this paper presents an anlytical algorithm for 3D packing problems. The algorithm uses the idea of hill climbing and can be convergeto a local optimal packing solution from an initial one quickly. The algorithm has been successfully applied to a 3D packing problem. Besides, the operating language for object octree rotation is studied and a related algorithm is set up.
出处
《天津大学学报》
EI
CAS
CSCD
1997年第2期193-198,共6页
Journal of Tianjin University(Science and Technology)
基金
国家教委高等学校博士学科点专项科研基金
