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

Interlaced gif, Interlaced GIF: The conventional which is non-interlaced G...

Interlaced GIF: The conventional which is non-interlaced GIF graphic downloads one line of pixels at one time from top to bottom and browsers display all lines of the image as it

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

Display devices - graphics hardware, Display Devices - Graphics Hardware ...

Display Devices - Graphics Hardware Since the importance of output and input devices has been discussed over, so let us now focus our discussion particularly on display dev

Taxonomy of projection - viewing transformation, Taxonomy of Projection - v...

Taxonomy of Projection - viewing transformation There are different types of projections as per to the view that is essential. The subsequent figure 3 demonstrates taxonomy o

B-spline curves - clipping and 3d primitives, B-spline curves - clipping an...

B-spline curves - clipping and 3d primitives B-spline curves are piecewise polynomial cubes with one or more polynomial pieces with a minimum smoothness requirement.  For examp

Explain what the term blocking means in animation, Question 1: (a) Exp...

Question 1: (a) Explain what are Final Gathering and Global Illumination and state why you would use those features when you render in MAYA. (b) List clearly the steps in

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Transformation for parallel projection, Transformation for parallel project...

Transformation for parallel projection Parallel projections is also termed as Orthographic projection, are projections into one of the coordinate planes as x = 0, y = 0 or z

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