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

Basic ray tracing algorithm - polygon rendering, Basic Ray Tracing Algorith...

Basic Ray Tracing Algorithm - Polygon Rendering The Hidden-surface removal is the most complete and most versatile method for display of objects in a realistic fashion. The co

Basic approaches for visible surface determination, Basic Approaches for Vi...

Basic Approaches for Visible Surface Determination There are two basic approaches for visible-surface determination, as per if they deal along with their projected images or a

Problem with interpolated shading - polygon rendering, Problem with Interpo...

Problem with Interpolated Shading There are several more shading models that intermediate in complication among Gouraud and Phong shading, linking the liner interpolation of t

Scale a sphere cantered on the point (1, Scale a sphere cantered on the poi...

Scale a sphere cantered on the point (1, 2, and 3) with radius 1, so that the new sphere has the same centre with radius 2.    Solution: Translate the sphere so that its centre

Composite transformations - 2-d and 3-d transformations, Composite Transfor...

Composite Transformations - 2-d and 3-d Transformations We can build complicated transformations as rotation regarding to an arbitrary point, mirror reflection about a line, a

Image space -approaches for visible surface determination, Image Space Appr...

Image Space Approach -Approaches for visible surface determination The initial approach as image-space, determines that of n objects in the scene is visible at every pixel in

Important point for transformation for isometric projection, Important Poin...

Important Points about the Transformation for isometric projection Note: We can also verify such Isometric transformation matrix through checking all the foreshortening fact

Define pixel and frame buffer, Define pixel and frame buffer? Pixel is ...

Define pixel and frame buffer? Pixel is shortened forms of picture element. Every screen point is referred to as pixel or pel.  Picture definition is kept in a memory area c

Historical method – oral tradition, Historical method - Oral tradition: ...

Historical method - Oral tradition: Only the teacher was the source of information The teacher treated as a role model. The teacher was the main resource to meet indiv

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