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

Horizontal retrace - hardware primitives, Horizontal Retrace - Hardware Pri...

Horizontal Retrace - Hardware Primitives Horizontal retrace refers to the time an electron beam takes to traverse a scan line.Vertical retrace means the time taken by the elect

Categories of reflection - ray tracing methods , Categories of Reflection -...

Categories of Reflection - Ray Tracing Methods In order to achieve realism, such phenomenon of reflection, which occurs because of interaction of light and surface, is require

Referential links, Referential Links: A third type of link is a referentia...

Referential Links: A third type of link is a referential link. It is associated to the associative link. Quite than representing a relationship among two related ideas, a referent

What is the need of homogeneous coordinates, What is the need of homogeneou...

What is the need of homogeneous coordinates?  To perform more than one transformation at a time, use homogeneous coordinates or matrixes. They decrease unwanted calculations in

What is bitmap and what is pixmap, What is bitmap and what is pixmap?  ...

What is bitmap and what is pixmap?  The frame buffer used in the black and white system is called as bitmap which take one bit per pixel. For systems with many bits per pixel,

What do you mean by parabolic splines, What do you mean by parabolic spline...

What do you mean by parabolic splines?  For parabolic splines a parabola is fitted by the first three points p1, p2,p3 of the data array of kot points. Then a second parabolic

Vecgen algorithm, explain vecgen line drawing algorithm

explain vecgen line drawing algorithm

Single point perspective transformation, Single Point Perspective Transform...

Single Point Perspective Transformation - Viewing Transformations In order to derive the particular point perspective transformations beside the x and y-axes, we construct fi

Sequencing of animation design, Sequencing of Animation Design Previous...

Sequencing of Animation Design Previously we have discussed many things regarding the traditional and current trends of computer created animation although now it is time to pr

Cyrus beck algorithm - line clipping algorithm, Cyrus Beck Algorithm - Line...

Cyrus Beck Algorithm - Line Clipping Algorithm Cyrus Beck Line clipping algorithm is actually, a parametric line-clipping algorithm. The term parametric means that we requi

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