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

Traditional animation techniques , Traditional Animation techniques as: ...

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

Essentialily of computer simulation, Essentialily of Computer Simulation ...

Essentialily of Computer Simulation You may want to understand why to do simulation? Is there any one way to perform the tasks? To converse these matters lets briefly discuss

Simple graphical user interface, The RIA should consist of: i) A simple ...

The RIA should consist of: i) A simple Graphical User Interface (GUI) constructed from a simple navigation system (comprising of around 5 key frames) making use of the Flash tim

Dda and bresenhem line drawing algorithm, when dda algorithm is more effici...

when dda algorithm is more efficient than bresenhem line drawing algorithm

Polygon tables - curves and surfaces, Polygon Tables - curves and surfaces ...

Polygon Tables - curves and surfaces All polygons are analogous to a graph G (V, E). Remember that the analogy in which a polygon surface can be specified along with as a set

Perspective projections - transformation, Perspective Projections - Transfo...

Perspective Projections - Transformation In this projection the center of projection is at limited distance. This projection is termed as perspective projection since in this

Scripting systems- computer animation, Scripting Systems- Computer Animatio...

Scripting Systems- Computer Animation Scripting Systems are the earliest type of motion control systems. Scripting systems permit object specifications and animation sequenc

Electronic encyclopedia, Electronic Encyclopedia : This is the applica...

Electronic Encyclopedia : This is the application of multimedia for the creation of an encyclopedia along with millions of entries and hypertext cross references covering a br

Basic tests - producing polygon surface, Basic Tests - Producing Polygon Su...

Basic Tests - Producing Polygon Surface A few basic tests that must be performed before producing a polygon surface through any graphic package as: 1) All vertexes are list

Region filling, what is region filling? give details

what is region filling? give details

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