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

基于改进的Bresenham圆快速填充算法
引用本文:徐多勇,李志蜀.基于改进的Bresenham圆快速填充算法[J].成都信息工程学院学报,2011,26(1):21-24.
作者姓名:徐多勇  李志蜀
作者单位:成都医学院学生处;四川大学计算机学院;
摘    要:为克服现有圆填充算法效率低的缺点,提出一种快速圆填充算法。算法基于圆的对称性,利用圆弧离散轨迹所具有的特性,分别绘制半径由0依次增加一个像素点,直到变为给定半径r的多个圆,同时找出并填充其中的漏点。最后达到快速填充整个圆的效果。

关 键 词:计算机应用  计算机图形学  圆填充  Bresenham算法

A Fast Circle Fill Algorithm Based on Modified Bresenham Algorithm
XU Duo-yong,LI Zhi-shu.A Fast Circle Fill Algorithm Based on Modified Bresenham Algorithm[J].Journal of Chengdu University of Information Technology,2011,26(1):21-24.
Authors:XU Duo-yong  LI Zhi-shu
Institution:XU Duo-yong1,LI Zhi-shu2(1.Office of Student Affairs,Chengdu Medical College,Chengdu 610083,China,2.College of Computer Science,SCU,Chengdu 610064,China)
Abstract:In order to overcome the low efficiency of the circle fill algorithm,a new fast circle fill algorithm was introduced.Based on circle symmetry property and circle arcs discrete track property,a series of circles by radius from 0 to r pixels were drawn,Simultaneity,the losing-draw pixels was found and filled.Finaly the whole circle was quickly filled in this way.
Keywords:computer application  computer graphics  circle fill  Bresenham algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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