摘要
线段裁剪技术在计算机图形处理中占有重要的地位,是计算机图形学中许多重要问题的基础,裁剪速度的高低直接影响到图形软件包的运行速度.关于线段的二维裁剪有许多比较成熟的算法,如Cohen-Sutherland、Cyrus-Beck、Liang-Barsky和Nicholl-Lee-Nicholl等算法,其中Nicholl-Lee-Nicholl的二维线段裁剪算法效率很高.但是在Nicholl-Lee-Nicholl直线裁剪算法中,为了确定线段位于哪个区域内必须进行多个斜率的计算,并且由于运用了回避原则,使得算法的复杂度增加〔1〕.文中算法基于数学中提到的区间思想,算法简单。
The technology of routine clipping plays an important role,and is an foundation of many important problems in the computer graphics process.The speed of clipping has a direct effect on the graphics software package′s speed.There are a lot of good algorithms about a routine clipping,such as Cohen-Sutherland,Cyrus-Beck,Liang-Barsky and Nicholl-Lee-Nicholl.Among of them, Nicholl-Lee-Nicholl′s algorithm is more efficient.But in order to confirm which clipping region a routine lies in,many slopes should be calculated and meanwhile adopting the parrying rule makes the algorithms more complicated〔1〕.Based on the scope of X and Y,the algorithm given is very simple and more efficient than Nicholl-Lee-Nicholl′s algorithm.
出处
《内蒙古大学学报（自然科学版）》
CAS
CSCD
北大核心
2003年第2期221-225,共5页
Journal of Inner Mongolia University：Natural Science Edition
基金
国家自然科学基金资助项目(69965001)
关键词
裁剪
裁剪窗口
规则裁剪窗口
区间算法
clipping
clipping window
regular clipping window
region algorithm
