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

Animate 3d articulated character - forward kinematic method, In this progra...

In this programming assignment, you will animate and pose 3D articulated characters by implementing forward and inverse kinematic methods. You should be able to animate character j

Three dimensional concepts and display methods, Three Dimensional Concepts ...

Three Dimensional Concepts and Display Methods   Imagine yourself taking a picture by a camera.  What do you normally do?  You specify a viewpoint and view direction and then s

Finding where the ball hits a segment, You will write a two-dimensional pre...

You will write a two-dimensional precursor of the three-dimensional bouncing ball simulation that is one of your choices for a ?nal project. This involves adding functions to your

Gourand shading, what is ray tracing algorithm in hidden surface removal

what is ray tracing algorithm in hidden surface removal

Exemplify bresenham line generation algorithm by digitizing, Example: Exem...

Example: Exemplify the Bresenham line generation algorithm through digitizing the line along with end points (20, 10) and (30, 18) Solution: m =    (y2 - y1)/( x2 - x1)  =

3D transformation, what are the steps involved in 3D transformation

what are the steps involved in 3D transformation

Zero acceleration (constant speed), Zero Acceleration (Constant Speed ) ...

Zero Acceleration (Constant Speed ) Now, the time spacing for the in-betweens that is: in-between frames is at equal interval; which is if, we want N in-betweens for key frames

Define polygon, Define polygon?  A polygon is any closed continues sequ...

Define polygon?  A polygon is any closed continues sequence of line segments i.e., a polyline whose last node point is similar as that of its first node point. The line segment

Ray tracing algorithm, Ray Tracing:  Ray t racing is the technique to dete...

Ray Tracing:  Ray t racing is the technique to determine which objects in the scene are visible.  In this to identify the visible surface for each pixel we continue to bounce the

Polygon -rendering methods, Polygon -Rendering Methods Now we will see...

Polygon -Rendering Methods Now we will see the application of an illumination model to execute the rendering of standard graphics objects that are formed along with polygonal

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