Midpoint circle algorithm for scan converting a circle, Computer Graphics

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle.

Midpoint Circle Algorithm   1. Input radius r and circle center (x c , y c) , and obtain the first point on the circumference of a circle centered on the origin as (x0, y0,) = (0, r)  2. Calculate the initial value of the decision parameter as p0 = 5/4-r  3. At each x k position, starting at k = 0, perform the following test: If p k <0 , the next point along the circle centered on (0,0) is (x k+1,y k) and p k+1 = p k + 2x k+1 + 1 Otherwise, the next point the circle is ( x k + 1, y k -1) and p k+1 = p k+ 2x k+1 + 1 -2 y k where 2x k+1 = 2xk +2 and 2yk+1 = 2y k -2.  4. Determine symmetry points in the other seven octants.  5. Move each calculated pixel position (x, y) onto the circular path centered on (x c,y c) and plot the coordinate values: x = x +x c,  y = y + y c  6. Repeat steps 3 through 5 until x > y

Posted Date: 7/1/2012 6:38:04 AM | Location : United States







Related Discussions:- Midpoint circle algorithm for scan converting a circle, Assignment Help, Ask Question on Midpoint circle algorithm for scan converting a circle, Get Answer, Expert's Help, Midpoint circle algorithm for scan converting a circle Discussions

Write discussion on Midpoint circle algorithm for scan converting a circle
Your posts are moderated
Related Questions
What is Aspect ratio?  The ratio of vertical points to the horizontal points essential to produce length of lines in both directions of the screen is known as the Aspect ratio.

What is persistence? The time it takes the emitted light from the screen to decompose one tenth of its original intensity is known as persistence.

Explain the interactive picture construction techniques.    interactive picture- construction methods are commonly used in variety of applications, including design and painting pa

Illustration of a Clipping window ABCD is placed as follows: A (100, 10), B (160, 10, C (160, 40), D (100, 40) By using Sutherland-Cohen clipping algorithm determine the vis

Types of Light Resources - illumination Model Let us discuss about the types of light resources. The light sources can not merely be natural like light from Sun or Moon or Sta

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Implement the Scan line polygon fill algorithm for any arbitrary polygon in C-language and then use your code to fill each of the following type of polygon. i)  Convex polygon

Demerit - phong shading or normal vector interpolation shading Needs lot of computations to determine intensity at a point, hence increases the cost of shading in any impleme

Macintosh - Hardware for computer animation It was originally designed to be graphic and desktop publishing machines. Macs did not turn into which widely known till recently, a

Define Random Scan/Raster Scan displays. Ans. Random scan is a process in which the display is made by the electronic beam, which is directed, only to the points or division of