UNIT 6: Visible Surface Detecti...

UNIT :VIsible Surface Detection and AnimatioD

$YLLABUS:

1. Visible Surface Detection:

Classification of Visible Surface Detection algortthm
b. Back Surface detection method
e. Depth Buffet method
d. Area Subdivision method
2. Animation:
a. Introduction to Animation
b. Traditional Animation Techniques
C. Principles of Animatíon
3. Key framing: Character and Facial Animation, Deformation, Motion capture
ALL PÒSSIBLE QUESTIONS

NOTE:* MARKED AREMOST IMPORATNT QUESTION

Explain Area Subdivision method.
B Explain Back Surface detection method in detail with an example.*
Write short note on Depth buffer algorithm..*
C

D. Describe various principles of traditional animation,

E.
What are principles of animations. explain different traditional animation technigques. "
ACJAH2

NOTE:
1. THIS CHAPTER CARRIES MAXIMUMOF 10 MARKS.

91766o07103o
Satyanchaurasi
MathslnDepthal180una

Prev Item Next Item

T
UNIT 4:Two-Dimensional View...

UNIT 4: Two-Dimensional Viewing and Clipping

SYLLABUS:

1. Viewing transformation pipeline and Window to Viewport'coordinate transformation

2. Clipping operations:
a. Point clipping,
b. Line clipping algorithms: Cohen Sutherland, Liang:Barsky,
C. Polygon Clipping Algorithms: Sutherland Hodgemáh, Weiler-Atherton.
ALL POSSIBLE QUESTIONS
NOTE: *MARKED ARE MOST IMPORATNT QUESTION
A. Define window and viewport. Derive window to viewport transformation.*
OR With neat diagram explain windów to viewportcoordinate transformation.
B Explain Liang Barsky line clipping algorithm in detail.*
Explain Liang Barsky line clippingalgorithm, what is its benefit over Cohen Sutherland
algorithm? Clip the line with co -ordinates (5,10) and (35,30) against the window (*min. )Ymin) =
(10,10) and (max, Ymax) = (20,20).
C.
With neat diagram explain Sutherdand Hodgman polygonclipping algorithm.
D. Explain Cohen Sutherlandline clipping algorithm. Apply the algorithm to clip the line segment
A(120,70) and B(190,80) against the windowCo-ordiante Xwmin = 80, Xwmax = 180, Ywmin= 50
sa and Yvwmax 1 2 0 . S R O O O T
Apply the Cohen -Sutherland line cippis@lijHbm to clip the line with coordinates (30,60) and
(60,25) against the window with (Xw rain, Ywmin) = (10,10) and (Xmar. Yvrmax) = (50,50)*
E. Explain any one polygon clipping algorithm.*
F.
Explain drawback of the Sutherland Hodgman polygon clipping algorithm with example.
G. Explain Weiler-Atherton polygon clipping algorithm in detail."
H. State what is meant by clipping. Explain any one clipping algorithm.*
Write short note on Viewing Transformation.
J.
Explain point clipping algorithm.

NâTE:
1. THIS CHAPTER CARRIES MAXIMUM OF 15 MARKS.

MathslnDepth
 UNIT 1: Introduction and Overv..

UNTT Introduction and Overview of Graphics System

SYLLABUs:

Definitionofand
1.2. Overicw Representative uses ofcomutet granhies)/06
coordinate system
3. Definition of scan conversion
4. rasterization and rendering.
salyanchaurastyal1980
5 Raster scan &random scan displays
a. Architecture of raster graphicS systen with display processor
b. Architecture of random scan systems.

ALL POSSIBLE QUESTIONS

NOTE: MARKED ARE MOST IMPORATNT QUESTION
Compare Raster Scan and Random Scan displays.
OR
Differentiate between random scan and raster scan technique*
B. Raster techniques (short note)
C. What is computer graphics. Enlist representative uses of it.
D, Explain rasterization and rendering. *

ACJAH2
NOTE:
1. THS CHAPTER CARRIES MAXIMUM OF 5 MARKS.
2. ANSWERS WILL BEPROVIDED WITH PAPER SETS ONLY FOR ENROLLED
STUDENTS.
3. STRICTLY FOLIOW ANSWERS FROM OUR PDF INORDER TO GAIIN
MARKS AND MINIMIZE MISTAKES. MAXIMUM

MathslnDepth
 UNIT 3:Two Dimensional Geom...

UNIT 3:TwoDimensional Geometrie Transformatións

SnLABUs:
1. Basic transformations:
a. Translation
b. Scaling
C. Rotation
2. Matrix representaton and Honnogenicous Coordinates
3. Composite transformation
4. Other transformatians: Reection and shearyail9fögrmait.com
ALL POSSIBLE QUESTIONS
NOTE: MARKBD ARE MOST IMPORATNT QUESTION
Prove that two successive rotations are additive i.e. R1(0,)'R2(6,) = R(0, + 0,)
B. Derive the matrix for 2D rotation about an arbitrary point.
OR Explain the steps for 2D rotation about arbitrary point and provide a composite
transformation for the same.

Explainthe steps used in rotation of 2D object about an arbitrary axis and hence derive the matrix
for the same, *

D.
Discuss allthe steps used in reflection of an object about an arbitraryline withan example
E. With neat diagram explain Composite trhsOALion. *
Derivethe matrix that represents scaling of an object with respect to anyfixed point? Usethat
matrix to find Pl for the given point P(6,8), Sx = 2,Sy =3 andfxed point (2,2).
G. Deseribe what is Homogeneous coordinates.
H. Define shearing and give example.

NOTE:
1, THIS CHAPTER CARRIES MAXIMUM OF 10 MARKS.

MathslnDepth
 UNIT 2: OutputPrimitives

UNIT 2:Output Primitives

SYLLARUS:

1. Scan cohversions of point, line, circle and ellipse:

a. DDA nlgorithm and Bresenbam algorithn for line dtawing
b.. midpoint algorithn forcircle
c expected)
midpoint algorithm for ellipse drawing (Mathematical dertvation for above algorithms is
2. Aliasing, Antialiasing techniques like Pre and póst filtering, super sampling, and pixel phasing.
3. Filled Area Primitive:
a. Scan line PoBygon Fillalgorithm
b. inside outside tests
c. Boundary Fill and Flood fll algorithm.
ALL POssIBLE QUESTIONS
NOTE: * MARKED ARE MOST IMPORATNT QUESTION
A. Compare DDA and BRESENHAM line drawing algorithm.
B. Derive Bresenham's line drawing algorithm for lineswith slope <1
OR
Explain Bresenham's line drawing algurithm with proper mathematical analysis and identify the
pixel positions alonga line between A(10,10) and B(18,16) using it.
OR
Explain Bresenharm's line drawing algorithm. Plota líne by using Bresenham's line generating
algorithm from (1,1) to (5,3). *
ACJAH2
C Given a line AB where A(3,1) and B(0,0) calculate all the points of line AB using DDA algorithm.
D. Explain DDA Algorithm OR What are the disadvantages of DDA algorithm? *
E. Explain midpoint circle algorithm. Use the same to plot the circle, whose radius is 10 units. *
OR Derive formula for mid-point circle algorithm.
F. Explain inside outside test used in filling algorithm. *
OR What is the purpose of Inside-Outside Tests? Explain with an example.
G. Explain flood fill algorithm in detail.
OR Explain 8 connected flood fillalgorithm in detail.
H. Explain Bcan line polygon filling algorithm.
What is aliasing? Explain any two anti-aliasing techniques,
NOTE:
J. THISCHAPTER CARRES MAXIMUM OF 20 MARKS.

MathsinDepth
 UNIT 5: Three Dimensional Ge...

UNTT 5:Three DimenstonalGeometrie Transformations, Curvesand Fraetal Ceneration

SYLLABUS:
1. Transformations:
a. Translation
91/66597103
b. Rotation
c. Scaling and Reflection
alyarochauras
2. Composite transformations: Rotation about an arbitrary axísa
i8f)math
3. Projections - Parallel, Perspective. (Matrix Representation)
4. Bezier Curve
5. B-Spine Curve
6. Fractal-Geometry: Fractal Dimension, Koch Curve.
ALLPOSSIBLE QUESTIONS
NOTE:* M RKED ARE MOST IMPORATNT QUESTION
A What are Parallel and Perspective projections and derive the matrix for perspective projection.
OR Define projection, with neat diagramdescribe planar geometric projeçtion.
B. Explain Bezier curve and also specify the properties of Bezier curve.
OR Explain what is meant by Bezier curve. State its properties and hence explain howa Bezier
surface can be generated from Bazier curve. *
C. Describe properties of BEZAERcurve. *
ACJAH2
D. Construct the Bezier curve of order3 and with 4 polygonvertices A(1,1), B(2,3), C(4,3) and D(6,4).
E Write matrix to perform 3D reflection about xy, yz and xz planes.
Explain Construction of Koch curve*
G. Write short note on Fractals.

NOTE:
1, THIS CHAPTER CARRIES MAXIMUM OF 10 MARKS.

MathsInDepth