节点文献

一种多边形交、并、差运算的有效算法

An Efficient Algorithm for Intersection, Union and Difference Between Polygons

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 于雷易边馥苓万丰

【Author】 YU Leiyi 1 BIAN Fuling 2 WAN Feng 3 (1 School of Remote Sensing and Information Engineering, Wuhan University, 129 Luoyu Road, Wuhan, China, 430079) (2 Research Center of Spatial Information and Digital Engineering, Wuhan University, 129 Luoyu Road, Wuhan, China, 430079) (3 School of Computer, Wuhan University, 129 Luoyu Road, Wuhan, China, 430079)

【机构】 武汉大学遥感信息工程学院武汉大学空间信息与数字工程研究中心武汉大学计算机学院 武汉市珞喻路129号430079武汉市珞喻路129号430079

【摘要】 以周培德的Z5 4算法为参考 ,提出了一种简单多边形交、并、差运算算法———IBO算法。该算法能够处理二维现实世界中的各种情况 ,对于地理信息系统的空间分析有较好的应用价值

【Abstract】 By the reference of the Z5-4 algorithm developed by Zhou Peide, the paper presents an algorithm for intersection, union and difference between simple polygons, which is named IBO algorithm. In the algorithm, the result polygon is tracked according to the spatial relation between the edge of one polygon and another polygon. The algorithm is valid for all the cases in the real two-dimensional world and has high efficiency. It is applicable in spatial analysis of geographic information system.

  • 【文献出处】 武汉大学学报(信息科学版) ,Editorial Board of Geomatics and Information Science of Wuhan University , 编辑部邮箱 ,2003年05期
  • 【分类号】P208
  • 【被引频次】17
  • 【下载频次】308
节点文献中: 

本文链接的文献网络图示:

本文的引文网络