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

Example of bezier curves - modeling and rendering, To prove: P (u = 0) = p0...

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Frame buffers - graphics hardware, Frame Buffers - Graphics Hardware ...

Frame Buffers - Graphics Hardware The storage region in a raster scan display system is set as a two-dimensional table. All row-column entry stores information as brightness

What is computer graphics, What is Computer Graphics. Computer graphic...

What is Computer Graphics. Computer graphics remains most existing and rapidly growing computer fields. Computer graphics may be explained as a pictorial representation or gra

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

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

Vecgen algorithm and bresenham line, what is vecgen algorithm and bresenha...

what is vecgen algorithm and bresenham linequestion..

Scan conversion, State the purpose of scan conversion , along with the side...

State the purpose of scan conversion , along with the side effects

Bitmap graphics, Bitmap Graphics: The information below illustrates bitmap...

Bitmap Graphics: The information below illustrates bitmap data. Bitmap images are a set of bits that form an image. The image comprises a matrix of individual dots or pixels wh

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