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

Types of animation systems, Types of Animation Systems: Keyframe, scriptin...

Types of Animation Systems: Keyframe, scripting and parameterized •Morphing: object shape's transformation from one form to the other is termed as morphing that is short form

Mathematical description of a perspective projection, Mathematical descript...

Mathematical description of a Perspective Projection A perspective transformation is found by prescribing a center of projection and a viewing plane. Let here assume that P(x

B-spline curves - uniform b-splines and de boor algorithm, B-spline curves ...

B-spline curves are piecewise smooth polynomial curves.  B-spline curves are defined over an interval which has been partitioned into sub-intervals. On each subinterval B-sp

Character generation - output primitives, Character Generation You know...

Character Generation You know that graphics displays often contain components which are text based.  For example graph labels, annotations, descriptions on data flow diagrams,

What do you mean by high definition systems -what is dvst, what do you mean...

what do you mean by high definition systems? Define aspect ratio?  What is a refresh buffer? What is the difference between bitmap and pitman frame buffer? Explain the basic oper

Animation, name some of the standard motion in key frames

name some of the standard motion in key frames

Liang barsky line clipping algorithm, Liang Barsky line clipping algorithm ...

Liang Barsky line clipping algorithm : The algorithm uses parametric form of the line segment.  Four inequalities are created using the parametric form of the line segments.  Th

Area subdivision method-obscures the continuing two surface, Assume here ar...

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5) And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,

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