Midpoint circle algorithm for scan converting a circle, Computer Graphics

Assignment Help:

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


Related Discussions:- Midpoint circle algorithm for scan converting a circle

Education and training, explain in detail the application of computer graph...

explain in detail the application of computer graphics in education and training?

Properties of bezier curves - modeling and rendering, Properties of Bezier ...

Properties of Bezier Curves - modeling and rendering A very helpful property of a Bezier curve is that it always passes via the first and last control points. Such the bounda

What will be the resulting rotation matrix, An object has to be rotated abo...

An object has to be rotated about an axis passing through the points (1,0 ,1), (1,3,1) .  What will be the resulting rotation matrix?    Solution: The axis is parallel to y axis

Trivial acceptance case of cohen sutherland line clippings, Trivial accepta...

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000

2d clipping algorithms - clipping and 3d primitives, 2D Clipping Algorithms...

2D Clipping Algorithms Clipping is an operation that eliminates invisible objects from the view window.  To understand clipping, recall that when we take a snapshot of a scene,

Area subdivision method-obscures the continuing two surface, Assume here ar...

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5) And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,

What is a model sheet?, Question 1 Briefly explain the twelve principles o...

Question 1 Briefly explain the twelve principles of animation Question 2 Explain the methods to set-up pre and post-infinity curves Question 3 What is a model sheet? Exp

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd