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

Horizontal retrace - display devices, Horizontal retrace - Display Devices ...

Horizontal retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the left most point on the next horizontal line after refresh

What are the features of inkjet printers, What are the features of Inkjet p...

What are the features of Inkjet printers?  They can print 2 to 4 pages/minutes. Resolution is about 360d.p.i. Thus better print quality is achieved. The operating

2-d and 3-d transformations, 2-D and 3-D Transformations Previously, w...

2-D and 3-D Transformations Previously, we have presented approaches for the generation of polygonal regions and lines. We identified that once the objects are produced, the v

Real time clock -rtc, Main objectives: To test to micro-controller I...

Main objectives: To test to micro-controller I2C protocol bus functionality Setting and displaying accurate time and date on the LCD GENERAL DESCRIPTION The D

Differentiate among interpolation and approximation spline, Differentiate a...

Differentiate among interpolation spline and approximation spline?  When the spline curve passes by all the control points then it is known as interpolate. When the curve is

Algorithm scan-line, Algorithm (scan-line): For each scan line perform ...

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

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:

Describe digital printing and prepress, Question 1: (a) Describe Digita...

Question 1: (a) Describe Digital Printing and Prepress? Also state the advantages and disadvantages of Digital printing? Question 2: (a) What are the three most import

Calculate the entropy of the source, Question 1) Encode the following s...

Question 1) Encode the following string using HUFFMAN ENCODING:                            DO YOU LIKE TINKY WINKY OR EMPTY DUMPTY?     Empty spaces are considered.

Morphing - key frame systems, Morphing - Key Frame Systems Transformati...

Morphing - Key Frame Systems Transformation of object shapes from one form to the other is termed as morphing as short form of metamorphism. This method can be applied to any o

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