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

Introduction of visible surface detection, Introduction of Visible Surface ...

Introduction of Visible Surface Detection For displaying a realistic presentation of the given 3Dimentional object, hidden surfaces and hidden lines should be identified fo

Ray casting - polygon rendering and ray tracing methods, Ray Casting -polyg...

Ray Casting -polygon rendering and ray tracing methods It is a method wherein the surfaces of objects visible to the camera are determined by throwing or say casting rays of

Classification of print finishing processes, Problem: a. Provide exampl...

Problem: a. Provide examples of classification of print finishing processes. b. In advertising, what do you meant by creative strategies? c. Creative strategies are div

Basic graphics and mouse events, For this assignment, you will program a ga...

For this assignment, you will program a game called Pig. Pig is a two-player game where players compete to be the first to reach (or surpass) 100 points. Pig usually involves playe

Opengl, difference between gl,glu and glut

difference between gl,glu and glut

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Acquire the perspective transformation, Acquire the perspective transformat...

Acquire the perspective transformation onto z = - 2 Plane, where (0, 0, 18) is the center of projection. Solution: Now centre of projection, C (a, b, c) = (0, 0, 18) ∴ (n 1

Painting and drawing, Painting and Drawing While we talk about graphic...

Painting and Drawing While we talk about graphics, we mean pictures can be either photographs or illustrations. If you want to acquire graphics into a Web page or multimedia r

Audio and video, AUDIO AND VIDEO: Audio and video are working as eye and e...

AUDIO AND VIDEO: Audio and video are working as eye and ear of multimedia. Both of them are heavily contributing to any type of multimedia application. Here we discuss something r

Curve clipping and character clipping, Curve Clipping and Character Clippin...

Curve Clipping and Character Clipping As you proceed further, you would see that the methods for curve clipping and character clipping have also been developed based on boundin

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