Dda program to plot line segments, Computer Graphics

Assignment Help:

Use DDA algorithm to get the output of your program as shown in Figure

2008_DDA program to plot line segments.png

ANs: Use DDA( ) function to plot line segments that have end points on diametrically opposite points on the circumference of a circle.  Take these points on uniform distance.  For example, you may use the following function CirclePoints() to get line segment endpoints (x1 [i], y1[i])  and (x2[i], y2[i]), i=0,1,....5 and use the array 2 y ,2 x ,1y ,1x  as input to your dda() function. Call the DDA function six times as given in plot Lines code below. 

// Compute points on the circumference of a circle.

int Points(int r, int xc, int yc, int x1[6], int y1[6],int

x2[6], int y2[6])

{

 float pi = 3.1416;

 int i=0;

 for(float theta = 0; theta

 {

  x1[i] = xc + r*cos(theta);

  y1[i] =yc+r*sin(theta);

  x2[i] = xc + r*cos(pi+theta);

  y2[i] =yc+r*sin(pi+theta);

  i++;

 }

return x1[6], y1[6], x2[6],y2[6];

}

//Plot line segments using DDA algorithm

void plotLines()

{

 int xx1[6],yy1[6],xx2[6],yy2[6];

 Points(100, 200, 200, xx1, yy1, xx2,yy2);

 for(int i=0;i<=5;i++)

  dda(xx1[i], yy1[i], xx2[i], yy2[i]);

}  

Add the above code in your program for line segment generation using dda() function and call the function plotLines in your RenderScene() function.


Related Discussions:- Dda program to plot line segments

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

Calculate the gray level value for all the pixels, An 8x8 image f[i,j] has ...

An 8x8 image f[i,j] has gray levels given by the following equation: f [i , j]= ? i-j ? ; i,j=0,1,2,3,4,5,6,7. a. Calculate the gray level value for all the pixels in the 8x8

Bezier curves - 2d shape primitives, Bezier curves: Theses are special...

Bezier curves: Theses are special polynomial curves expressed using Bernstein polynomials. Spline curves are simple extensions of Bézier curves composed of two or more polynom

Region filling, what is region filling? give details

what is region filling? give details

Categories of line segments - 2d clipping algorithms, Categories of Line Se...

Categories of Line Segments It categorizes line segments into three categories (i) trivially rejected (ii) trivially selected (iii) may be partially visible or totally invisibl

Prepare an initial sorted edge list, Q: For the following polygon, prepare ...

Q: For the following polygon, prepare an initial sorted edge list and then make the active edge list for scan lines y = 5,20,30,35 Coordinates of the vertices are as shown in Figur

Card or page based tools, Card or Page Based Tools : In these authoring sy...

Card or Page Based Tools : In these authoring systems, components are organized as pages of a book or a stack of cards. Thousands of pages or cards may be obtainable in the stack

Gourand shading or intensity interpolation scheme, Gourand shading OR Inten...

Gourand shading OR Intensity interpolation scheme Now there polygon is rendered through linearly interpolating intensity values across the surface. Intensity values for all po

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