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

Arithmetic mean filter, QUESTION (a) Describe the following Mean Filter...

QUESTION (a) Describe the following Mean Filters used as Noise Reduction filters: 1. Arithmetic Mean Filter. 2. Geometric Mean Filer. 3. Harmonic Mean Filter. You a

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

Acquire the perspective transformation, Acquire the perspective transformat...

Acquire the perspective transformation onto z = - 2 Plane, where (0, 0, 18) is the center of projection. Solution: Now centre of projection, C (a, b, c) = (0, 0, 18) ∴ (n 1

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Random scan display device - types of refresh monitors, Random Scan Display...

Random Scan Display Device The original cathode ray tube, developed in the late fifties and early sixties, produced charts and pictures, line through line on the tube surface

Unrepresentative vertex normals - modeling and rendering, Unrepresentative ...

Unrepresentative vertex normals - Modeling and Rendering Calculated vertex normals may not adequately present the surface's geometry. For illustration, if we calculate vertex

Crt, working of crt

working of crt

Bezier curves, find out points to the given control points

find out points to the given control points

Silicon graphics - hardware for computer animation, Silicon Graphics - Hard...

Silicon Graphics - Hardware for computer animation The SGI platform is one of the most broadly used hardware platforms in professional or broadcast feature computer animation

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