Page 58 - DCAP313_LAB_ON_COMPUTER_GRAPHICS
P. 58

Lab on Computer Graphics



                   Notes         3.5 Keywords

                                 Magnitude: Magnitude is the “size” of a mathematical object, a property by which the object
                                 can be compared as larger as or smaller than other objects of the same kind.
                                 Pen-plotter: The plotter is a computer printer for printing vector graphics. In the past, plotters
                                 were  used  in  applications  such  as  computer-aided design,  though  they  have  generally  been
                                 replaced with wide-format conventional printers.

                                 Pixels: A pixel (picture element) is a physical point in a raster image, or the smallest, addressable
                                 element in display; so it is the smallest, controllable element of a picture represented on the screen.
                                 Pseudo: A pseudo-event is an event or activity that exists for the sole purpose of the media
                                 publicity and serves little to no other function in real life.
                                 Quantization: Quantization is the procedure of constraining something from a relatively large
                                 or continuous set of values (such as the real numbers) to a relatively small discrete set.
                                 Translation: A translation moves all points of an object a fixed distance in a specified direction.
                                 It can also be expressed in terms of two frames by expressing the coordinate system of object
                                 in terms of translated frames.
                                 3.6 Review Questions


                                    1.  What is the concept of implementing line algorithm?
                                    2.  Explain the types of implementing line algorithm.
                                    3.  Discuses the Bresenham’s Algorithm.

                                    4.  What is the DDA Line Algorithm?
                                    5.  Write a program in C code the DDA line algorithm.

                                    6.  Write a C program Bresenham’s Algorithm.
                                    7.  Explain the integer Bresenham’s algorithm.
                                    8.  Explain the all steps of line DDA algorithm.
                                    9.  Write advantages and disadvantages of DDA algorithm.

                                   10.  Explain the integer Bresenham’s algorithm for lines with arbitrary endpoints.
                                 Answers for Self Assessment Questions

                                     1.  (a)    2.  (b)       3.  (c)     4.  (d)         5.  (b)
                                     6.  (a)    7.  (a)       8.  (a)     9.   (c)       10.  (c)
                                    11.  (a)   12.  (a)      13.  (b)    14.  (a)        15.  (b)

                                 3.7 Further Readings



                                                Introduction to computer graphics, by Krishnamurthy

                                                Comprehensive Computer Graphics, by V.K. Pachghare


                                                http://www.cglabprograms.com/2008/10/dda-line-drawing-algorithm.html



        52                                LOVELY PROFESSIONAL UNIVERSITY
   53   54   55   56   57   58   59   60   61   62   63