Modify the dda algorithm for negative sloped lines, Computer Graphics

Assignment Help:

1. Modify the DDA algorithm for negative sloped lines; discuss both the cases i.e., slope > 1 and 0 < slope < 1.

28_Modify the DDA algorithm for negative sloped lines.png

 

Ans. For the generation of lines along with negative slopes as:

 Slope < 1: successively raise y and respectively reduces x

Slope > 1: successively raise x and respectively reduces y

Aliter: This hint will use further.

As the shown above figure say L1 and L2 are lines along with -ive slope along with a magnitude of <1 and >1 respectively. So for the generation of that line, you may take reflection of the line regarding the concerned axis and obey the general algorithm of line generation. So then you may inverse reflection the transformation and this will offer you the line generation of -ive slope.


Related Discussions:- Modify the dda algorithm for negative sloped lines

Produce a complete 3d cad model, 1. Identify the market segment for the pro...

1. Identify the market segment for the product and write a basic PDS 2. Produce three concept sketch ideas - (remember the assignment is a CAD one not a concept creative design

Define refresh rate and refresh buffer, Refresh Rate: refreshing on raster...

Refresh Rate: refreshing on raster - scan displays is carried out at the rate of 60 to 80 frames per second, although some system are designed for higher refresh rates. Sometimes,

Compute the position of the car on the road, An animation demonstrates a ca...

An animation demonstrates a car driving along a road that is given by a Bezier curve along with the subsequent control points:  X k 0 5

Basic structures for multimedia interactive applications, Question: (a)...

Question: (a) Sound often gives the only effective way to convey an idea, elicit an emotion, or dramatise a point. Explain two situations of the use of sound that would be con

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

Carry out a perspective projection, Consider the line segment AB in 3-Dimen...

Consider the line segment AB in 3-Dimentional parallel to the z-axis along with end points A (- 5,4,2) and also B (5,-6,18). Carry out a perspective projection upon the X=0 plane;

Flat panel, help me discuss about flat panel with respect to emissive and n...

help me discuss about flat panel with respect to emissive and non emissive display

For orthographic parallel projection, For orthographic parallel projection:...

For orthographic parallel projection:    glOrtho(left, right, bottom, top, near, far);  glOrtho2D(left, right, bottom, top);    Here left, right define the x-direction ex

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