首页 | 本学科首页   官方微博 | 高级检索  
     检索      

任意多边形窗口的有效线裁剪算法
引用本文:李雪,石广田.任意多边形窗口的有效线裁剪算法[J].兰州铁道学院学报,2007,26(3):89-92.
作者姓名:李雪  石广田
作者单位:兰州交通大学机电工程学院 甘肃兰州730070(李雪),兰州交通大学艺术设计学院 甘肃兰州730070(石广田)
摘    要:已有的线剪裁算法大都是针对矩形窗口或凸多边形窗口的,对于任意多边形窗口的线剪裁,目前尚无有效的算法,而这样的算法却有更普遍的应用意义.提出了一个多边形裁剪线段的有效算法,该算法运算高效、稳定.

关 键 词:计算机图形学  多边形窗口  线裁剪
文章编号:1001-4373(2007)03-0089-04
修稿时间:2006-11-08

Efficient Algorithm for Line Clipping against Random Polygon
Li Xue,Shi Guangtian.Efficient Algorithm for Line Clipping against Random Polygon[J].Journal of Lanzhou Railway University,2007,26(3):89-92.
Authors:Li Xue  Shi Guangtian
Abstract:Existing line clipping algorithms are almost offered based on a rectangular window or a convex polygonal window.No efficient algorithm for line clipping against a generalized polygon is available in the literature.It is quite valuable to develop such algorithm.In this paper,an efficient algorithm against a generalized polygon is presented,and it can be proved the high efficiency and stability.
Keywords:computer graphics  polygon window  line clipping
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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