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

Scaling, Scaling, shear, reflection and Viewing coordinates 1) Scaling,...

Scaling, shear, reflection and Viewing coordinates 1) Scaling, shear and reflection operations have natural extensions to 3D.    2)  Viewing coordinates are the coordinates

Resolution, ?What is Computer Resolution?

?What is Computer Resolution?

Clipping and 3d primitives, Clipping and 3D Primitives This unit introd...

Clipping and 3D Primitives This unit introduces you to three important concepts of Computer Graphics. After that discusses the concept of clipping, which means removal of objec

Briefly describe what you understand by smoothing, Question: (a) List a...

Question: (a) List and explain different types of lights that can be used in After Effects. (b) How is the density of dots between the boxes in a motion path related to th

Consider shiny surface with diffused reflection coefficient, Consider a Shi...

Consider a Shiny Surface Along With Diffused Reflection coefficient Consider a shiny surface along with diffused reflection coefficient of 0.8 and ambient reflection coeffici

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Cohen sutherland, explain cohen sutherland line clipping algorithm

explain cohen sutherland line clipping algorithm

Computations with phong shading, Computations with Phong Shading Compu...

Computations with Phong Shading Computations involved along with Phong Shading:  i)   Find out average unit normal vector at each polygon vertex. ii)   Linearly interpol

Progressive scan in image capture formats, Progressive Scan: Progressive o...

Progressive Scan: Progressive or non-interlaced scanning is a process which displays, transmits or stores moving images wherein, the lines of all frame are drawn in order. It is i

Functions of hand-held pointer and tablet, The hand-held pointer and tablet...

The hand-held pointer and tablet in the form of a stylus i.e. pen or puck can function one or more of these three functions: (i)  For choosing positions on a drawing or on a men

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