科研之友
微信
新浪微博
Facebook
分享链接
摘要
Boolean operations between planar polygons are fundamental operations in the GISciences. In this paper, a new algorithm based on trapezoidal decomposition is used to perform Boolean operations. Using this method, Boolean operations between polygons are transformed into Boolean operations between decomposed trapezoids. It is comparatively easier to process the simple trapezoids than arbitrary polygons. This new method avoids the complex computation of the spatial relationship between the polygons' edges in the traditional algorithms, thus making the procedure more efficient and easier to understand. In addition, the proposed algorithm can work with concave polygons and those with holes.
- 出版日期2010-12
- 单位南京大学
