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

Functioning of hardcopy devices and output primitives, Functioning of hardc...

Functioning of hardcopy devices and Output primitives 1.  Functioning of hardcopy devices-laser printers and dot matrix printers, plotters.  2.  Output primitives: Graphics

Arithmetic mean filter, QUESTION (a) Describe the following Mean Filter...

QUESTION (a) Describe the following Mean Filters used as Noise Reduction filters: 1. Arithmetic Mean Filter. 2. Geometric Mean Filer. 3. Harmonic Mean Filter. You a

Geometric continuity - clipping and 3d primitives, Geometric Continuity ...

Geometric Continuity There is another notion of continuity called geometric continuity. Although the idea existed in differential geometry, the concept was introduced for geome

Applications of ray tracing - modeling and rendering , Applications of Ray ...

Applications of Ray Tracing Thus, you might ask, just what practical utilizes does ray tracing have: a) For vision research, simulation of real-world phenomena, b) Medica

What are the disadvantages of CAD, Disadvantages of CAD - Risk of deski...

Disadvantages of CAD - Risk of deskilling - High training costs to use packages - Can move work overseas     One CAD operator can do work of 5 manual draftsmen

Removing polygons hidden through a surrounding polygon, Removing Polygons H...

Removing Polygons Hidden through a Surrounding Polygon: The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding

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

Categories of reflection - ray tracing methods , Categories of Reflection -...

Categories of Reflection - Ray Tracing Methods In order to achieve realism, such phenomenon of reflection, which occurs because of interaction of light and surface, is require

Horizontal retrace - display devices, Horizontal retrace - Display Devices ...

Horizontal retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the left most point on the next horizontal line after refresh

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