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

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

Vertical retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the top, left most point on the monitor after refreshing all ho

List out the various text clipping, List out the various Text clipping?  ...

List out the various Text clipping?  All-or-none string clipping -if all of the string is inside a clip window, keep it or else discards. All-or-none character clipping - disca

Steps of cohen sutherland line clipping algorithm, Cohen Sutherland line cl...

Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

Interactive picture construction techniques, Explain the interactive pictur...

Explain the interactive picture construction techniques.    interactive picture- construction methods are commonly used in variety of applications, including design and painting pa

Bezier curves - 2d shape primitives, Bezier curves: Theses are special...

Bezier curves: Theses are special polynomial curves expressed using Bernstein polynomials. Spline curves are simple extensions of Bézier curves composed of two or more polynom

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

For orthographic parallel projection, For orthographic parallel projection:...

For orthographic parallel projection:    glOrtho(left, right, bottom, top, near, far);  glOrtho2D(left, right, bottom, top);    Here left, right define the x-direction ex

Shading - polygon rendering and ray tracing methods, Shading - Polygon Rend...

Shading - Polygon Rendering and Ray Tracing Methods When one thing is under the exposure of light, so the rays of light are distributed over the surface and there the distribu

View volumes and general projection transformations, View Volumes and Gener...

View Volumes and General Projection Transformations You have to remember that the view volume is the volume which sets up near and far extents, top and bottom extents and left

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