期刊文献+

Bresenham直线生成算法的改进 被引量:26

A Modified Bresenham Algorithm of Line Drawing
在线阅读 下载PDF
导出
摘要 直线是图形的基本元素,研究其生成算法具有重要意义。由于经典的Bresenham直线生成算法一次计算只能生成一个像素点,效率较低。为了提高直线生成效率,通过对其进行改进,提出了一种利用直线前两行像素行的像素点数目来计算其余各像素行的像素点数目的算法。该算法在保持Bresenham算法不使用取整和小数运算的优点下,还提高了直线生成效率,一次计算可以生成一个像素行。 Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics. Canonical Bresenham algorithm can only generate one pixel of a line each time. We proposed a new method by improving it in a novel way, which can generate pixel of a line row by row according to the first and second row of a line and inherit the advantages of Bresenham algorithm without division and decimal fraction. Finally, its efficiency has been proved to be much better than those existing methods.
出处 《中国图象图形学报》 CSCD 北大核心 2008年第1期158-161,共4页 Journal of Image and Graphics
关键词 计算机图形学 BRESENHAM算法 判定变量 computer graphics Bresenham algorithm determinant variable
  • 相关文献

参考文献3

二级参考文献9

  • 1刘勇奎.一个对称的快速直线生成算法[J].微计算机应用,1993,14(2):42-43. 被引量:9
  • 2Bresenham J E. Algorithms for computer control of a digital plottex[J]. IBM Systems Journal, 1965,4(1):25- 30.
  • 3Wn X. Rakne J G. Double step incremental generation of lines and circles[J]. CVGIP, 1987, 37:331 - 334.
  • 4Bodlaendex H L. A linear- time algorithm for Finding tree decompositions of small treewidth[J]. SIAM J Computer,1996, 25(6): 1305-1317.
  • 5Dujmvic V. On the parameterized complexity of layered graph drawing[A]. In Proc 5th Annual European Symp. on Algorithms (ESA '01), 2001(2161) :488 - 499.
  • 6唐荣锡 汪嘉业 彭群生.计算机图形学教程(修订版)[M].北京:科学出版社,2001.34-38.
  • 7唐荣锡 汪嘉业 等.计算机图形学教程(修订版)[M].北京:科学出版社,2001..
  • 8郑宏珍,赵辉.改进的Bresenham直线生成算法[J].中国图象图形学报(A辑),1999,4(7):606-609. 被引量:32
  • 9程锦,陆国栋,谭建荣.基于直线特性的直线生成集成算法[J].中国图象图形学报(A辑),2001,6(4):392-395. 被引量:5

共引文献46

同被引文献181

引证文献26

二级引证文献73

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部