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

Explain vector graphics and raster graphics, Question: (a) In computer...

Question: (a) In computer graphics it is important to distinguish between the two approaches to graphical modeling:vector graphics and raster graphics. Explain in details th

Applications of computer graphics, Applications of Computer Graphics Wh...

Applications of Computer Graphics When you begin using a computer and open an application, you simply click on a graphics object, called icon. When you watch TV, several times

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

Psychrometric properties - design project, Read the next page and work thro...

Read the next page and work through the steps: a.  Select a location (anywhere in the world) and research the typical weather (temperature, barometric pressure, and humidity).

Trivial rejection case of cohen sutherland line clippings, Trivial Rejectio...

Trivial Rejection Case of cohen sutherland line clippings Case: it  is Trivial Rejection Case; if the logical intersection (AND) of the bit codes of the end points P, Q of

Graphical User interface and interactive input methods, all details of Grap...

all details of Graphical User interface and interactive input methods

Merits -phong shading or normal vector interpolation shading, Merits -Phong...

Merits -Phong shading or Normal Vector Interpolation Shading Hence by finding intensities at various points across the edge we determine the intensity that is varying across t

Describe the elements of design pattern, Question: (a) Using suitable ...

Question: (a) Using suitable examples, explain the following basic principles of design: (i) Proximity (ii) Repetition (iii) Contrast (iv) Alignment. (b) Color h

Steps for clip a line segment-pq, Steps for clip a line segment-PQ ...

Steps for clip a line segment-PQ Initially, find all the points of intersections of the line segment PQ along with the edges of the polygonal window and describe them eith

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