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

Tablet computer - cad and cam, Tablet Computer - CAD and CAM Tablet ...

Tablet Computer - CAD and CAM Tablet Computer: it is a complete computer comprises in a touch screen. Tablet computers can be specialized for only Internet utilize or be fu

Draw line segment - digital differential analyzer algorithm, 1. By using D...

1. By using Digital Differential Analyzer algorithm draw line segments from point (1,1) to (9,7). Ans. We see that the usual equation of the line is specified by: y = mx+c

Student, hi I need help with photoshop

hi I need help with photoshop

., Define the working procedure of CRT with diagram

Define the working procedure of CRT with diagram

Voltage or electro-magnetic field tablet and pointer, (a)  Voltage or Elect...

(a)  Voltage or Electro-Magnetic Field Tablet and Pointer: This has a grid of wires, embedded in the tablet surface along with various voltages or magnetic fields consequent to va

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

What is the minimum number of control points, Question: A curve shape ha...

Question: A curve shape has three quadratic Bézier curve segments. The curves have been joined sequentially so that continuity of the first derivative of the resulting curve sha

List five different area of application of computer graphics, Question: Lis...

Question: List five different areas of applications of computer graphics Answer: Five major areas of applications of computer graphics are:  i) Study of molecular structures.

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

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