Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
Algorithms for filled-area primitives These algorithms are classified into two categories (i) Scan line algorithms (ii) Seed fill algorithms.
Question: Explain how computer graphics would play a useful role in education and training. Answer: Computer graphics has occupied an important role in education and training.
Basic Approaches for Visible Surface Determination There are two basic approaches for visible-surface determination, as per if they deal along with their projected images or a
What is vanishing point and view reference point? The perspective projections of any set of parallel lines that are not parallel to the projection plane converge to appoint cal
DV Encoder Types: While DV is captured in a computer this is stored in an AVI file, that is Microsoft's standard file format used for video files. Video support in Windows is prov
why there is coating of phosphorous on CRT screen?
how you doing the graphic?
when dda line drawing algorithm is more efficient than bresenhem line drawing algorithm?
Explain the advantage and disadvantage of Raster CRT Advantages Allows solids, not just wireframes Leverages low-cost CRT technology (i.e., TVs) Bright, i.e.
What is rotation? A 2-D rotation is completed by repositioning the coordinates with a circular path, in the x-y plane by making an angle with the axes. The transformation is g
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd