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

二维线段裁剪新算法
引用本文:熊中敏,李宏伟,马春光.二维线段裁剪新算法[J].哈尔滨理工大学学报,2001,6(2):7-10.
作者姓名:熊中敏  李宏伟  马春光
作者单位:1. 齐齐哈尔大学 计算机科学系,
2. 长庆石油管理局,
摘    要:利用直线的斜率特性,将直线与窗口位置的判断转化为根据直线的斜率及窗口顶点与直线的相互关系后,再进行判断。这种新算法与现有的两种算法比较,完全可以丢充与剪裁窗口不相关的线段,并能直接确定线段与窗口边界的交点。由于冗余交点计算较少,新算法节省了计算时间,并提高了求交效率。

关 键 词:直线段  线裁剪  算法  窗口  求交效率  计算机图形学
文章编号:1007-2683(2001)02-0007-04

A New 2-D Line Clipping Algorithm
XIONG Zong-min,LI Hong-wei,MA Chun-guang.A New 2-D Line Clipping Algorithm[J].Journal of Harbin University of Science and Technology,2001,6(2):7-10.
Authors:XIONG Zong-min  LI Hong-wei  MA Chun-guang
Abstract:Defining the position's relationship between a 2-D line and the clipping window will be transformed into judging the position's relationship between the points of clipping window and the 2-D line segment through the line's slope. Compared with two known algorithms, the new algorithm can completely check out all of the line segments which aren't clipped by the window. Moreover, it can also directly define the correct conjunctive points when the line is clipped by the window. The calculations about the additional points will reduce to the most. So the new algorithm efficiently reduces the calculation's time and greatly improves the effciency of calculating the conjunctive points.
Keywords:line segment  line clipping  algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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