|
|||||
|
|
| 基于最优三角剖分的矿区GIS索引裁剪算法 | |
| 引用本文： | 杜晓昕,王波,孙明,王淼.基于最优三角剖分的矿区GIS索引裁剪算法[J].科技通报,2012,28(5):94-98. |
| 作者姓名： | 杜晓昕 王波 孙明 王淼 |
| 作者单位： | 1. 齐齐哈尔大学计算机与控制工程学院,齐齐哈尔,161006 2. 齐齐哈尔大学教育与传媒学院,齐齐哈尔,161006 3. 河南工程学院计算机科学与工程系,郑州,450001 |
| 基金项目： | 国家自然科学基金资助项目，河南省科技科技攻关(重点项目)，齐齐哈尔大学青年教师科研启动支持计划项目 |
| 摘 要： | 矿区GIS中尺度较大的地物即"大型结点",如果不加处理地插入到CP树中,结点之间的重叠区域大大增加,导致查询效率降低。为此提出一种基于凸多边形最优三角剖分矿区GIS-CP索引树"大型结点"裁剪算法,算法保证裁剪后结点具有较好的几何形态以减少插入产生的重叠。实验分析表明,对"大型结点"通过裁剪预处理再插入要比不进行裁剪预处理,检索效率高很多。 |
| 关 键 词： | 凸多边形最优三角剖分 矿区GIS CP树 大型结点 聚密值 |
The Cut Algorithm of Mining Area GIS Index based on the Minimum Weight Convex Polygon Triangulation |
|
| DU Xiaoxin , WANG Bo , SUN Ming , WANG Miao.The Cut Algorithm of Mining Area GIS Index based on the Minimum Weight Convex Polygon Triangulation[J].Bulletin of Science and Technology,2012,28(5):94-98. | |
| Authors: | DU Xiaoxin WANG Bo SUN Ming WANG Miao |
| Institution: | 1.Qiqihaer uuniversity Computer and Control Institute Qiqihaer 161006,China; 2.Qiqihaer nuniversity Education and Communication Institute Qiqihaer 161006,China; 3.Harbin University of Science and Technology Computer Science and Technology Institute Harbin 1580080,China) |
| Abstract: | There are many large ground objects(that is large-scale node)in mining area GIS application,if they are inserted into node without disposing when setting up index,it easily makes overlap between nodes large and inquiry efficiency low.So the cut algorithm of mining area based on the minimum weight convex polygon triangulation is put forward.This algorithm can guarantee the geometry shape of node better and reduce overlap which appears when inserting node after cutting.A series of tests indicate that the algorithm improves the query efficiency of spatial data when the cut algorithm is executed. |
| Keywords: | the minimum weight convex polygon triangulation mining area GIS CP tree large-scale node gather degree |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |