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

Plane equation - spatial orientation of the surface element, Plane equation...

Plane equation - spatial orientation of the Surface Element For some of Plane equation procedures, we have information regarding the spatial orientation of the individual surf

Scan line algorithm and seed fill algorithm, Scan line algorithm and seed f...

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr

Image classification, The image classification is the process to categorize...

The image classification is the process to categorize images into one of several classes or categories. In this project, there are seven categories (Piano, Kangaroo, Strawberry, Su

Point clipping - 2-d viewing and clipping, Point clipping - 2-d viewing and...

Point clipping - 2-d viewing and clipping Point clipping is the method related to suitable display of points in the scene, though this type of clipping is utilized less freque

Introduction of polygon rendering and ray tracing method, Introduction of P...

Introduction of Polygon Rendering and Ray Tracing Method Different type of sources of light and the reflections generated by the object in exposure of these sources. As an obje

Transformation for 3-d scaling, Transformation for 3-D Scaling As we a...

Transformation for 3-D Scaling As we already seen that the scaling process is mainly utilized to change the size of an object. The scale factors find out whether the scaling i

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

What do you understand by the term image compositing, Question 1: (a) E...

Question 1: (a) Explain in detail what you understand by the term image compositing and where it is more often used? (b) You are given 3-5 images to make a photo montage/ima

Problem with interpolated shading - polygon rendering, Problem with Interpo...

Problem with Interpolated Shading There are several more shading models that intermediate in complication among Gouraud and Phong shading, linking the liner interpolation of t

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

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