%0 Journal Article
%T AN OCTREE-BASED HEURISTIC ALGORITHM FOR THREE DIMENSIONAL PACKING<br>一种基于八叉树结构表达的三维实体布局启发式算法
%A Dai Zuo
%A Yuan Junliang
%A Cha Jianzhong
%A Guo Wei
%A <br>戴佐
%A 袁俊良
%A 查建中
%A 郭伟
%J 软件学报
%D 1995
%I 
%X On the basis of representing the packing components and space with a new type of octree data structure,this paper presents an effective heuristic method for arbitrary shaped 3D-packing problems. By forming the octrees of packing space and packing objects in the same octree family, the octree of each object can be looked as a node of octree of packing space in certain level,and a series of heuristic rules are used to find a"best fitnode" for each object octree in space octree.Finally,a hypothesis example with 8 arbitrary shaped objects is given and the calculation process is described in detail,and the obtained result is very promising.
%K D-packing
%K octree
%K tri-ring
%K heuristic<br>三维实体布局，八叉树，三环图，启发式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=FDD0DADEF92BF146B3A0D71CBD81CC09&yid=BBCD5003575B2B5F&vid=B31275AF3241DB2D&iid=F3090AE9B60B7ED1&sid=E4EC39E73004B593&eid=9BF3B0483F192149&journal_id=1000-9825&journal_name=软件学报&referenced_num=21&reference_num=4