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

Character generation - output primitives, Character Generation You know...

Character Generation You know that graphics displays often contain components which are text based.  For example graph labels, annotations, descriptions on data flow diagrams,

What are spot colours, Question 1: Name at least four file formats an...

Question 1: Name at least four file formats and explain in detail what they mean and how they are use? Question 2: What are "Process Colours"? Answer in a single para

What is reflection and clipping, What is reflection and clipping? The r...

What is reflection and clipping? The reflection is actually the transformation that makes a mirror image of an object. For this use some angles and lines of reflection.  Cli

Proof of subsequent properties of bezier curves, Proof of subsequent proper...

Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P

Cathode ray tube - graphics hardware, Cathode Ray Tube - Graphics Hardware ...

Cathode Ray Tube - Graphics Hardware Cathode Ray Tube: this is a refreshing display device. The idea of a refreshing display is depicted pictorially is given as: In fact

How many times will vertex appear in the intersection points, 1. For the po...

1. For the polygon shown in Figure on the next page, how many times will the vertex V 1 appear in the set of intersection points for the scan line passing through that point?  How

How does the z-buffer algorithm find out which surfaces, Illustration 1: H...

Illustration 1: How does the z-buffer algorithm find out which surfaces are hidden? Solution : Depth or Z-buffer algorithm employs a two buffer area each of two-dimensional ar

Computer arthcther, How many 128 x 8 RAM chips are needed to provide a memo...

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?

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