[1]邰滢滢,王庆,孙琨.GIS中基于拓扑信息的矢量图形叠置方法[J].东南大学学报(自然科学版),2006,36(3):442-445.[doi:10.3969/j.issn.1001-0505.2006.03.023]
 Tai Yingying,Wang Qing,Sun Kun.Algorithm on polygon overlaying based on topological information in GIS[J].Journal of Southeast University (Natural Science Edition),2006,36(3):442-445.[doi:10.3969/j.issn.1001-0505.2006.03.023]
点击复制

GIS中基于拓扑信息的矢量图形叠置方法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
36
期数:
2006年第3期
页码:
442-445
栏目:
计算机科学与工程
出版日期:
2006-05-20

文章信息/Info

Title:
Algorithm on polygon overlaying based on topological information in GIS
作者:
邰滢滢 王庆 孙琨
东南大学仪器科学与工程系, 南京 210096
Author(s):
Tai Yingying Wang Qing Sun Kun
Department of Instrument Science and Technology, Southeast University, Nanjing 210096, China
关键词:
多边形叠置 拓扑信息 二叉树
Keywords:
polygon overlaying topological information bina sorting tree
分类号:
TP391
DOI:
10.3969/j.issn.1001-0505.2006.03.023
摘要:
针对GIS系统中实现无拓扑信息多边形叠置过程复杂的问题,提出了一种新的快速多边形叠置方法.通过在无拓扑矢量数据中局部引入拓扑关系,对同一结点连接的弧段,采用二叉树方法进行排序,构建最小多边形,完成无拓扑信息的矢量图形的重组,并对新算法与已有算法的结构进行了对比.研究结果表明,这种新的叠置算法实现过程简单,速度快,避免了全局构建拓扑关系数据量大、空间和时间关系复杂、维护和更新困难等问题.
Abstract:
Aiming at the difficulty of polygon overlaying for data with no topological information in the geographical information system(GIS)spatial database, a novel quick algorithm on polygon overlaying based on topological information is presented. Local topological information is imported to the altered polygon in this new algorithm. The arcs which are joined in the same node are ordered by means of bina sorting tree, and the minimal polygons are built by the right sequence of arcs, then polygon overlaying is finished. The new algorithm is compared with the existed algorithm, the results show that the process of polygon overlaying is predigested and the efficiency of it is improved by the new algorithm. The problems of mass data and the time-spatial complexity are avoided, and the difficulties of maintenance and updating for topological relationships are left out.

参考文献/References:

[1] Vatti B R.A generic solution to polygon clipping[J]. Communications of the ACM,1992,35(1):56-63.
[2] Maillot P G.A new fast method for 2D polygon clipping:analysis and software implementation[J]. ACM Transactions on Graphics,1992,11(3):276-290.
[3] Reppaport A.An efficient algorithm for line and polygon clipping[J]. Visual Computer,1991,7(1):19-28.
[4] Chen J,Li C M,Li Z L,et al.A voronoi-based 9-intersection model for spatial relations[J]. International Journal of Geographical Information Science,2001,15(3):201-220.
[5] Erik Hoel,Sudhakar Menon,Scott Morehouse.Building a robust relational implementation of topology[EB/OL].(2003-03-03)[2005].http://gis.esri.com/esripress/shared/images/66/Building_Topologies.pdf.
[6] 高云琼,徐建刚,唐文武.同一结点上弧-弧拓扑关系生成的新算法[J].计算机应用研究,2002(4):58-59.
  Gao Yunqiong,Xu Jiangang,Tang Wenwu.A new algorithm for generation of arc-arc topological relationship on the same vertices[J]. Computer Research and Application,2002(4):58-59.(in Chinese)
[7] Weiler K,Atherton P.Hidden surface removal using polygon area sorting[J].Computer Graphics,1977(11):214-222.
[8] Greiner G,Hormann K.Efficient clipping of arbitrary polygons[J]. ACM Transactions on Graphics,1998,17(2):71-83.
[9] 刘勇奎,高云,黄有群.一个有效的多边形裁减算法[J].软件学报,2003,14(4):845-856.
  Liu Yongkui,Gao Yun,Huang Youqun.An efficient algorithm for polygon clipping[J].Journal of Software,2003,14(4):845-856.(in Chinese)
[10] 闫浩文,杨维芳,陈全功,等.基于方位角计算的拓扑多边形自动构建的快速算法[J].中国图形图像学报,2000,5(7):563-567.
  Yan Haowen,Yang Weifang,Chen Quangong,et al.A fast algorithm of topological polygon auto-construction based on azimuth calculation[J]. Journal of Image and Graphics,2000,5(7):563-567.(in Chinese)

备注/Memo

备注/Memo:
基金项目: 国土资源部“十五”重点科技资助项目(20050101).
作者简介: 邰滢滢(1978—),女,博士生; 王庆(联系人),男,博士,教授,博士生导师,w3398@263.net.
更新日期/Last Update: 2006-05-20