Abstract
This paper proposes an efficient algorithm to deal with concave polygons encountered in assembly drawing, it is equally applicable to convex polygons. The peculiarities of concave polygon was analyzed to avoid using the usual method of breaking a concave polygon into several convex polygons. The algorithm is a part of fixture CAD system planned to be used shortly. In order to ensure that the clipping algorithm can work smoothly within such a system, clearly defining what are the windows and what are the polygons to be clipped is necessary.
| Original language | English |
|---|---|
| Pages (from-to) | 12-15 |
| Number of pages | 4 |
| Journal | Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University |
| Volume | 15 |
| Issue number | 1 |
| State | Published - 1997 |