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

Liquid crystal display - graphics hardware, Liquid Crystal Display - Graphi...

Liquid Crystal Display - Graphics Hardware It is a type of display utilized in digital watches and several portable computers. These work along with polarized ambient as outsi

Utility purpose of display processor in the graphic system, Explain the uti...

Explain the utility and purpose of display processor in the graphic system.  The purpose of the display processor is to free the CPU from the graphics chores. A major task of the d

Graphics image processing-image processing, Graphics Image Processing: The...

Graphics Image Processing: The most generally utilized software is: Photoshop. Characteristics: I.          Most general image processing software. II.         Focuses upon

Important points for bresenham line generation algorithm, Important points ...

Important points for Bresenham Line Generation Algorithm Note: Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry

Military-applications for computer animation, Military: In order to enter ...

Military: In order to enter the military, one has to go by various training. Depending upon whether you want to be in the army, navy or the marines, you may be working along with

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

Applications that can handle bitmap data, Applications that can handle Bitm...

Applications that can handle Bitmap Data Hundreds of applications are there in the market which can be used to modify or make bitmap data. For illustration: Adobe Photo Shop, C

C++ programming, self test exercise 17 asked you to overload the operator >...

self test exercise 17 asked you to overload the operator >> and the operator Overload biinary operator + to add pairs according to the rule (a, b) + (c, d) = (a + c, b, + d) overl

Medicine-applications for computer animation, Medicine: this is very tough...

Medicine: this is very tough for a doctor to get inside a living human body and to observe what is occurrence. Computer animation once again comes in very helpful. Every particula

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