Subject: COMPUTER GRAPHICS Subject code: CSE -303 E

INDEX
S. No. 1 2 3 4 5 6 7 8 9 10 11 Contents Improvement in Lesson Plans Syllabus as per M.D. University Teaching Methodology Teaching Plan Links for Online study material (General: For all subjects) Links for Online study material (Subject specific) Seminar details Assignment details Assignments Student feedback form Monthly report form

MERI - CET DEPTT. OF COMPUTERR SCIENCE /INFORMATION TECHNOLOGY Improvement in Lesson plan 1. Links for online study material for all important subjects have been added. 2. Links for respective subjects have also been included. 3. After completion of each unit , not only the assignments will be given tests will also be taken. 4. Questions related to each unit will be discussed on completion of the unit. 5. Improvement and vast topics will be covered using LCD projectors. 6. Revision lecture for each unit has been planned for the session 2011-2012. 7. Indiscipline will be handled more strictly. 8. Timely submission of assignments will be given more weightage. 9. Lectures have been planned more interactive. 10. Questions from latest question papers have been added.

MERI - CET DEPTT. OF COMPUTER SCIENCE

TEACHING METHODLOGY
Subject: COMPUTER GRAPHICS Branch:CSE/IT Subject Code: CSE-303E Semester: V

Lecturer: Ms. Sonia

COURSE OBJECTIVE

Course

To provide understanding of the basic principles of Computer Graphics and allow use of these techniques within small, focused applications using OpenGL to demonstrate concepts. METHODOLOGY The pedagogy will be lectures, tutorials, assignments, interactive class work, seminars, project etc. ACHIEVEMENTS 1. Basic knowledge of computer graphics 2. Algorithms to draw lines and shapes 3. Ability to understand the computer organization EVALUATION Besides the semester end examination,the stuents will be continuously assessed during the course on following basis S. no. 1 2 3 4 Description Mid term examinations Internal assessment (Assignment + Attendance) Class performance End semester examination Total Marks distribution 20 20 10 100 150

Syllabus as per M. D. University Session: 2011-2012 B.TECH (CSE & IT) SEMESTER V SUBJECT: COMPUTER GRAPHICS SUBJECT CODE: CSE-210E Unit-1: Introduction to Computer Graphics: What is Computer
Graphics, Computer Graphics Applications, Computer Graphics Hardware and software, Two dimensional Graphics Primitives: Points and Lines, Line drawing algorithms: DDA, Bresenham s; Circle drawing algorithms: Using polar coordinates, Bresenham s circle drawing, mid point circle drawing algorithm; Filled area algorithms: Scanline: Polygon filling algorithm, boundary filled algorithm.

Unit-2: Two/Three Dimensional Viewing: The 2-D viewing pipeline,

windows, viewports, window to view port mapping; Clipping: point, clipping line (algorithms):- 4 bit code algorithm, Sutherland-cohen algorithm, parametric line clipping algorithm (Cyrus Beck). Polygon clipping algorithm: Sutherland-Hodgeman polygon clipping algorithm. Two dimensional transformations: transformations, translation, scaling, rotation, reflection, composite transformation. Three dimensional transformations: Three dimensional graphics concept, Matrix representation of 3-D Transformations, Composition of 3-D transformation.

Unit-3: Viewing in 3D: Projections, types of projections, the mathematics

of planner geometric projections, coordinate systems.

Unit-4: Hidden surface removal: Introduction to hidden surface removal.

The Z- buffer algorithm, scanline, algorithm, area sub-division algorithm.

Unit-5: Representing Curves and Surfaces: Parametric representation of

curves: Bezier curves, B-Spline curves. Parametric representation of surfaces; Interpolation method.

Unit-6: Illumination, shading, image manipulation: Illumination models,

shading models for polygons, shadows, transparency. What is an image? Filtering, image processing, geometric transformation of images.
4

Text Books:
Computer Graphics Principles and Practices second edition by James D. Foley, Andeies van Dam, Stevan K. Feiner and Johb F. Hughes, 2000, Addision Wesley. Computer Graphics by Donald Hearn and M.Pauline Baker, 2nd Edition, 1999, PHI

Reference Books:
Procedural Elements for Computer Graphics David F. Rogers, 2001, T.M.H Second Edition Fundamentals of 3Dimensional Computer Graphics by Alan Watt, 1999, Addision Wesley. Computer Graphics: Secrets and Solutions by Corrign John, BPB Graphics, GUI, Games & Multimedia Projects in C by Pilania & Mahendra, Standard Publ. Computer Graphics Secrets and solutions by Corrign John, 1994, BPV Introduction to Computer Graphics By N. Krishanmurthy T.M.H 2002

MERI - CET DEPTT. OF COMPUTER SCIENCE

B.TECH (CSE & IT) SEMESTER V TEACHING PLAN SUBJECT (CSE -303 E):- COMPUTER GRAPHICS
Total No.of Lectures 50 Detailed Course Outline References No.Of Lectures 3

UNIT 1: Introduction to Computer Graphics: What is Computer Graphics,

Computer Graphics Applications, Computer Graphics Hardware and software

James D. Foley Chapter 1, 4 Baker Chapter 1, 2 James D. Foley Chapter 3 Baker Chapter 3

UNIT 2: Two dimensional Graphics Primitives, Filled area algorithms: Points

and Lines, Line drawing algorithms: DDA, Bresenham s; Circle drawing algorithms: Using polar coordinates, Bresenham s circle drawing, mid point circle drawing algorithm; Scanline: Polygon filling algorithm, boundary filled algorithm.

10

UNIT 3: Two/Three Dimensional Viewing:

The 2-D viewing pipeline, windows, viewports, window to view port mapping; Clipping: point, clipping line (algorithms):- 4 bit code algorithm, Sutherland-cohen algorithm, parametric line clipping algorithm (Cyrus Beck). Polygon clipping algorithm: SutherlandHodgeman polygon clipping algorithm.

James D. Foley Chapter 3 Baker Chapter 6

UNIT 4: Two dimensional transformations, Three dimensional transformations, Viewing in 3D: transformations, translation,
scaling, rotation, reflection, composite transformation. Three dimensional graphics concept, Matrix representation of 3-D Transformations, Composition of 3-D transformation. Projections, types of projections, the mathematics of planner geometric projections, coordinate systems.

James D. Foley Chapter 5, 6 Baker Chapter 5, 11, 12

12

17

UNIT 5: Hidden surface removal:

James D. Foley Introduction to hidden surface removal. The Z- Chapter 10,11,15, buffer algorithm, scanline, algorithm, area 16 sub-division algorithm. Representing Curves and Surfaces: Parametric representation of Baker curves: Bezier curves, B-Spline curves. Chapter 10, 13, 14
Parametric representation of surfaces; Interpolation method. Illumination, shading, image manipulation: Illumination models, shading models for polygons, shadows, transparency. What is an image? Filtering, image processing, geometric transformation of images.
Total No. of Lectures

50

Text Books:
Computer Graphics Principles and Practices second edition by James D. Foley, Andeies van Dam, Stevan K. Feiner and Johb F. Hughes, 2000, Addision Wesley. Computer Graphics by Donald Hearn and M.Pauline Baker, 2nd Edition, 1999, PHI

Reference Books:
Computer Graphics by ISRD Group, Tata McGraw Hill. Computer Graphics by V.K. Pachghare, PBB

MERI CET DEPTT.OF COMPUTER SCIENCE

SUBJECT (CSE -303 E):- COMPUTER GRAPHICS ASSIGNMENT(1) B. Tech 5TH Semester(CSE/IT) SESSION(2010-11) Submitted to Ms. Meenakshi Hooda
1. Are there any specific s/w and h/w requirements to implement computer graphics techniques ? If yes, what are they?
2. Define the term Computer Graphics. What are various applications

of computer graphics?
3. Explain the working of Digitizers in detail. 4. What is an image aspect ratio? Give example.

5. Explain the DVST.

6. Explain CRT. Gamma describes what property of a CRT?

7. What are the specifications of thermal transfer printers?

8.

Explain the architecture and functioning of raster and random display system.

9. Differentiate between pointing and positioning devices. Give at least one example of both.

10. How does light pen work? Compare its functionality with tablets functionality.

MANAGEMENT EDUCATION AND RESEARCH INSTITUTE COLLEGE OF ENGINEERING AND TECHNOLOGY (MERI CET) DEPTT.OF COMPUTER SCIENCE SUBJECT (CSE -303 E):- COMPUTER GRAPHICS ASSIGNMENT(2) B. Tech 5TH Semester(CSE/IT) SESSION(2010-11) Submitted to Ms. Meenakshi Hooda
1. What is Bresenhams approach for line drawing? 2. Do the Bresenham circle algorithm for a circle of radius 18. 3. What main factors affect the time taken to scan-convert a filled area? 4. How boundary filled algorithm different from polygon filled algorithm? 5. What is mid point circle drawing algorithm? 6. Explain DDA line algorithm with an example. 7. What will be the points generated for a line from point A(2,3) to B(8,10), using Bresenhams line algorithm. 8. What will be the points generated for a line from point A(2,5) to B(9,12), using DDA line algorithm.

9. Explain boundary filled algorithm with the help of an example. 10. Explain Scanline Polygon filling algorithm.
9

MANAGEMENT EDUCATION AND RESEARCH INSTITUTE COLLEGE OF ENGINEERING AND TECHNOLOGY (MERI CET) DEPTT.OF COMPUTER SCIENCE SUBJECT (CSE -303 E):- COMPUTER GRAPHICS ASSIGNMENT(3) B. Tech 5TH Semester(CSE/IT) SESSION(2010-11) Submitted to Ms Meenakshi Hooda
1. What's the difference between a bitmap and a pixelmap?
2. Explain Cohen-Sutherland clipping. Cohen-Sutherland clipping is

efficient when most of the input lines have what property? 3. What do you mean by composite transformation? 4. Here is a 2D transformations question that will take some thinking. I want to move an object as follows: a. First, translate by 2 in X. b. Then rotate by 90 degrees about the origin. c. Then translate by 1 in Y. d. Then rotate by another 90 degrees about the origin. 5. These 4 combined operations could be simplified into one translation followed by one rotation about the origin. What would this translation and rotation be? 6. In the above question if these 4 combined operations could be simplified into one rotation about the origin followed by one translation. What would this rotation and translation be? 7. Compare and contrast the three methods of line clipping.

10

8. Why are matrix representations used to describe point transformations in computer graphics? Describe how to represent three different 2D transformations as matrices
9. Using scaling, magnify the triangle with vertices A(0,0), B(0,1)

and C(5,2) to thrice of its size while keeping C(5,2) fixed. 10. Explain Window to Viewport transformation.

11

MANAGEMENT EDUCATION AND RESEARCH INSTITUTE COLLEGE OF ENGINEERING AND TECHNOLOGY (MERI CET) DEPTT.OF COMPUTER SCIENCE SUBJECT (CSE -303 E):- COMPUTER GRAPHICS ASSIGNMENT(4) B. Tech 5TH Semester(CSE/IT) SESSION(2010-11) Submitted to Ms Meenakshi Hooda
1. Explain why homogeneous coordinates are used for handling

geometric Transformations.
2. Compute the 4x4 homogeneous transformation matrix to translate

and uniformly scale a volume with corners (1,2,3) and (4,5,6) to be centered in a cube with corners (0,0,0) and (1,1,1), and to be as large as possible.
3. Compare 3D transformation with 2D transformation. 4. How can scaling with respect to a point p0(x0,y0,z0) be defined in

terms of scaling with respect to the origin? Also, Find the matrix that represents rotation of an object by 30 deg. about the origin.
5. What do you mean by projections? Explain different types of

projections.
6. What is the difference between left-handed and a right-handed 3-

dimensional coordinate system?

7. Explain the steps of 3-D viewing pipeline.How a 3-d object is rotated

around an arbitrary axis. Explain with the help of an example.

8. Step by step, show how a rectangle with points (10,10), (10,20),

(20,20), (20, 10) is rotated by 30 degrees anticlockwise around point (10, 15).
12

9. Write any area sub-division algo for hidden surface elimination and

explain its working.

10. From Hidden-surface elimination point of view, how can one find out

whether polygon P obscures polygon Q or not?

13

MANAGEMENT EDUCATION AND RESEARCH INSTITUTE COLLEGE OF ENGINEERING AND TECHNOLOGY (MERI CET) DEPTT.OF COMPUTER SCIENCE SUBJECT (CSE -303 E):- COMPUTER GRAPHICS ASSIGNMENT(5) B. Tech 5TH Semester(CSE/IT) SESSION(2010-11) Submitted to Ms. Meenakshi Hooda
1. Explain Z-buffer algorithm 2. How scanline algorithm different from Z-buffer algorithm? 3. Explain area sub division algorithm 4. Why hidden surface removal is required? 5. What do mean by Bezier curve? How Bezier curve different from

B-Spline curves?
6. Explain shadowing effect in an image. 7. What are various steps in 3-d projections? Explain them. 8. Why and how filtering is done in images? 9. Why geometric transformation of images is done. Explain with

example
10. What are various illumination methods? Explain any of these.

14

MANAGEMENT EDUCATION AND RESEARCH INSTITUTE COLLEGE OF ENGINEERING AND TECHNOLOGY (MERI CET) DEPTT.OF COMPUTER SCIENCE SUBJECT (CSE -303 E):- COMPUTER GRAPHICS ASSIGNMENT (6) B. Tech 5TH Semester (CSE/IT) SESSION (2010-11) Submitted to Ms. Meenakshi Hooda
1.

What do you mean by normalization transformation? Why it

is needed? Explain how and in which application areas computer graphics can be used?
2.

Explain input devices in computer graphics along with their functioning in detail.
3.

What do you mean by interior and exterior clipping? Explain with example.
4. 5. 6. 7.

Explain Cyrus Beck parametric line clipping algorithm Prove that successive 2D rotation are additive.

What is the need of homogeneous coordinates? Give the homogenous coordinates for translation, rotation, and scaling. Perform a 45 degree rotation of triangle A(0,0), B(1,1), C(5,2) (a) About the origin (b) About the P(-1,-1)
8. 9. 10.

List and explain functions of a Graphic package. Why is a shadow mask used? Why is it needed?

15