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

Explain about unified memory architecture, Q. Explain about Unified Memory ...

Q. Explain about Unified Memory Architecture? UMA signifies Unified Memory Architecture. It is an architecture that reduces the cost of PC construction.  In this a part of main

Ray tracing - polygon rendering and ray tracing methods, Ray Tracing - Poly...

Ray Tracing - Polygon Rendering and Ray Tracing Methods Basically Ray tracing is an exercise that is performed to attain the realism in a scene. In easy way Ray Tracing is a w

How to identify window area - raster graphics and clipping, A convex polygo...

A convex polygonal region having n- vertices {P 0 , P 1 , P 2 ..., P n - 1 , P n , P 0 } or lattice points to be identified by the user includes the convex window area. To be exact

Types of animation systems - computer animation, Types of Animation Systems...

Types of Animation Systems - Computer Animation We have discussed above about the sequencing of animation is helpful in developing any animation. Such sequencing is more or le

Cases for digital differential analyzer algorithm, Cases for Digital Differ...

Cases for Digital Differential Analyzer Algorithm 1)  If in case 1, we plot the line another way round that is, moving in y direction via 1 unit every time and after that hunt

Disadvantages of the z-buffer method, Disadvantages : 1)   Doubles memor...

Disadvantages : 1)   Doubles memory needs, one for at least z-buffer and one for refreshes- buffer. 2)   Dependency of device and memory intensive. 3) Wasted calculation u

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

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

Curves and surfaces - modeling and rendering, Curves and Surfaces - Model...

Curves and Surfaces - Modeling   and Rendering We have studied the method of drawing curves in diverse coordinate systems. Also we got the concept that it is the revolution of

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