| 基于最小生成树的R~*-树结点分裂算法 |
| |
| 引用本文： | 孙殿柱,孙永伟,康新才,史阳.基于最小生成树的R~*-树结点分裂算法[J].西安交通大学学报,2011,45(5):127-130. |
| |
| 作者姓名： | 孙殿柱 孙永伟 康新才 史阳 |
| |
| 作者单位： | 山东理工大学机械工程学院,255049,山东淄博 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 针对R*-树应用到逆向工程领域时遇到的适用性差等问题,提出了一种新的R*-树结点分裂算法.该算法将R*-树索引结点表示为轴向包围盒,依据轴向包围盒外接球间的重叠度计算结点相似度,并将其作为权值构建结点无向连通图,用来求解结点无向连通图的最小生成树.沿最大权值边将最小生成树分裂为2棵子树,并基于结点外接球体积对R*-树结构进行优化,从而实现了R*-树结点分裂.实例表明,R*-树结点分裂算法可处理各种复杂数据的结点分裂问题,能够有效地提高R*-树的构建效率及空间数据的查询效率.
|
| 关 键 词： | 逆向工程 R*-树 轴向包围盒 结点相似度 最小生成树 |
Node Splitting Algorithm of R*-Tree Based on Minimum Spanning Tree |
| |
| SUN Dianzhu,SUN Yongwei,KANG Xincai,SHI Yang.Node Splitting Algorithm of R*-Tree Based on Minimum Spanning Tree[J].Journal of Xi'an Jiaotong University,2011,45(5):127-130. |
| |
| Authors: | SUN Dianzhu SUN Yongwei KANG Xincai SHI Yang |
| |
| Institution: | SUN Dianzhu,SUN Yongwei,KANG Xincai,SHI Yang(School of Mechanical Engineering,Shandong University of Technology,Zibo,Shandong 255049,China) |
| |
| Abstract: | Aiming at the problems of R*-tree for reverse engineering of weak application,a new node splitting algorithm of R*-tree is proposed.The nodes of R*-tree are all expressed as their minimum bounding boxes.Then,the node comparability value is weighed with circum-sphere of the minimum bounding boxes.The minimum spanning tree is constructed based on the connected undirected graph of node comparability value,and the minimum spanning tree is divided into two sub-trees on the edge of the maximum weight,which gets e... |
| |
| Keywords: | reverse engineering R*-tree minimum bounding box node comparability value minimum spanning tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
