Scribd
Upload
8 views87 pages

COMPUTER GRAPHICS UNIT-3

The document outlines the syllabus for the Computer Graphics course (CS521PE) for B.Tech. IT students at JNTU Hyderabad, detailing course objectives, outcomes, and a comprehensive breakdown of topics covered across five units. Key concepts include 2D and 3D transformations, viewing and projections, illumination models, and computer animation techniques. The syllabus also lists required textbooks and reference materials for further study.

Uploaded by

22891a05h9.rachana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views87 pages

COMPUTER GRAPHICS UNIT-3

The document outlines the syllabus for the Computer Graphics course (CS521PE) for B.Tech. IT students at JNTU Hyderabad, detailing course objectives, outcomes, and a comprehensive breakdown of topics covered across five units. Key concepts include 2D and 3D transformations, viewing and projections, illumination models, and computer animation techniques. The syllabus also lists required textbooks and reference materials for further study.

Uploaded by

22891a05h9.rachana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 87

R18 B.Tech.

IT Syllabus JNTU HYDERABAD

CS521PE: COMPUTER GRAPHICS (Professional Elective - II)

III Year B.Tech. IT I-Sem L T P C


3 0 0 3
Prerequisites
1. Familiarity with the theory and use of coordinate geometry and of linear algebra such as
matrix multiplication.
2. A course on “Computer Programming and Data Structures”

Course Objectives
 The aim of this course is to provide an introduction of fundamental concepts and theory of
computer graphics.
 Topics covered include graphics systems and input devices; geometric representations and
2D/3D transformations; viewing and projections; illumination and color models; animation;
rendering and implementation; visible surface detection;

Course Outcomes
 Acquire familiarity with the relevant mathematics of computer graphics.
 Be able to design basic graphics application programs, including animation
 Be able to design applications that display graphic images to given specifications

UNIT - I
Introduction: Application areas of Computer Graphics, overview of graphics systems, video-display
devices, raster-scan systems, random scan systems, graphics monitors and work stations and input
devices
Output primitives: Points and lines, line drawing algorithms (Bresenham’s and DDA Algorithm), mid-
point circle and ellipse algorithms
Polygon Filling: Scan-line algorithm, boundary-fill and flood-fill algorithms

UNIT - II
2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations,
matrix representations and homogeneous coordinates, composite transforms, transformations between
coordinate systems
2-D viewing: The viewing pipeline, viewing coordinate reference frame, window to view-port
coordinate transformation, viewing functions, Cohen-Sutherland algorithms, Sutherland –Hodgeman
polygon clipping algorithm.

UNIT - III
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.

UNIT - IV
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.

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

81
R18 B.Tech. IT Syllabus JNTU HYDERABAD

Visible surface detection methods: Classification, back-face detection, depth-buffer, BSP-tree


methods and area sub-division methods

TEXT BOOKS:
1. “Computer Graphics C version”, Donald Hearn and M. Pauline Baker, Pearson Education
2. “Computer Graphics Principles & practice”, second edition in C, Foley, Van Dam, Feiner and
Hughes, Pearson Education.
3. Computer Graphics, Steven Harrington, TMH

REFERENCE BOOKS:
1. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill, 2nd edition.
2. Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
3. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.

82
THREE DIMENSIONAL OBJECT REPRESENTATION

 Polygon surface
 Polygon table

 Plane equation

 Polygon mesh

 Quadric surfaces

 Sphere, Ellipsoid

 Spline representation

 Bezier curves & Surfaces

 B-Spline curves & surfaces.


INTRODUCTION
• Graphics scenes can contain many different kinds of objects and
material surfaces such as Trees, flowers, clouds, rocks, water, bricks,
wood paneling, rubber, paper, steel, glass, plastic and cloth
• Not possible to have a single representation for all
– Polygon surfaces
– Spline surfaces
– Procedural methods
– Physical models
– Solid object models
– Fractals
3D-OBJECT REPRESENTATION

o 3D solid object representations can be generally classified


into two broad categories
1. Boundary Representation ( B-reps): It describes a three
dimensional object as a set of surfaces that separate the
object interior from the environment.
Examples are polygon facets and spline patches.
2. Space Partitioning representation: It describes the interior
properties, by partitioning the spatial region containing an
object into a set of small, non overlapping, contiguous
solids (usually cubes).
Eg: Octree Representation
POLYGON SURFACES:
• Polygon surfaces are boundary representations for a 3D graphics
object is a set of polygons that enclose the object interior.
• The most commonly used boundary representation for a 3D graphics
object is a set of surface polygons that enclose the object interior.
Many graphics system use this method.
• The polygon surfaces are common in design and solid-modeling
applications, since their wireframe display can be done quickly to give
general indication of surface structure. Then realistic scenes are
produced by interpolating shading patterns across polygon surface to
illuminate.
POLYGON TABLES:
 In this method, the surface is specified by the set of vertex
coordinates and associated attributes. As shown in the following
figure, there are five vertices, from v1 to v5.
• Each vertex stores x, y, and z coordinate information which is
represented in the table as v1: x1, y1, z1.
• The Edge table is used to store the edge information of polygon. In
the following figure, edge E1 lies between vertex v1 and v2 which is
represented in the table as E1: v1, v2.
• Polygon surface table stores the number of surfaces present in the
polygon. From the following figure, surface S1 is covered by edges
E1, E2 and E3 which can be represented in the polygon surface table
as S1: E1, E2, and E3.
POLYGON TABLE:
PLANE EQUATIONS:
 The equation for plane surface can be expressed as −
 Ax + By + Cz + D = 0

 Where (x, y, z) is any point on the plane, and the coefficients A,B,C and
D are constants describing the spatial properties of the plane.
 We can obtain the values of A,B,C and D by solving a set of three
plane equations using the coordinate values for three non collinear
points in the plane.
 For that, we can select three successive polygon vertices (x1, y1, z1),
(x2, y2, z2) and (x3, y3, z3) and solve the following set of
simultaneous linear plane equations for the ratios
Let us solve the following simultaneous equations for ratios A/D, B/D, and C/D.
You get the values of A, B, C, and D.

 A/D x1 + B/D y1 + C/Dz 1= -1


 A/D x2 + B/D y2 + C/D z2 = -1
 A/D x3+ B/D y3 + C/D z3 = -1
 To obtain the above equations in determinant
form, apply Cramer’s rule to the above
equations.

Expanding the determinants, we can write the calculations for


the plane coefficients in the form

We can identify the point as either inside or outside the plane surface according o
the sigh (negative or positive) of 𝐴𝑥+𝐵𝑦+𝐶𝑧 +𝐷 :
• Ax + By + Cz + D ≠ 0 means the point is not on the plane.
• Ax + By + Cz + D < 0 means the point is inside the surface.
• Ax + By + Cz + D > 0 means the point is outside the surface.
POLYGON MESHES:

 A single plane surface can be specified with a function such as


fill Area. But when object surfaces are to be tiled, it is more
convenient to specify the surface facets with a mesh function.
 One type of polygon mesh is the triangle strip A triangle strip
formed with 11 triangles connecting 13 vertices.

 This function produces n-2 connected triangles given


the coordinates for n vertices.
 Another similar function in the quadrilateral
mesh, which generates a mesh of (n-1) by (m-1)
quadrilaterals, given the coordinates for an n by m
array of vertices. Figure shows 24 vertices forming a
mesh of 15 quadrilaterals.
POLYGON MESH:
POLYGON MESH:
QUADRIC SURFACES:

 The quadric surfaces are described with second


degree equations (quadratics). They are

i. spheres
ii. Ellipsoids
iii. Torus,
SPHERE:
 In Cartesian coordinates, a spherical surface
with radius r cantered on the coordinates origin
is defined as the set of points (x, y, z) that satisfy
the equation.
x2 + y2 + z2 = r2
The spherical surface can be represented in
parametric form by using latitude and longitude
angles, the parameter representation in eqn (2)
provides a symmetric range for the angular
parameter θ and φ.
x = r cosφ cosθ, -π/2 <= φ<= π/2
y = r cosφ sinθ, -π <= φ <= π
z = rsinφ
ELLIPSOID
 Ellipsoid surface is an extension of a spherical
surface where the radius in three mutually
perpendicular directions can have different
values the Cartesian representation for points
over the surface of an ellipsoid centered on the
origin is
TORUS

 Torus is also called as anchor Ring.it is a


doughtnut shaped object
 An object formed by rotating a circular or ellipse
about a coplanar axis line that is external to the
conic
 General Equation:
SPLINE CURVE :

 SPLINE:
Spline is a flexible strip which was long
ago used for designing the ship
 Spline curve:

A Spline curve is mathematical


representation for which it is easy to build on
interface that will allow a user to design and
control the shape of complex curves and surfaces
ILLUMINATION MODEL:
COLOR MODEL:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy