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

Methods for drawing thick lines, Describe any two methods for drawing thick...

Describe any two methods for drawing thick lines. Two method for drawing thick lines are: (1) Using the line- width command: "setline width scale factor (iw)" Line width param

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

How does the z-buffer algorithm find out which surfaces, Illustration 1: H...

Illustration 1: How does the z-buffer algorithm find out which surfaces are hidden? Solution : Depth or Z-buffer algorithm employs a two buffer area each of two-dimensional ar

What are the steps involved in 3d transformation, What are the steps involv...

What are the steps involved in 3D transformation?  Modeling Transformation Projection Transformation Viewing Transformation Workstation Transformation

Procedural animation - computer animation, Procedural Animation - Computer ...

Procedural Animation - Computer Animation This category of animation is utilized to produce real time animation that permits a more diverse series of actions to occur. These a

Advantages and deficiencies of gourand shading, Advantages and Deficiencies...

Advantages and Deficiencies of Gourand Shading Advantages of Gourand Shading: this eliminates the intensity discontinuities related with the constant shading model. Defi

Assumption for digital differential analyzer algorithm, Assumption regardin...

Assumption regarding to the Digital Differential Analyzer Algorithm The line generation by DDA is discussed merely for the first Quadrant, whether the line lies in the other q

Problems at shared vertices - modeling and rendering, Problems at Shared Ve...

Problems at Shared Vertices - Modeling and Rendering Shading discontinuities can arise while two adjacent polygons fail to share a vertex which lies along their common edge.

Define clipping, Define clipping and covering (exterior clipping)? Clip...

Define clipping and covering (exterior clipping)? Clipping is the process of cutting a graphics display to neatly fit a predefined graphics region or the view port.  This is

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