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

What is the difference between kerning and tracking, QUESTION (a) What ...

QUESTION (a) What is the difference between kerning and tracking? (b) What is the advantage of creating colours in the Swatches panel instead of the Colour panel? (c) Wha

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

Multimedia and its features, Multimedia as the name suggests MULTI and MEDI...

Multimedia as the name suggests MULTI and MEDIA utilizes some media for example: text, graphics, audio, video and also animation, to convey information. Multimedia also consider to

Liang barsky line clipping algorithm, Liang Barsky line clipping algorithm ...

Liang Barsky line clipping algorithm : The algorithm uses parametric form of the line segment.  Four inequalities are created using the parametric form of the line segments.  Th

Transformation, Define transformation. Explain all basic transformation

Define transformation. Explain all basic transformation

Frame animation non- interactive animation rectangular shape, Frame animati...

Frame animation non- interactive animation rectangular shape (Cartoon movies) It is an "internal" animation method, which is, it is animation within a rectangular frame. This i

Softwares for computer animation, Software for computer animation Wh...

Software for computer animation Whether you might have the excellent hardware in the world, but without a high-quality software package, your hardware can act nothing. There

Perform a x-direction shear transformation, 1. If you perform a x-direction...

1. If you perform a x-direction shear transformation and then a y-direction shear transformation, will the result be the same as the one which is obtained when it is simultaneous s

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