首页 | 官方网站   微博 | 高级检索  
     

一种新的任意四边形窗口线裁剪算法
引用本文:李雪,石广田.一种新的任意四边形窗口线裁剪算法[J].兰州铁道学院学报,2005,24(6):90-92.
作者姓名:李雪  石广田
作者单位:兰州交通大学机电工程学院,甘肃兰州730070
摘    要:线裁剪技术在计算机图形处理中占有重要地位,是计算机图形学中许多重要问题的基础,关于线段的二维裁剪有许多成熟的算法.在分析已有的二维裁剪缺点的基础上,提出了一个新算法.该算法通过将凹四边形区域转为凸四边形区域,并将该区域分为四个区,对线段进行裁剪,实验结果表明该裁剪方法高效、准确.

关 键 词:凹、凸四边形  线裁剪  四区域
文章编号:1001-4373(2005)06-0090-03
收稿时间:2005-06-27
修稿时间:2005年6月27日

A New Algorithm for Line Clipping against a General Quadrilateral
Li Xue,Shi Guangtian.A New Algorithm for Line Clipping against a General Quadrilateral[J].Journal of Lanzhou Railway University,2005,24(6):90-92.
Authors:Li Xue  Shi Guangtian
Affiliation:School of Meehatronie Engineering, Lanzhou Jiaotong University, Lanzhou 730070,China
Abstract:The technology of line clipping plays an important role, and is a foundation of many important problems in the computer graphics process. There are a lot of good algorithms about a line clipping. In the paper, based on the analysis of the disadvantage of existing algorithms, a new algorithm is presented. The clipping can be done according to the concave polygon turned into convex polygon and the departed into four segments. The result of the experiment indicates that the algorithms given is very simple and efficient.
Keywords:concave and convex polygon quadrilateral  line clipping  four segments
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号