PRACTICAL LIST
1. Implement DDA, Bresenham’s line drawing algorithm. (including all attributes)
2. Implement Circle-generating algorithm.
3. Implement fill-polygon algorithm using YX-Scan and Boundary fill methods.
4. Write a menu-driven program for 2-D transformation.
5. Implement Cohen-Sutherland line clipping algorithm.
6. Implement Nicholl-Lee-Nicholl line clipping algorithm.
7. Write a program for parallel projection.
8. Write a program for perspective projection.
9. Using viewing pipeline and viewing parameters show the different projections of 3-D object.
10. Write an animation program like a game or moving picture etc.
Theory Assignment
1.Explain in brief various applications of computer Graphics.
2.Write Short Note on:
- Refresh CRT
- Raster scan dispaly system & its architecture
- Random scan display system & its architecture
- DVST (Direct View Storage Tubes)
- Flat Panel Dispalys
- Thin-film electroluminescent dispaly
- LED (Light emmitting diode)
- LCD (Liquid Crystal Dispalys)
- I/P devices used in computer graphics system
3.Write the following algorithm & trace it with suitable example.
DDA vector generating algorithm
Bresenham line drawing algorithm
Bresenham mid-point circle generating algorithm
4.Explain in detail various attributes of line & circle.
5.Explain how colur codes are stored in frame buffer in color
raster scan display.
6.Expalin how color function can be used in application program with
monochrome monitor.
7 (i) Explain various Input Devices.
(ii) Explain the following terms
a) Pixel
b) Resolution
c) Frame Buffer
d) Scan Conversion
8 (i) Explain in detail the working of Refresh CRT.
(ii) Explain
a) Random Scan Displays
b) Raster Scan Displays
c) Color CRT Monitors
9 Write a detailed note on Pixel Addressing and Object Geometry giving emphasis on Screen Grid Coordinates and maintaining Geometric properties of displayed objects.
10 Derive Bresenham’s Line-Drawing Algorithm and Midpoint Circle Algorithm.
11 (i) Derive Scan-Line Polygon Fill Algorithm.
(ii) Explain the character generation methods with relative merits and demerits.
12. Explain the concept of AntiAliasing and write in detail about all methods
of AntiAliasing.
13. ( i ) Explain General Pivot-Point Rotation and General Fixed-Point
Scaling along with example.
( ii ) Write a note on Reflection & Shear along with suitable example.
14. Explain the pipeline for transforming a view of World-coordinate scene
to Device coordinates with schematic blocks. Also derive window to
View Port coordinate transformation.
15.Define point clipping & line clipping. Also derive Cohen-Sutherland line
clipping algorithm and Sutherland-Hodgeman Polygon clippin algorithm
16 (i) Show that the transformation matrix for a reflection about the line y=x, is Equivalent to reflection relative to the x axis followed by a rotation of 90 degrees.
(ii) The vertices of a triangle ABC are A:(2,0), B:(12,0) and c:(2,10). The
triangle is scaled with respect to fixed point (2,0) by the factors x=2&
y=0.5 then the triangle is rotated about origin by 60 degree. Calculate
the vertices of the transformed triangle.
