 |
|
|
|
 |
 |
 |
|
 |
|
 |
|
|
| 戴佐,袁俊良,查建中,郭伟.一种基于八叉树结构表达的三维实体布局启发式算法.软件学报,1995,6(10):629-636 |
| 一种基于八叉树结构表达的三维实体布局启发式算法 |
| AN OCTREE-BASED HEURISTIC ALGORITHM FOR THREE DIMENSIONAL PACKING |
| 投稿时间：1993-12-06 修订日期：1994-06-09 |
| DOI： |
| 中文关键词: 三维实体布局，八叉树，三环图，启发式算法 |
| 英文关键词:D-packing,octree,tri-ring,heuristic. |
| 基金项目:本文得到国家自然科学基金的资助. |
|
| 摘要点击次数: 3046 |
| 全文下载次数: 3138 |
| 中文摘要: |
| 本文在利用八叉树结构表达三维实体布局块及布局空间的基础上，根据八叉树同构节点匹配的思想设计了一个三维实体布局的启发式算法，并提出了三环图方法，解决了八叉树节点的同构识别问题．理论分析及计算的结果表明了该算法对于具有任意形状和大小的布局对象的三维布局问题来说效果理想． |
| 英文摘要: |
| 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. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
|
|
|
|
|
|
 |
|
|
|
|
 |
|
 |
|
 |
|
