摘要
矿区GIS中尺度较大的地物即"大型结点",如果不加处理地插入到CP树中,结点之间的重叠区域大大增加,导致查询效率降低。为此提出一种基于凸多边形最优三角剖分矿区GIS-CP索引树"大型结点"裁剪算法,算法保证裁剪后结点具有较好的几何形态以减少插入产生的重叠。仿真实验对本文的裁剪算法进行性能分析。结果表明,本文的裁剪算法是可行的、高效的,其性能明显高于其它同类其它算法。
A lot of large ground objects in the mining area GIS are large-scale nodes. If they are inserted into CP tree without disposing, overlap area among nodes has increased rapidly. It easily makes inquiry efficiency low. So the cut algorithm of mining area GIS-CP tree based on the minimum weight convex polygon triangulation is put forward. This algorithm can guarantee the geometry shape of node better after cutting, it reduce overlap when node is inserted. Performance of algorithm is analyzed by emulation test. Result indicates that algorithm is feasible and efficient, its performance is better than others.
出处
《科技通报》
北大核心
2012年第9期173-177,共5页
Bulletin of Science and Technology
基金
国家自然科学基金资助项目(61100103)
齐齐哈尔大学青年教师科研启动支持计划项目(2010K-M15)
关键词
凸多边形最优三角剖分
矿区GIS
CP树
大型结点
聚密值
the minimum weight convex polygon triangulation
mining area GIS
CP tree
large-scale node
gather degree
