Draw a long line segment using dda line drawing algorithm, Computer Graphics

Assignment Help:

Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from Bresenham line segment or the graphics library line segment. 

Answer: Implementation of Bresenham and DDA algorithm is already given on page 20-21 of this unit.  Use the code to draw a line segment (10, 20) - (1020, 700) using both the algorithms.  Further, we draw the same line segment by adding the following code in the RenderScene( ) function of the code using the following OpenGL library function.    

glBegin(GL_LINES);

   glVertex2i(1020,700);

   glVertex2i(10,20);

   glEnd();  

Use a different colour for each of the three codes. Accordingly code of RenderScene( ) will be modified as follows:   

void RenderScene(void)

{

glClear(GL_COLOUR_BUFFER_BIT);

glColour3f(1.0f, 0.0f, 0.0f);    

bresenham(10,20,1020,700);//Bresenham line segment with RED

   glColour3f(0.0f, 1.0f, 0.0f);        

  dda(10,20,1020,700); //dda line segment with GREEN

  glColour3f(1.0f, 1.0f, 1.0f);        

  glBegin(GL_LINES);

   glVertex2i(1020,700);

   glVertex2i(10,20);

  glEnd(); //OpenGl Line segment with WHITE

        glFlush();   

}

On present day systems with very high accuracy on floating point calculations all the three line segments are plotting almost the same line segment. However, if you run the same program on an older system, you would find that the pixels generated by DDA algorithm are slightly away from the two line segments that have been generated using Bresenham algorithm and OpenGL function. The OpenGL function and Bresenham algorithm produce almost the same line segments.


Related Discussions:- Draw a long line segment using dda line drawing algorithm

Advantages and deficiencies of gourand shading, Advantages and Deficiencies...

Advantages and Deficiencies of Gourand Shading Advantages of Gourand Shading: this eliminates the intensity discontinuities related with the constant shading model. Defi

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

Region filling, what is region filling? give details

what is region filling? give details

Geometric continuity - properties of bezier curves, Geometric continuity - ...

Geometric continuity - Properties of Bezier Curves Geometric continuity is the other process to join two successive curve sections. G 0 continuity is the similar as parametri

Rotation about an arbitrary axis, Rotation about an arbitrary axis Rota...

Rotation about an arbitrary axis Rotation about an arbitrary axis is a composition of several rotations and translation operations. What you need to do is the following:  a)

Graphics image processing-image processing, Graphics Image Processing: The...

Graphics Image Processing: The most generally utilized software is: Photoshop. Characteristics: I.          Most general image processing software. II.         Focuses upon

Classic applications of digital video, The table as given below demonstrate...

The table as given below demonstrates possible values of such parameters for classic applications of digital video. Application                  Frame rate                  Dime

Potentially entering and leaving points - clipping, Potentially entering an...

Potentially entering and leaving points - P E and P L The intersection point of the line and window might be classified either like potentially leaving or entering. Before g

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