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

Illustration of bezier curves - modeling and rendering, To prove ‾P (1) = p...

To prove ‾P (1) = p n Solution : since in the above case we determine each term excluding B n,n (u) will have numerous of (1 - u) i (i = 0 to n) consequently by using u = 1

What is automatic data capture, Automatic Data Capture There are numero...

Automatic Data Capture There are numerous techniques available to collect data automatically without the need for manual entry. Manual entry is slower, more costly (need to emp

Transformation, determine the form of the transformation matrix for a refle...

determine the form of the transformation matrix for a reflection about an arbitrary line with equation y=mx+b.

Performing rotation about an axis, Performing rotation about an Axis Fo...

Performing rotation about an Axis For performing rotation about an axis parallel to one of the coordinate axes (say z-axis), you first need to translate the axis (and hence the

Dda program to plot line segments, Use DDA algorithm to get the output of y...

Use DDA algorithm to get the output of your program as shown in Figure ANs: Use DDA( ) function to plot line segments that have end points on diametrically opposite points

Image precision and object precision, Q.   What do you mean by image precis...

Q.   What do you mean by image precision and object precision? Describe z- buffer algorithm for visible surface detection. OR What do you mean by image precision and obj

Application of sutherland hodgman polygon clipping, For good understanding ...

For good understanding of the application of the rules specified above see the following figure, where the shaded region demonstrates the clipped polygon. Fi

Design a bitmap for the english vowels, 1. Design a bitmap for the English ...

1. Design a bitmap for the English vowels A, E, I, O, U for two different sizes and then implement the bitmaps to plot these vowels on the display. Keep in mind that baseline of al

Definition of computer animation, Definition of Computer Animation A ti...

Definition of Computer Animation A time dependence phenomenon for imparting visual modifies in any scene as per to any time sequence, the visual modifies could be incorporated

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