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

What is orthographic oblique projection, What is orthographic oblique proje...

What is orthographic oblique projection?  When the direction of the projection is not normal (not perpendicular) to the view plane then the projection is called as oblique proj

What is scan line algorithm, What is scan line algorithm?  One way to f...

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

What makes a pattern a pattern, QUESTION (a) Suppose that you have been...

QUESTION (a) Suppose that you have been assigned to re-engineer the existing systems for a company. Do you think that design patterns can be applied to these existing systems?

Shading - polygon rendering and ray tracing methods, Shading - Polygon Rend...

Shading - Polygon Rendering and Ray Tracing Methods When one thing is under the exposure of light, so the rays of light are distributed over the surface and there the distribu

Sub classes of orthographic projection, Sub Classes of Orthographic Project...

Sub Classes of Orthographic Projection There are three ordinary sub-classes of Orthographic (axonometric) projections as: 1) Isometric: The direction of projection makes

Sutherland cohen line clipping algorithm, Describe briefly Sutherland Cohen...

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

Explain what is the bleed and its purposes, QUESTION (a) Name the space...

QUESTION (a) Name the spaces and guides in the Figure below                 (b) What is the difference between Pantone and Process colors? Elaborate (c) Explain what i

Trivial acceptance case of cohen sutherland line clippings, Trivial accepta...

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000

Interlaced gif, Interlaced GIF: The conventional which is non-interlaced G...

Interlaced GIF: The conventional which is non-interlaced GIF graphic downloads one line of pixels at one time from top to bottom and browsers display all lines of the image as it

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.

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