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

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

B splines, What is uniform rational splines

What is uniform rational splines

What is cubic spline, What is cubic spline?  Cubic splines are a straig...

What is cubic spline?  Cubic splines are a straight forward extension of the methods underlying parabolic spline. The total curve in this case is a sequence of arcs of cubic ra

Proof of subsequent properties of bezier curves, Proof of subsequent proper...

Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P

Computer science, what do you means by bresenham s him algorithm

what do you means by bresenham s him algorithm

Description of the particularities of each drawing style, Question: (a)...

Question: (a) There are 3 main industries of drawing style and it has become a phenomenon. It was inspired by internationally diffused cartoons, comic strip books and since the

What are the steps to mapping artwork to an object, Question 1: (a) How...

Question 1: (a) How can you select and manipulate individual objects in a group? (b) How do you resize an object? Explain how you determine the point from which the object r

Education and training, explain in detail the application of computer graph...

explain in detail the application of computer graphics in education and training?

Define b-spline curve, Define B-Spline curve?  A B-Spline curve is a se...

Define B-Spline curve?  A B-Spline curve is a set of piecewise (usually cubic) polynomial segments that pass close to a set of control points. Though the curve does not pass by

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