Dda or digital differential analyzer algorithm, Computer Graphics

Assignment Help:

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms

From the above discussion we get that a Line drawing is accomplished through calculating intermediate point coordinates along the line path among two specified end points. Because screen pixels are referred along with integer values or plotted positions that may only estimated the calculated coordinates that is pixels that are intensified are those that lie very close to the line path if not accurately on the line path that in this case are exactly horizontal, vertical or 45° lines only. Standard algorithms are available to find out that pixels give the best estimation to the desired line; one that algorithm is the DDA that is Digital Differential Analyzer; algorithm. For the further details of the algorithm, let us discuss several common appearances of the line segment, since the respective appearance decides that pixels are to be intensified. This is also obvious as only such pixels which lie extremely close to the line path are to be intensified since they are the ones that best estimated the line. Apart from the precise situation of the line path, that in this case is exactly horizontal, vertical or 45° lines that is slope zero, infinite or one only. We may also face a situation where the slope of the line is greater than 1 or less then 1.Which is the case shown in following figure.

2432_DDA or Digital Differential Analyzer Algorithm.png

                        Figure: DDA line generation

A mention in figure there are two lines, Line 1 i.e. slope<1 and line 2 i.e. slope>1. According to the discussion, the common mechanism of construction of these two lines all along with the Digital Differential Analyzer algorithm. Since the slope of the line is a crucial factor in its construction, so let us identify the algorithm in two cases depending upon the slope of the line where it is > 1 or < 1.

Case 1: slope (m) of line is < 1 that is line 1: In this condition to plot the lines we should move the direction of pixel in x via 1 unit all time and after that hunt for the pixel value of the y direction that best suits the line and lighten which pixel in order to plot the line. Hence in Case 1:  that is 0 < m < 1 whether x is to be increased then via 1 unit all time and exact y is approximated.

Case 2: slope (m) of line is > 1 that is line 2; if m > 1 that is condition of line 2, then the most suitable strategy would be to move towards the y direction via 1 unit all time and find out the pixel in x direction that best suits the line and acquire which pixel lightened to plot the line. Hence in Case 2: infinity > m > 1 whether y is to be increased via 1 unit every time and exact x is approximated.


Related Discussions:- Dda or digital differential analyzer algorithm

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

Distinguish between convex and concave polygons, Distinguish between convex...

Distinguish between convex and concave polygons? If the line joining any two points in the polygon lies totally inside the polygon then, they are called as convex polygons. If

Color Histograms - Scene Categories, How can I perform feature extraction o...

How can I perform feature extraction on images of different classes? How to obtain a vector of each class that contains its features?

Visible-surface detection, Visible-Surface Detection For the generation...

Visible-Surface Detection For the generation of realistic graphics display you know that hidden surfaces and hidden lines should be identified for removing. For this reason we

Application of coherence in visible surface detection method, explainapplic...

explainapplication of coherence in visible surface detection method

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

Other curves - parabola and hyperbola, Other curves - parabola and hyperbol...

Other curves - parabola and hyperbola Conic sections such as parabola and hyperbola are used in many instances such as in motion planning along a trajectory or in modelling the

What is orthographic parallel projection, What is orthographic parallel pro...

What is orthographic parallel projection?  When the direction of the projection is normal (perpendicular) to the view plane then the projection is called as orthographic paral

Constant intensity shading or flat shading, Constant intensity shading OR F...

Constant intensity shading OR Flat shading  In this technique particular intensity is calculated for each polygon surface that is all points that lie upon the surface of the

Advantages of computer aided design, Advantages of Computer aided design  ...

Advantages of Computer aided design  -   It is simpler to modify drawings  -   A library of parts can be kept  -   Ability to do automatic costings -   Ability to mod

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