对Sutherland-Cohen算法的改进

A Modification to Sutherland-Cohen Algorithm

提出了对Sutherland-Cohen算法的改进。通过引进辅助直线进行直线裁剪,只需两次求交运算就即求出线段的可见部分,还减少了对线段的重编码运算,具有和NLN算法相同高的效率。通过引入辅助平面进行三维裁剪,克服了NLN算法不能扩展到三维的缺点,而且其三维裁剪效率高于Sutherland-Cohen算法和梁友栋-Barsky算法。

A modification technique to the Sutherland-Cohen algorithm is presented. By using auxiliary straight-line to clip any straight line, at most only two intersection operations are needed to find out the visible part of the line. Furthermore the new technique reduces the re-coding operations for the straight line. The technique has the same efficiency with NLN algorithm and can be extended to three dimensional cases which is NLN can not attained. It is obviously that the efficiency of this new technique is higher than Sutherland-Cohen and LiangYDong-Barsky algorithm in three dimensional cases.