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

一种基于八叉树结构表达的三维实体布局启发式算法
引用本文:戴佐,袁俊良,查建中,郭伟.一种基于八叉树结构表达的三维实体布局启发式算法[J].软件学报,1995,6(10):629-636.
作者姓名:戴佐  袁俊良  查建中  郭伟
作者单位:天津大学机械系智能工程研究室,天津,300072;天津大学机械系智能工程研究室,天津,300072;天津大学机械系智能工程研究室,天津,300072;天津大学机械系智能工程研究室,天津,300072
基金项目:本文得到国家自然科学基金的资助.
摘    要:本文在利用八叉树结构表达三维实体布局块及布局空间的基础上,根据八叉树同构节点匹配的思想设计了一个三维实体布局的启发式算法,并提出了三环图方法,解决了八叉树节点的同构识别问题.理论分析及计算的结果表明了该算法对于具有任意形状和大小的布局对象的三维布局问题来说效果理想.

关 键 词:三维实体布局,八叉树,三环图,启发式算法
收稿时间:1993/12/6 0:00:00
修稿时间:6/9/1994 12:00:00 AM

AN OCTREE-BASED HEURISTIC ALGORITHM FOR THREE DIMENSIONAL PACKING
Dai Zuo,Yuan Junliang,Cha Jianzhong and Guo Wei.AN OCTREE-BASED HEURISTIC ALGORITHM FOR THREE DIMENSIONAL PACKING[J].Journal of Software,1995,6(10):629-636.
Authors:Dai Zuo  Yuan Junliang  Cha Jianzhong and Guo Wei
Abstract: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.
Keywords:D-packing  octree  tri-ring  heuristic  
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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