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

Write a code to generate a composite matrix, Write a code to generate a com...

Write a code to generate a composite matrix for general 3D rotation matrix.  Test your code and rotate continuously a cube about an axis.

Transformation, determine the form of the transformation matrix for a refle...

determine the form of the transformation matrix for a reflection about an arbitrary line with equation y=mx+b.

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

Geographic information systems (gis)-image processing, Geographic Informati...

Geographic Information Systems (GIS): The most generally utilized software is: ArcMap . Characteristics: I.          Works inside a geographic context. II.         Great

Intensity of colours - raster graphics and clipping, Similarly we can contr...

Similarly we can control the intensity of colours We contain more bit planes for all colour say three bit planes for R, 3 for G and 3 for B here all bit plane of size mxn, hen

Briefly explain the 12 stages in image processing, QUESTION (a) In Autom...

QUESTION (a) In Automatic Contrast Adjustment briefly explain how to stretch an image to its full intensity (b) Write down a mathematical function of a Modified Automatic Con

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

What are the advantages of the boundary representation, Advantages of the B...

Advantages of the Boundary Representation (i) This format gives efficient picture generation and easy access to other geometric information. (ii) The changes produced by mos

Remark for perspective projection - transformation, Remark for Perspective ...

Remark for Perspective projection - Transformation A Perspective projection can have at most three Principle Vanishing points and at any rate one Principle vanishing point. To

Scan line polygon fill and seed fill or flood fill algorithm, 1.   Distingu...

1.   Distinguish among Scan line polygon fill and Seed fill or Flood fill algorithm? Scan Line Polygon Flood Fill Algorithms ?1. This

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