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

Polygon clipping algorithm, Write a polygon clipping algorithm to clip a po...

Write a polygon clipping algorithm to clip a polygon against rectangular clipping are. Read the vertices of polygon to be clipped. 2. Read the coordinates of the rectangular cl

Homogeneous coordinates, What are the uses of homogeneous coordinates? Conv...

What are the uses of homogeneous coordinates? Convert translation rotation and scaling in homogeneous coordinates. In mathematics homogeneous coordinates introduced by August

PERT , Program of PERT in c language

Program of PERT in c language

Geometric continuity - properties of bezier curves, Geometric continuity - ...

Geometric continuity - Properties of Bezier Curves Geometric continuity is the other process to join two successive curve sections. G 0 continuity is the similar as parametri

Voltage or electro-magnetic field tablet and pointer, (a)  Voltage or Elect...

(a)  Voltage or Electro-Magnetic Field Tablet and Pointer: This has a grid of wires, embedded in the tablet surface along with various voltages or magnetic fields consequent to va

What is the maximum number of objects such can be handled, What is the maxi...

What is the maximum number of objects such can be handled via the depth/z- buffer algorithm? Solution : In z-buffer algorithm, an arbitrary number of objects can be handled sin

What is seed fill, What is seed fill?  One way to fill a polygon is to ...

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel

Scan-line method, In contrast to depth-buffer method, here we identify one ...

In contrast to depth-buffer method, here we identify one surface at one time, scan-line method deals along with multiple surfaces. Since it processes each scan-line at one time, al

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