凸多边形窗口线裁剪的新算法
孙燮华1(中国计量学院计算机科学与技术系，杭州 310034) 摘 要
凸多边形窗口的线裁剪是用多边形窗口裁剪多边形的基础.为此，提出了凸 n边形窗口的线裁剪新算法.新算法与 Cyrus- Beck算法相比，当 n较大时，新算法的乘法大约只有 Cyrus- Beck算法的 1/ 3且仅用 4次除法.因此，新算法大大地加快运算速度.
关键词
A New Algorithm of Line Clipping for Convex Polygons
() Abstract
A new algorithm of line clipping for convex polygons with n edges is proposed. Comparing the new algorithm and Cyrus-Beck algorithm, if n is sufficiently large, the number of multiplications used by the new algorithm is one third of the ones used by Cyrus-Beck algorithmand the new algorithm only uses 4 divisions for any convex polygons. Hence,the new algorithm is faster than Cyrus-Beck algorithm.
Keywords
|
中国图象图形学报 │ 京ICP备05080539号-4 │ 本系统由