Dept. of Computer Science Engineering, School of Engineering, Anurag Group of Institutions

Dept. of Computer Science Engineering, School of Engineering, Anurag Group of Institutions

IV B.Tech I Semester

Student Handbook

For

Computer Graphics

Mr.Naveen kumar Reddy

Mrs.Srilatha

UNIT I

Syllabus:

Introduction, Application areas of Computer Graphics, overview of graphics systems, video-display devices, raster-scan systems, random scan systems, graphics monitors and workstations and input devices.

Objectives:

· Learning about the application areas of computer graphics.

· Learning how to display a video by using CRT, Raster-scan system and random scan systems.

· Learning about the monitors to display the graphical images.

· Learning about the input devices needed to input the data to the graphical system.

Lecture plan:

SNO / TOPIC / NO.OF LECTURES
1 / Introduction ,Application areas of computer graphics,Overview of graphics systems. / 2
2 / Video display devices--CRT / 1
3 / Raster-scan systems / 1
4 / Random scan systems / 1
5 / Graphic monitors / 2
6 / Input devices / 2

Important Questions:

1. What are the merits and demerits of raster-scan CRT?

2.List and explain the applications of computer graphics?

3.List the operating characteristics of

a. Raster refresh systems

b. Vector refresh systems

c. Plasma panel

d. LCD

Assignment Questions:

1.Assuming that a certain full-colour (24-bit per pixel) RGB raster system has a 512 by 512 frame buffer, How many distinct colour choices (intensity levels)would be available?

2.Consider a raster system with resolution of 640×480. How many pixels could be accessed per second by a display controller that refreshes the screen at a rate of 60 frames per second. What is the access time per pixel?

UNIT II

Syllabus:

Output primitives:Pointsandlines,line drawing algorithms,mid-point circleandellipsealgorithms. Filledarea primitives: Scanline polygonfill algorithm,boundary-fillandflood-fill algorithms.

Objectives:

· Learning the algorithms for drawing the line, for drawing the circle with midpoint algorithm and drawing the ellipse with midpoint ellipse algorithm.

· Learning about the filled area primitives like polygons and algorithms for polygon filling with scan line fill algorithm, boundary fill algorithm and flood fill algorithm.

Lecture plan:

SNO / TOPIC / NO.OF LECTURES
1 / Output primitives / 1
2 / Line drawing algorithms / 1
3 / Mid point circle algorithm / 1
4 / Mid point ellipse algorithm / 1
5 / Filled area primitives / 1
6 / Scan line polygon fill algorithm / 1
7 / Boundary fill algorithms / 1
8 / Flood fill algorithms / 1

Important Questions:

1.What are the steps required to plot a line using simple DDA methods?

2.What are the steps required to plot a line using Bresenham method?

3. Write an algorithm to derive the straight line using Bresenham algorithm when the slope of the line is less than 45 degrees?

Assignment:

1.Show why the point-to-line error is always <=1/2 for the midpoint scan conversion algorithm?

2.Indicate which raster locations would be chosen by bresenham algorithm when scan-converting a line from screen coordinate(1,1) to screen co-ordinate(8,5)?

UNIT III

Syllabus:

2D-geometricaltransforms:Translation,scaling,rotation, reflectionandsheartransformations,matrix representations andhomogeneous coordinates, composite transforms, transformations between coordinate systems

Objectives:

· Learning how to transform a 2D object from one point to another point

· Learning how to increase(Scaling) an object size.

· Learning how to rotate an object at some angle

· Learning how to represent 2D object in the homogenous co-ordinates and transform using homogeneous co-ordinates

Lecture plan

SNO / TOPIC / NO OF LECTURES
1. / 2D translation / 1
2 / 2D scaling / 1
3 / 2D Rotation / 1
4 / 2D reflection / 1
5 / 2D shear transformation / 1
6 / Matrix representations and homogeneous
Co-ordinates / 1
7 / Composite transforms / 1
8 / Transformations between coordinate systems / 1

Important Questions:

1.Write the general form of a scaling matrix with respect to a fixed point p(h,k) where the scaling factors in x and y directions are a and b respectively?

2.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 counter clockwise rotation of 90 degree?

3.Prove scaling and rotation is commutative?

Assignment:

1.Derive the general form of rotation matrix with respect to fixed point p(h,k)?

2.An object point P(x,y) is translated in the direction U=aI+bJ and simultaneously an observer moves in the direction U. Show that there is no apparent motion of the object point from the point of view of observer?

UNIT-IV

Syllabus:

2-Dviewing:Theviewingpipeline,viewingcoordinate referenceframe,windowtoview-portcoordinate transformation,viewing, Cohen-SutherlandandCyrus-becklineclippingalgorithms,Sutherland-Hodge man polygon clipping algorithm.

Objectives:

· Learning how to view the 2D object.

· Learning how to clip an object using Cohen-Sutherland and Cyrus-beck line Clipping algorithms.

· Learning how to clip an object using the Suther-Hodge man polygon clipping algorithm.

Lecture plan

SNO / TOPIC / NO OF LECTURES
1 / Theviewingpipeline / 1
2 / Viewingcoordinate referenceframe / 2
3 / Windowtoview-portcoordinate transformation / 2
4 / Cohen-SutherlandandCyrus-becklineclippingalgorithms / 2
5 /

Sutherland-Hodge man polygon clipping algorithm.

/ 2

Important Questions:

1.Find the general form of the Transformation N which maps a rectangular window with extent xw min to xw min in the x-direction and with y extent yw min to yw min in the y –direction on to a rectangular view port with x extend xv max to xv max and y extent yv min to yv max.

2. Justify that the Sutherland-Hodge man algorithm is suitable for clipping concave polygon also?

Assignment:

1.Using steps followed in Sutherland-Hodge man algorithm determine the intersection point of the line segment p1 p2 against a clipping window p3 p4 where coordinates of end point are p1(0,0)p2(3,0)andp4(0,2)?

2.Let R be a rectangular window whose lower left corner is at L(-3,1) and upper right-hand corner is at R(2,6).If the line segment is defined with two end points A(-1,5) and

B(3,8) .Determine

a)The region codes of the two end points

b)Its clipping category and

c)Stages in the clipping operation using Cohen- Sutherland algorithm.

UNIT-V

Syllabus:

3-D object representation : Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon rendering methods

Objectives :

· Learning how to produce realistic displays of the scenes using 3D representations that model the object characteristics.

Lecture plan

SNO / TOPIC / NO OF LECTURES
1 / Polygon surfaces, quadric surfaces / 1
2 / Spline representation / 1
3 / Hermite curve / 1
4 / Bezier curve curveand B-Spline curves / 1
5 / Bezier and B-Spline surfaces / 2
6 / Basic illumination models / 1
7 / Polygon rendering methods / 2

Important Questions

1.State the Blending function used in B-spline curve generation. Explain the terms involved in it? What are the properties of B-spline curves?

2.Determine the blending functions for uniform periodic B-spline curve for d=6?

Assignment:

1.Given the plane parameters A,B,C and D for all surfaces of an object, explain the procedure to determine whether any specified point is inside or outside the object?

2.Explain the procedure followed in Bezier’s methods for curve generation?

3.List and explain the procedures followed in different smooth shading algorithms. Analyze the computational complexities in each?

UNIT-VI

Syllabus:

3-D Geometric transformations: Translation, rotation, scaling, reflection and shear transformations, composite transformations.

3-D viewing :Viewing pipeline, viewing coordinates, view volume and general projection transforms and clipping.

Objectives:

· Learning how to transform a 3D object using techniques like Scaling, Translation, Rotation, reflection and Shear transformation.

· Learning how to map 3D object on to the 2D dimensional surface using projection techniques.

Lecture plan

SNO

TOPIC

NO.OF LECTURES

Translation, rotation transformations

Scaling, reflection transformations

Shear transformations

Composite transformations

Viewing pipeline and viewing coordinates

Projection transforms

Clipping

Important Questions:

1.Prove that the multiplication of 3D transformation of any two successive translation matrices is commutative?

2.Derive the matrix form for perspective projection transformation using 3-dimensional homogenous representation .with the a neat sketch, describe various parameters involved in the matrix representation?

Assignment:

1.If p(x,y,z) is an object reference point for scaling, explain now the scaling operation is defined in terms of scaling with respect to origin?

2.Derive the quaternion rotation matrix for rotation about an arbitrary axis in three-dimensional domain?

3.Given a unit cube with one corner at(0,0,0) and the opposite corner at (1,1,1), derive the transformations necessary to rotate the cube by theta degrees about the main diagonal from (0,0,0) to (1,1,1) in the counter clock wise direction when looking along the diagonal toward the origin?

UNIT-VII

Syllabus:

Visible surface detection methods: Classification, back-facedetection, depth-buffer, scan-line, depthsorting, BSP-tree methods, area sub-division and octree methods

Objectives:

· Learning how to remove the surfaces or lines which are not to be displayed in a 3D scene using visible surface detection procedures.

Lecture plan:

SNO / TOPIC / NO.OF LECTURES
1 / Classification, / 1
2 / Back-facedetection / 1
3 / Depth-buffer / 1
4 / Scan-line / 1
5 / Depthsorting / 2
6 / BSP-tree methods / 2
7 / Area sub-division and octree methods / 2

Important Questions:

1.How does Z-buffer algorithm determine which surfaces are hidden?

2.Explain BSP-Tree method in detail?

3.Compare and contrast depth-buffer and depth-sort methods?

Assignment:

1.A polygon has a plan equation ax+by+cz+d=0.Suppose that we know the value of ‘Z’ at a point (x,y) .What is the easiest way to calculate the value of z at (x+1,y) and at (x,y+1)?

2.Assuming that one allows 2 power 24 depth value levels to be used, how much memory would a 1024 x 768 pixel display requires to store the z-buffer?

UNIT-VIII

Syllabus:

Computer animation :Design of animation sequence, general computer animation functions, raster animation, computer animation languages, key frame systems, motion specifications.

Objectives:

· Learning general functions needed for animation of scenes.

· Learning the languages to build the animation scenes.

· Learning the categories of animation.

Lecture Plan:

SNO / TOPIC / NO.OF LECTURES
1 / Design of animation sequence / 1
2 / General computer animation functions / 1
3 / Raster animation / 1
4 / Computer animation languages / 1
5 / Key frame systems / 1
6 / Motion specifications / 1

Important Questions:

1.What are the issued involved in design of a story board layout with accompanying key frames for an animation of a single polyhedron?

2.What is the mechanism followed for tracking live action in animated scenes?

3.Describe the problem of temporal aliasing?

Assignment:

1.List and explain about the steps of animation and various types of interpolation used in animation?

2.Define the technique morphing. Explain how simulation accelerations will be considered in key-frame systems?