Downloaded 16 times
Course plan computer graphics lab
- 1. Format No. QSP/7.1/01.F01(B) Issue No.04 Rev. No 4 Dated: June 7, 2014 _____________________________________________________________________________________________ UNIVERSITY OF PETROLEUM & ENERGY STUDIES College of Engineering Studies Dehradun ______________________________________________________ COURSE PLAN Programme : B.Tech (CSE) with (CC&VT/MFT/OSS/OGI/TI/BAO) Course : Computer Graphics Lab Subject Code : CSEB 324 No. of credits : 2 Semester : Sixth Semester Session : Jan 2015- July 2015 Batch : 2011-2015 Prepared by : Pankaj Badoni Email : pbadoni@ddn.upes.ac.in Approved By _______________________ _______________________ HOD Dean UPESCampus Tel : +91-135-2770137 “Energy Acres” Fax : +91 135- 27760904 P.O.Bidholi, Via Prem Nagar Website : www.upes.ac.in
- 2. COURSE PLAN Subject: ComputerGraphics Course: B.Tech (CSE) with (CC&VT/MFT/OSS/OGI/TI/BAO) Duration: Jan 2015- July 2015 Subject code: CSEB 324 One Session: 60 Minutes A. OBJECTIVES: (a) The Course objective is to provide overview on basics of computer graphics and creation of 3D objects.Uponthe completionof thiscourse learnerswill be havingdetailedknowledge of the graphics algorithms. (b) The course focusesonall aspectsof fundamental computergraphics,including 2D/3D Object representations,transformations,modelingandrenderingalgorithms.Particular emphasis is given on rendering algorithms for generating photo-realistic scenes with the help of illumination and reflection models and texture mapping techniques. (c) It will be foundingblockforthe advancedtopicslikeAdvancedcomputergraphicsandVirtual reality. B. COURSE OUTLINE S.no Unit Contents 1. Unit-1 Introduction to computer graphics & graphics systems 2. Unit-2 Scan conversion 3. Unit– 3 2D transformation & viewing 4. Unit– 4 3D transformations 5. Unit– 5 Curves 6. Unit– 6 Hidden surfaces
- 3. 7. Unit– 7Color & shading models 8. Unit- 8 Image Processing 9. Unit– 9 Storage and Modeling EXPERIMENTNO – 1 TITLE: Working withGraphics.h I. Understand the graphics header file and write some programusing all predefined function in it(draw somebasic pictures) EXPERIMENTNO – 2 TITLE: scan conversionof basic drawing I. Write an interactive programto printa line using DDA algorithm for all value of the slope. II. Write an interactive programto printa line using Bresenham’s algorithm for all value of the slope. III. Write an interactive programto printa circle using Bresenham’s algorithm for all value of the slope. IV. Write an interactive programto printan ellipse using Bresenham’s algorithm for all value of the slope. EXPERIMENTNO – 3 TITLE: Filling -Area I. Write an interactive program to fill the polygon usingscan lines. II. Write an interactive program to fill the circle using scan lines. III. Write an interactive program to fill the ellipse usingscan lines. IV. Write an interactive program to fill a region usingboundary fill algorithm using4 connected and 8 connected pixels.
- 4. V. Write aninteractive program to fill a region usingflood fill algorithm using4 connected and 8 connected pixels. EXPERIMENTNO – 4 TITLE: Basic Two Dimensional Transformations I. Write an interactive program for followingbasic transformation. A. Translation B. Rotation C. Scaling D. Reflection about axis. E. Reflection about a line Y=mX+cand aX+bY+c=0. F. Shear about an edge and about a vertex. II. Write an interactive program for compositetransformation. EXPERIMENTNO – 5 TITLE: two dimensional transformationsfor basic drawing I. Apply 3-D Transformations on Experiment 4. EXPERIMENTNO – 6 TITLE: Viewing and Clipping I. Write an interactive program for window and viewport mapping. II. Write an interactive program for pointclipping. III. Write an interactive program for line clippingusingCohen Sutherland line clippingalgorithm. IV. Write an interactive program for line clippingusingLiang- Barsky line clippingalgorithm. V. Write an interactive program for polygon clippingusing Sutherland – Hodgeman polygon clippingalgorithm.
- 5. VI. Write aninteractive program for polygon clippingusingWeiler –Atherton polygon clippingalgorithm. F. SUGGESTEDREADINGS: TEXT BOOKS:(BOOKBANK) Computergraphicsc version,D.Hearnand M.P. Baker,PearsonEducation. REFERENCE BOOKS: ComputerGraphicsPrincipal andPractice,2nd editionJ.Foley,A.VanDam, Feinerand Hughes. ComputerGraphicsUsingOpenGL,F. S. Hill jr,PearsonEducation GUIDELINES Cell Phones and other Electronic Communication Devices: Cell phones and other electronic communication devices (such as Blackberries/Laptops) are not permitted in classes during Tests or the Mid/Final Examination. Such devices MUST be turned off in the class room. E-Mail and LMS: Each student in the class should have an e-mail id and a pass word to access the LMS system regularly. Regularly, important information – Date of conducting class tests, guest lectures, via LMS. The best way to arrange meetings with us or ask specific questions is by email and prior appointment. All the assignments preferably should be uploaded on LMS. Various research papers/reference material will be mailed/uploaded on LMS time to time. Attendance: Students are required to have minimum attendance of 75% in each subject. Students with less than said percentage shall NOT be allowed to appear in the end semester examination. Passing criterion: Student has to secure minimum 30%/40% marks of the “highest marks in the class scored by a student in that subject (in that class/group class)” individually in both the ‘End-Semester examination’ and ‘Total Marks’ in order to pass in that paper.
- 6. Passing Criterionfor B. Tech: minimum 30% of the highest marks in the class Passing Criterion for M. Tech: minimum 40% of the highest marks in the class