This paper present a rapid and valid decomposing algorithm for concave polygon and avoid a plenty of complicated calculation of seek intersection. Therefore,the algorithm excel in traditional algorithm in time and calculation complexity.

• 提出了一个快速有效的凹多边形分解算法 ,避免了矢量法所需的大量、复杂的求交计算 ,因此该算法在时间及计算复杂性方面远远优于矢量法 ;