Midpoint circle generation algorithm - 2d shape primitives, Computer Graphics

Assignment Help:

Midpoint Circle Generation Algorithm  

Just as a line drawing algorithm approximates infinite number of points on a line segment by only a finite number of pixels, a circle drawing algorithm approximates continuous circle by appropriately choosing a discrete set of points close to the circular arc.  One of the well known algorithms for circle generation is midpoint circle generation algorithm. The algorithm is a variant of Bresenham's line generation algorithm and uses a decision parameter to find out the closest pixel with the actual circle at each incremental step. Implicit equation of the circle given by 

(x - xc)2 + (y-yc)2 = r2

is used to define the decision parameter.  Here r is the radius and (xc,yc) is the centre of the circle.  Symmetry of the circle is fully exploited for its scan conversion.  Actually, we need to approximate the circle only in one octant, points in other seven octants similarly get approximated due to symmetry, as shown in Figure on the next page.  The decision parameter helps in deciding which pixels are closest to the circle boundary.  The algorithm is iterative in nature.  Next pixel position and decision parameter are computed iteratively.  Just as in Bresenham line drawing algorithm, one only needs to check the sign of the decision parameter to find out next pixel position.  This makes the implementation of the algorithm very easy.

 

2266_Midpoint Circle Generation Algorithm.png

 


Related Discussions:- Midpoint circle generation algorithm - 2d shape primitives

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

Boundary fill algorithm - output primitives, Boundary Fill Algorithm Bo...

Boundary Fill Algorithm Boundary fill algorithm is suitable when the boundary has single color while flood fill algorithm is more suitable for filling regions which are defined

Modal create, morgen wants to sign up for an account on doggobook, the worl...

morgen wants to sign up for an account on doggobook, the world''s thrid - best social network for dog enthusiasts. she enters her email address and a password into the sign-up form

Categories of orthographic projection, Categories of Orthographic Projectio...

Categories of Orthographic Projection Orthographic projection is additionally divided into Multi-view projection and axonometric projection, depending upon where the direction

Application of sutherland hodgman polygon clipping, For good understanding ...

For good understanding of the application of the rules specified above see the following figure, where the shaded region demonstrates the clipped polygon. Fi

How avar values generate to get realistic movement, How avar values generat...

How avar values generate to get realistic movement There are numerous ways of generating avar values to get realistic movement. One way is to use markers on a real person (or w

Two-dimensional geometric transformations, Two-Dimensional Geometric Transf...

Two-Dimensional Geometric Transformations  When a real life object is modelled using shape primitives, there are several possible applications.  You may be required to do furth

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