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!
What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm?
DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham's algorithm has the following advantages on DDA: (1) DDA uses float numbers and uses operators such as division and multiplication in its calculation. Bresenhams algorithm uses ints and only uses addition and subtraction. (2) Due to the use of only addition, subtraction and bit shifting Bresenhams algorithm is faster than DDA in producing the line. (3) Fixed point DDA algorithms are generally superior to Bresenhams algoritm on modern computers. The reason is that Bresenhams algoritm uses a conditional branch in the3 loop and this result in frequent branch mis-predictions in the CPU. (4) Fixed point DDA also has fewer instructions in the loop body (one bit shift, one increment and one addition to be exact. In addition to the loop instructions and the actual plotting. As CPU pipelines become deeper mis predictions penalties will become more severe. (5) Since DDA uses rounding off of the pixel position obtained by multiplication of division, causes an accumulation of error in the proceeding pixels whereas in Bresenhams line algorithm the new pixel is calculated with a small unit change in one direction and checking of nearest pixel with the decision variable satisfying the line equation. (6) Fixed point DDA does not require conditional jumps, you can compute several lines in parallel with SIMD (Single Instruction Multiple Data techniques.
Can you tell which main components (hardware and software) are needed for computer graphics? Besides the computer, some special devices and software may be needed especially fo
do you remember how you to work the computer graphics
Character Generation You know that graphics displays often contain components which are text based. For example graph labels, annotations, descriptions on data flow diagrams,
Types of Animation Systems - Computer Animation We have discussed above about the sequencing of animation is helpful in developing any animation. Such sequencing is more or le
Pitfalls in computer simulation Though generally avoided in computer simulations, in strict logic the rules governing floating point arithmetic even apply. For illustration, t
High Level Techniques (Motion Generalized) These are techniques utilized to explain the general motion behavior of any type of graphic object. Such techniques are algorithms o
what is curve clipping
Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries
Rotation about z-axis - Transformation for 3-d rotation Rotation about z-axis is explained by the xy-plane. Suppose a 3-D point P(x,y,z) be rotated to P'(x',y',z') along with
Curve Clipping and Character Clipping As you proceed further, you would see that the methods for curve clipping and character clipping have also been developed based on boundin
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd