摘要
本文利用多边形窗口本身的连续性，在识别最左边线段的基础上提出了能够对任意折线段或任意多边形等目标进行裁剪的通用算法．由于没有对线段进行附加的规定，且对任意复杂的目标一次即可完成裁剪操作，因而使算法简单、通用、有效。
The paper here introduces an universal algorithm of clipping any fold-lines or any polygons by utilizing the continuity of the polygon window and recognizing the mest left segment.Since no rules are appended to the segments, the clipping work can be finished in one time for any complicated object,so the algorithm is very simple,general and efficient.
出处
《华北水利水电学院学报》
1995年第1期48-52,共5页
North China Institute of Water Conservancy and Hydroelectric Power
