%0 Journal Article %T A Modified Bresenham Algorithm of Line Drawing
直线生成算法的改进 %A JIA Yin-liang %A ZHANG Huan-chun %A JING Ya-zhi %A JIA Yin-liang %A ZHANG Huan-chun %A JING Ya-zhi %A JIA Yin-liang %A ZHANG Huan-chun %A JING Ya-zhi %A
贾银亮 %A 张焕春 %A 经亚枝 %J 中国图象图形学报 %D 2008 %I %X 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. %K computer graphics %K Bresenham algorithm %K determinant variable
计算机图形学 %K Bresenham算法 %K 判定变量 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D06194629680C940ACE75262F54B9D85&aid=534DB66BD1CD0295F92A1065FB8377CC&yid=67289AFF6305E306&vid=FC0714F8D2EB605D&iid=CA4FD0336C81A37A&sid=4C100B7696CE9E24&eid=8575BEDA702C4B7C&journal_id=1006-8961&journal_name=中国图象图形学报&referenced_num=0&reference_num=5