Draw line segment - digital differential analyzer algorithm, Computer Graphics

Assignment Help:

1. By using Digital Differential Analyzer algorithm draw line segments from point (1,1) to (9,7).

Ans. We see that the usual equation of the line is specified by:

y = mx+c, here m = (y1 - y0/( x1 - x0)

Specified (x0, y0) → (1, 1) ; (x1, y1) → (9, 7)

⇒ m = (7-1)/(9-1) =6/8

C = y1 - mx1 = 7 - (6/8) *9 = 1/4

Consequently, by equation of line (y = mx + c) we contain: 

 y = (6/8)x+(1/4)

  Digital Differential Analyzer Algorithm Two case:

Case 1:   m < 1   

xi + 1 = xi + 1

 yi + 1 = yi + m

Case 2: m > 1   

xi + 1 = xi + (1/m)

yi + 1 = yi + 1

Here m < 1 so as per to Digital Differential Analyzer algorithm case 1

xi + 1 = xi + 1; yi + 1 = yi + m

Specified (x0, y0) = (1, 1)

1) x1 = x0 + 1 = 2

y1 = y0 + m = 1+ (6/8) = 7/4

Place pixel (x0, round y, colour)

That is, put on (2, 2)

Likewise, go on until (9, 7) is arrived at.


Related Discussions:- Draw line segment - digital differential analyzer algorithm

What is scaling and shearing, What is scaling and shearing? The scaling...

What is scaling and shearing? The scaling transformations alters the shape of an object and can be carried out  by multiplying every vertex (x,y) by scaling factor Sx, Sy where

B splines, What is uniform rational splines

What is uniform rational splines

Transform from the world to viewing coordinate system, To transform from th...

To transform from the world coordinate system to viewing coordinate system you need to perform the following operations.  a)  Translate the viewing coordinate origin to the worl

Liang barsky line clipping algorithm, Liang Barsky line clipping algorithm ...

Liang Barsky line clipping algorithm : The algorithm uses parametric form of the line segment.  Four inequalities are created using the parametric form of the line segments.  Th

Define polygon, Define polygon?  A polygon is any closed continues sequ...

Define polygon?  A polygon is any closed continues sequence of line segments i.e., a polyline whose last node point is similar as that of its first node point. The line segment

Ray tracing algorithm - recursive, Ray Tracing Algorithm - Recursive ...

Ray Tracing Algorithm - Recursive Frequently, the basic ray tracing algorithm is termed as a "recursive" acquiring an outcome wherein a given process repeats itself an arbitr

Composite transformation, program to prove 2 consecutive rotation & scaling...

program to prove 2 consecutive rotation & scaling are additive in nature

Ray tracing - polygon rendering & ray tracing methods, Ray Tracing - Polygo...

Ray Tracing - Polygon Rendering & Ray Tracing Methods Ray tracing obeys all rays from the eye of the viewer back to the light sources. The method Ray tracing is very good at

Points and lines - graphic primitives, Points and Lines - Graphic primitive...

Points and Lines - Graphic primitives In the previous section, we have seen to draw primitive objects; one has to firstly scan convert the objects. This concern to the operat

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