Algorithms for basic line segment plotting, Computer Graphics

Assignment Help:

Algorithms for Basic Line Segment Plotting

There are two important algorithms for basic line segment plotting-DDA algorithm and Bresenham algorithm.  Both the algorithms use the form y = mx + c of the line segment. 

Whereas DDA uses floating point calculations to determine iteratively the pixel positions, Bresenham algorithm is based purely on integer calculation. Therefore, Bresenham algorithm is more efficient and faster.

However, in the literature, you may find modified DDA algorithm that uses integer calculation only.


Related Discussions:- Algorithms for basic line segment plotting

Interpolation spleen and approximation spine, Q.   Give the difference betw...

Q.   Give the difference between interpolation spleen and approximation spine. Also mention the geometric and parametric continuity conditions in these curves. Ans. A spleen s

Image space -approaches for visible surface determination, Image Space Appr...

Image Space Approach -Approaches for visible surface determination The initial approach as image-space, determines that of n objects in the scene is visible at every pixel in

Multimedia entertainment, Multimedia Entertainment: The field of ente...

Multimedia Entertainment: The field of entertainment uses multimedia extensively. One of the earliest and the most popular applications of multimedia are for games. Multimedi

2-d viewing and clipping - raster graphics and clipping, 2-D Viewing and C...

2-D Viewing and Clipping - Raster Graphics and  Clipping In the previous two units of this block, we illustrated the basic elements of computer graphics, that is, the hardware

Summary of graphic primitives, Summary of Graphic Primitives In this a...

Summary of Graphic Primitives In this all section, we have illustrated the basic graphic primitives that are line, point and circle; we have also illustrated both practical an

Modify the dda algorithm for negative sloped lines, 1. Modify the DDA algo...

1. Modify the DDA algorithm for negative sloped lines; discuss both the cases i.e., slope > 1 and 0   Ans. For the generation of lines along with negative slopes as:

What is meant by scan code, What is meant by scan code? When a key is p...

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

Differentiate between lossy and lossless compression, Question: (a) Di...

Question: (a) Differentiate between lossy and lossless compression. (b) State the uses of the two compression standards MPEG-1 and MPEG-2. (c) State three areas where

Gourand shading, This renders a polygon surface by linearly interpolating i...

This renders a polygon surface by linearly interpolating intensity values across the surface. Intensity values for each polygon are matched with the values of adjacent polygon alon

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