封闭多边形的并、交、差运算
首发时间:2004-02-27
摘要:提出了一种基于交点的凹凸性求封闭多边形的并、交、差的算法。首先给出了环、并、交、差、凹凸点的定义;然后描述了算法。该算法的特点是思路简捷,适合于任意多边形。
For information in English, please click here
An Algorithm for Union, Intersection and Trim of Closed Polygon
Abstract:An algorithm for union, intersection and trim of closed polygon is proposed, which is based on convex-concave points. Firstly, the definitions of loop, union, intersection, trim and convex-concave point are given. Then the algorithm is presented, which is simple and suit for arbitrary polygons.
Keywords: closed polygon loop union intersection trim convex-concave point
论文图表:
引用
No.3443137107785339****
同行评议
共计0人参与
勘误表
封闭多边形的并、交、差运算
评论
全部评论0/1000