检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]辽宁师范大学计算机与信息技术学院,辽宁大连116029
出 处:《计算机工程与设计》2008年第22期5898-5900,共3页Computer Engineering and Design
基 金:国家自然科学基金项目(20633050)
摘 要:现有的椭圆窗口裁剪算法需通过求交运算确定裁剪对象,算法复杂,而且只适用于简单图形的裁剪。由于裁剪是计算机图形学中基础算法之一,因此找到一种高效的椭圆窗口裁剪算法具有重要的实际意义。提出了一种基于像素的椭圆窗口裁剪算法,首先采用高效的椭圆算法生成裁剪窗口,然后以窗口作为边界利用扫描线原理确定窗口内像素并输出,完成裁剪过程。该方法无需复杂的求交运算,只需简单的像素读写便可完成裁剪操作,因此裁剪过程简单,执行速度快,算法复杂度低,尤其适合于复杂图形及图像的裁剪处理。Existing ellipse clipping algorithms determine clipping objects through complicated steps of calculating cross-points which is complex and only suitable for simple graphics clipping. Because dipping is one of basis algorithms in computer graphics, it is necessary to find out a high-efficiency clipping algorithm based on ellipse window. A new clipping algorithm based on ellipse window is proposed, which can efficiently clip arbitrary graphics and images. Firstly, a clipping window is generated through a high-quality ellipse algorithm. Then, pixels in the window is scanned and output through scan-line principle. At last, clipping process is finished. The method has advantages of simple design, fast implementation and low complieacy which is more suitable for clipping complicated graphics and image.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43