基于Mapx组件的凹多边形快速分解算法的实现

Concave Polygon Fast Decomposition Algorithm Based on Mapx Components

在精准农业作业过程中,需要对农田地块多边形进行复杂的空间分析,如路径优化。空间分析一般是基于凸多边形,所以需要将凹多边形分解成凸多边形来处理,数目尽量最少,效率尽量高。为此,提出了一种凹多边形的分解算法,通过各凹点连接其他顶点连线的交点等信息进行判断,采用递归算法,利用VisualC++语言和Mapx组件实现该算法的实现与显示。该算法简明实用,效率高,生成凸多边形数量少。

The agricultural land polygon need the complex spatial analysis in the operation precision agriculture,such as path optimization.Spatial analysis in general is based on the convex polygon,it needs to be concave polygon into convex polygons to deal with the number at least as far as possible,as far as possible the high efficiency.In this paper,a concave polygon decomposition algorithm has been advanced,through the information of the au points connect to the other vertex of the intersection to determine,using recursive algorithms,visual C ＋ ＋ language and Mapx components to achieve the realization of the algorithm and display.The algorithm is concise and practical,it also has high efficiency,it can generate a small number of convex polygon.