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

Macintosh - hardware for computer animation, Macintosh - Hardware for compu...

Macintosh - Hardware for computer animation It was originally designed to be graphic and desktop publishing machines. Macs did not turn into which widely known till recently, a

Geometric continuity - clipping and 3d primitives, Geometric Continuity ...

Geometric Continuity There is another notion of continuity called geometric continuity. Although the idea existed in differential geometry, the concept was introduced for geome

Photoshop, What is the best selection method in photoshop

What is the best selection method in photoshop

Character generation, Which is the most usable and frequent method to gener...

Which is the most usable and frequent method to generate a character?

Graphic file compression formats, Graphic File Compression Formats Web...

Graphic File Compression Formats Web graphics are by requirement compressed due to the bandwidth issues surrounding networked delivery of information and since image files inc

Architecture-applications for computer animation, Architecture: One of the...

Architecture: One of the purposes for the development of virtual reality (that is in fact a form of computer animation) was which it was going to be very helpful to architects. He

Important points for designing the animation sequence, Important Points for...

Important Points for Designing the Animation Sequence There are several applications which do not follow this sequence as, real time computer animations generated by vehicle dr

What are the advantages of rendering by patch splitting, What are the advan...

What are the advantages of rendering by patch splitting?  i. It is fast-especially on workstations with a hardware polygon-rendering pipeline.  ii. Its speed can be varied b

Normalization transformation, Find the normalization transformation N, whic...

Find the normalization transformation N, which uses the rectangle W(1, 1); X(5, 3); Y(4, 5) and Z(0, 3) as a window and the normalized deice screen as viewpoint.

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