二维装配图的快递交点排序裁剪算法

A rapid intersection sorting algorithm on the edge clipping for 2D assembly drawing

提出一个任意多边形的快速交点排序线裁剪算法,该算法简单快捷,效率高,并将其成功用于工程装配图的二维消隐。解决了大多数算法将凹多边形裁剪分解为凸多边形处理存在计算时间长、难度大等问题。

Clipping algorithms are one of the most fundamental algorithms in Computer Figure,but the most algorithms are used to deal with rectangular windows and convex polygons. Concave polygons have to be divided into several convex polygons, and are clipped according to convex polygon clipping algorithms. More time is used and it is more difficult. This paper proposes a rapid intersection sorting clipping algorithm for general polygons and the algorithm is more simple and more efficient, which is used for 2D removing hidden edges of parts assembly drawing in engineer successfully.