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

Filled-area primitives - output primitives, Filled-Area Primitives  Fil...

Filled-Area Primitives  Filled-area primitives are one of the most important types of primitives used in Computer Graphics.  Basically filled-area primitives are meant to fill

Exemplify bresenham line generation algorithm by digitizing, Example: Exem...

Example: Exemplify the Bresenham line generation algorithm through digitizing the line along with end points (20, 10) and (30, 18) Solution: m =    (y2 - y1)/( x2 - x1)  =

Visible surface detection - modeling and rendering , Visible Surface Detect...

Visible Surface Detection - Modeling and Rendering Provided a set of 3-Dimentional objects and a viewing position for the generation of realistic graphics show, we want to de

Orthographic and oblique projection - viewing transformation, Orthographic ...

Orthographic and Oblique Projection - Viewing Transformation Orthographic projection is the easiest form of parallel projection that is commonly utilized for engineering drawi

Assumptions for polygon or area clipping algorithm, Assumptions for Polygon...

Assumptions for Polygon or Area Clipping Algorithm Assumption: The viewport and window are rectangular. So only, by identifying the maximum and the minimum coordinates t

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

Important point about the de casteljeau algorithm, Important point about th...

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

Registers, explain the registers used in video controller

explain the registers used in video controller

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

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