The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Method to Achieve the Intersection of Two Polygons with Node Operation
Author(s): 
Pages: 21-24
Year: Issue:  10
Journal:  Bulletin of Surveying and Mapping

Keyword:  多边形 节点操作 求交运算 多边形交集;
Abstract: 根据多边形之间的交点状态确定与交点相关的节点信息,以节点操作为核心求解两多边形之间的交集。在此基础上,考虑重叠边、边边相交于边节点等情形,通过遍历交点来完成交集多边形边界的构建,从而提出一种多边形求交运算的改进算法。该算法结构简单,具有较快的计算速度和较高的效率,适合于地理信息系统中的空间叠置分析、缓冲区分析应用,对于地图制图中区域要素的截取操作也具有重要的参考价值。
Related Articles
loading...