Bresenham's Circle Drawing Algorithm
source link: https://www.geeksforgeeks.org/videos/bresenhams-circle-drawing-algorithm/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
- 90 Views
- 11/04/2022
Computer graphics uses different types of algorithms to generate a circle. So, to draw a circle on a computer screen we should always choose the nearest pixels from a printed pixel so that they could form an arc. There are two algorithm to do this:
1) Mid-Point circle drawing algorithm 2) Bresenham’s circle drawing algorithm.
This video focuses on Bresenham's Circle Drawing Algorithm. Bresenham’s Circle Drawing Algorithm selects the nearest pixel position to complete the arc. It is not easy to display a continuous smooth arc on the computer screen as our computer screen is made of pixels organized in matrix form. The unique part of Bresenham’s circle drawing algorithm is that it uses only integer arithmetic which makes it, significantly, faster than other algorithms using floating-point arithmetic in classical processors. Apart from that we will understand this algorithm with the help of examples as well.
Related Links: https://www.geeksforgeeks.org/bresenhams-circle-drawing-algorithm/ https://www.geeksforgeeks.org/mid-point-circle-drawing-algorithm/
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK