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
Explain the differences among a general graphics system designed for a programmer and one designed for a specific application, such as architectural design? Basically, package


Point clipping - 2-d viewing and clipping Point clipping is the method related to suitable display of points in the scene, though this type of clipping is utilized less freque

What are the Developments of CAD Now CAD packages can be linked to 3D ink jet printers which produce an actual prototype model by building up layers/slices in fine powder (suc

You will write a two-dimensional precursor of the three-dimensional bouncing ball simulation that is one of your choices for a ?nal project. This involves adding functions to your


Traditional Animation techniques as: 1) Key Frames                        2) Cel Animation Formula: Required Key frames for a film = {[Time(in seconds)]

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

Question 1 Discuss the overview of multimedia networks Question 2 Discuss the types of synchronization in multimedia system >> Basic synchronization issues Content R

Important Points About the Diffuse Reflection An extremely rough surface appears uniformly bright from each viewing direction Q the intensity of reflected light is identical i