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.
What is meant by scan code? When a key is pressed on the keyboard, the keyboard controller places a code bear to the key pressed into a part of the memory known as the keyboard
Depth-buffer (or z-buffer) Method Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as
Main Objectives: Interfacing LCD to the Micro-controller (PIC18F4520) Programming LCD by using C- language via MPLAB Sending data or command to the LCD Component
Question) Compute the following: a) Size of 420 × 300 image at 240 pixels per inch. b) Resolution (per square inch) of 3 × 2 inch image that has 768×512 pixels. c) H
Raster Scan Display Device - types of refresh monitors Now day screen display is also based on Cathode ray Tube technology, except that in place of displaying the picture tra
Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background
Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed
example for desigining animation sequence
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
Representational Animation - Computer Animation This method permits an object to change its shape throughout the animation. There are three sub-types to this. The initial is th
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