Search results
Results from the WOW.Com Content Network
English: An illustration of two octants of the w:Midpoint circle algorithm (also known as Bresenham's circle algorithm). Vector version of public domain image w:File:Bresenham_circle3.png on English Wikipedia.
A circle of radius 23 drawn by the Bresenham algorithm. In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for rasterizing a circle. It is a generalization of Bresenham's line algorithm. The algorithm can be further generalized to conic sections. [1] [2] [3]
An extension to the original algorithm called the midpoint circle algorithm may be used for drawing circles. While algorithms such as Wu's algorithm are also frequently used in modern computer graphics because they can support antialiasing , Bresenham's line algorithm is still important because of its speed and simplicity.
Midpoint_circle_algorithm,_radius_23.png (589 × 589 pixels, file size: 3 KB, MIME type: image/png) This is a file from the Wikimedia Commons . Information from its description page there is shown below.
Created Date: 8/30/2012 4:52:52 PM
Bresenham's line algorithm, developed in 1962, is his most well-known innovation. It determines which points on a 2-dimensional raster should be plotted in order to form a straight line between two given points, and is commonly used to draw lines on a computer screen. It is one of the earliest algorithms discovered in the field of computer ...
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate; Pages for logged out editors learn more
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate