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

Write c program which takes points as input from mouse click, Write a C pro...

Write a C program which takes points as input from mouse clicks (left button) and then performs an action.  Apply your program to generate a closed polygon as follows: Every time a

Remark for perspective projection - transformation, Remark for Perspective ...

Remark for Perspective projection - Transformation A Perspective projection can have at most three Principle Vanishing points and at any rate one Principle vanishing point. To

Horizontal retrace - display devices, Horizontal retrace - Display Devices ...

Horizontal retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the left most point on the next horizontal line after refresh

What is the feature of inkjet printers, What is the feature of Inkjet print...

What is the feature of Inkjet printers? Features of inkjet printers: They can print 2 to 4 pages/minutes. Resolution is about 360d.p.i. Thus better print quality is achie

Example of bezier curves - modeling and rendering, To prove: P (u = 0) = p0...

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

Transformation for 3-d shearing, Transformation for 3-D Shearing 2-dim...

Transformation for 3-D Shearing 2-dimensional xy-shearing transformation, as explained in equation, can also be simply extended to 3-dimensional case. All coordinates are tran

Dda and bresenhem line drawing algorithm, when dda algorithm is more effici...

when dda algorithm is more efficient than bresenhem line drawing algorithm

What happens while two polygons have similar z value , What happens while t...

What happens while two polygons have similar z value and the z-buffer algorithm is utilized? Solution : z-buffer algorithms, varies colors at a pixel if z(x,y)

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