Computer Graphics
Computer Graphics
,i \
\
24 , TRIBHUVAN LINIVERSITY
INSTITUTE OF ENGINEERING Full Marks i 80
1
I. Compare random and raster display technology. t5l
2. How symrnetry property of circle reduces omplexity to draw a complete circle. Derive
decision parameter for midpoint circle algorithm assuming the start position as (-r, 0)
points are to be generated along the curve path in counter clockwise direction. 13+71
a
J. Use Liang Barsky line clipping algorithm to clip a line starting from (6,100) and ending at
(60, 5) against the window having its lower left comer at (10, 10) and upper right corner
at (90, 90). t8l
+. Reflect the triangle ABC about the line 3X-4Y+8:0 the position Vector of coordinate
ABC as A(4, 1), B(5,2) and C(4, 3). t8l
I
-JvHsg::-9*ospgler9*p!:-""1-€{fgt*
Candidates are required to give their answers in their own words as far as
practicable.
Attempt All questions.
Thefigures in the margin indicqte Full Marks'
Assume suitable data if necessarY.
1. What do you understand by raster display technology? Suppose a RGB raster system is
to
be designed using an 8 inch by l0 inch screen with a resolution of 100 pixels per inch in
each diiection. How long would it take to load this raster system in frarne buffer with
24
bits per pixel, if 10s bits can be transferred per second? t6I
2. How decision parameters can be used to draw circle? Calculate the points to draw a circle
having radious 5 and center as (10, 5). [4+6]
5. Describe 3-D viewing pipelining. Derive the transformation matrix for prespective
projection. [6+6]
6. How the geometric and attribute information of a 3-D objects are stored for the object
representation? Explain with examples. \ tsl
7. What are the consideration factors to choose the Visible Surface Detection Algorithm?
What are the two classes of visible surface detection techniques, explain? What is
limitation of Z-Buffer method? How does A-Buffer method overcome it, Explain? U21
8. Develop a phong illumination model. Show how this model is used for rendering by
deriving of ixpression for phong shading. [6+8]
9. Explain callback function with example in openGl. I5l
*:N.:t
"*
34 TR.IBHLTVAN UNIVERSITY
INSTITUTE OF ENGINEERING Level i BE i Full Marks i 80
Examination Control Division Programme I BEX, BCT i Pass Marks i 32
2074 Ashwin Y""riP;'t*-i-iiiti*- - --lTiffi --*-f"h'* -
1. Distinguish between Raster and Vector graphics methods. When do we prefer them? t6l
2. Digitize the line with end points A(20,10) and B(30,18) using Bresenham algorithm. [10]
3. Clip the line PlP2 with P1(-5,3) and P2(15,9) with clip window having diagonal
coordinate (0,0) and (10,10) using Liang-Barskey line clipping method. l8l
4. Explain the steps required to rotate an object in 3D about a line which is not parallel to
any one coordinate axis. t10j
5. How Geometric tables are used to represent a 3D object? Explain with example. Give
conditions to generate error free table. t8l
6. Explain properties if Bezier curve. Find the coordinate at u = 0.2 with respect to the
function.
control points (1,1), (4,6) (8,-3) and. {T2,2) using Bezier t8l
7. Differentiate irnage space and object space method for visible surface determination.
Explain scanline method to determine visible surface of object. [S+4]
8.
( 1,5,0)
(1,i, (10,t,1)
't.
:
Find out inHnsity of light reflected from the midpoint P on scan line y 3 in the above
given figure using Gouraud shading model. Consider a single point light source located at
:
positive infinity on Z-axis and assume vector to the eye as (1,1,1). Given d 0, K = l,
Iu = 1o 11: 10, Ks:2, Ka: Kd:0.8 for use in a simple illumination model. tl7l
9. What is OpenGL? Explain Callback Function. t4+Z!
**,|1
:,lr
TRIBHUVAN UNTVERSIry
INSTITUTE OF ENGINEERING
Examination Control Division
2073 Shrawan
l. systems.
Differentiate between vector and raster scan t4]
2. Derive and write midpoint algorithm for drawing a circle. [5+5]
3. What are the different steps of two dimensional world to screen viewing transformation?
Describe with matrix representation at each steps. t5]
4. Obtain the end points of the line that connects P1(0,120) and P2(130,5) after cohen-
sutheland clipping. The clip window has the following parameters. t5l
XOrnin :0, yornin = 0, x{D*o = 150 and y{Drno = 100
5. Describe three dimensional viewing pipelining. Derive the transfornation matrix for
parallel projection. [4+6]
6. Explain about parametric cubic curve? What is a Bezier Curve? Explain its properties
with examples. 12+61
7. Explain boundary representation technique to represent three dimensional objects with
suitable example. t8I
8. Compare object space method with image space method. Explain, How Back-face
detection method is used to detect visible surface. Also explain z-Buffer method. [2+4+4]
9. Define and explain the term ambient light, diffuse reflection dnd specular reflection with
appropriate mathematical expressions. I7l
rendering.
10. Explain the method of Phong shading for polygon t7l
11. Explain about Open GL and call back functions. t6l
rfi{<*
*
34 TRIBHUVAN UNIVERSITY
INSTITUTE OF ENGINEERING
Examination Control Division
2072 Chaitra
l. What are the differences between random and raster display technologies? t4l
2. How do you apply symmetry concept while drawing circle? Calculate the point in the
circumferences of the circle having radius 8 unit and center at (-5, 10) using midpoint
circle algorithm. [2+S]
a
J. What are the conditions for a point clipping? Find the clipped region of the line with
endpoins (5, 130) and (50, 5) in a rectangular window with (10, l0) and (100, 100)
diagonal vertices using Cohen-Sutherland line clipping algorithm. tl0l
4. What is 3D Shearing? Write its matrix representation. A unit length cube with diagonal
passing through (0,0,0) and (1,1,1) is sheared with respect to yz place with the shear
:
constants 2 in both directions. Obtain the coordinates of all the corners of the cube after
shearing. [2+8]
5. Explain about parametric cubic curves. What do you mean by Bezier Curve? Explain the
properties of Bezier curves.
[2+2+47
6. Explain how the geometric and attribute information of a three dimensional objects are
stored for the object representation? What are the conditions for error free generation of
polygon table? 14+41
7. Outline the Z buffer algorithm. List the advantages and disadvantages of the z-buffer
algorithm. 16+2+21
8. Explain about different types of lighting sources and how these light sources affbct the
illumination model? Explain about the intensity interpolation strface rendering technique
by highlighting its pro and cons. Also give example about phong illuminations model.
[3+5+6]
9. why GLUT is implemented in openGl.? what are the applications of openGl,? 12+41
***
t-)
i "i i'4a
.(-\
Exam.'
I-eyef ,
Programme
Part
I
I
. .,, o9
- 10 .' lt 2-
.31
r\tj -9-
5c"
. -&1,.-
':Level
Prog.ramme
ear hrs.
- 1l- 17 oo
.94
34 TRIBHWA}.IT'NIVERSITY Exam. Ilegrr l:r r'
(8X603)
,/ Candidates are required to give their answers in their own words as far as practicable.
r' AttemptAll questions.
{ Thefigures in the margin indicate Full Marks.
{ Assurne suitable data if necessary.
1. How much time is spent scanning across each raw of pixels dnring screen refresh on a
raster system with resolution 1024x768 and a refresh rate of 60 frames per second? l4l
2. Mention the disadvantages of DDA method. Write the corylete Bresenham's line
drawing algorithm and using midpoint circle drawing algorithrn calculate the co-ordinate
on the first quadrant of a circle having radius 6 and centre L2+4+41 (20,10)
3. State the conditionsof point clipping. Perform clipping operation for the following using
Liang Barskey line clipping algotithm: 12+61
6. Describe polygon, Vertex and Edge table of polygon. How thsse terms are important in
.computer graphics. t8l
7. Describe z-buffer method for visible surface detection in detail. State its-limitatior and
recommended method that addresses [7+3J it.
8. Calculate the total intensity using phone secular reflection model by considering all type
oflight sources. t8I
9. Compare and Contract betw'een Gouraud and Phong Shading Model. t8I
10. Write short notes on: [3x2]
a) Call back function
b) Open GL
rt !t,f
*
34 . .. TRIBHUVAN "NI'E*'ITY Exam.
INSTITUTE OF ENGINEERING LeveI BE 'FuIlMarks 80
@x 60s)
/C*ai:aates are required to giv-e their ansu:ers in &eir own words:es fzlr ffracticable.
,/ AttemptAll questions-
t fheisures in the margin tndicate fiutt Msrks.
,/ Assume suitable data if necessary.
!
1. What is the size of frarire buffer required to store a SVGA with 24 bit true color video of
10 min wtthout-compression? t4]
2. algorithm
Digtiz0 the endpoint (10, 18), (15, 8) using Bresenham's t8l
3. find the composite transformation matrix for reflection about a line y : mx*c. t8]
4. Find the new cgordinates of a unit cube 90":rotated about an axis defined by its endpoints
5. Why 3D graphics is more complex than 2D graphics? Explain with the help of viewing
t8I
6. Exptaiu about paramet'ic cubic curve? What is aBezier Curve? Explain its properties. .[3+3+2]
7. Explain how the geometric and attribute information of a three dimensional objects are
stored for the object representation? What are the conditions for error free generation of
polygon table? [5+3i
8. Differentiate between image space and object spzrce methods of visible surface detection.
Describe A:Buffer method of ,itibt" surface deiection. I4+p]
9. Explaig the Gourad shading for polygon-rendering and compare it with phong shading. , [8+2]
10. Write short notes on: (any two) $xll
a) Specular Reflection
b) Midpoint circle decision parameter
c) Application of OpenGL in Computer Graphics .
trl.,F
-t
I
l.
rt
Subiect: - Graphics
Candidates are required to give their answers in their own words as far as practicable.
Attempt Alt questtons. 1
Thefigures in the margin indicate F.utt Marks. --''- i
5. Forrnulate a inatoix that converts 2-D scene described in world ioordinates to" viewing
coordinates. UOl .i
6. What are the object space aird image space method of hidden surface removal? Describe I
I
i
I
{
_l
-.!
I
'1
I
t
-1
i
{
rl
t
1
- I
-r
-1
I
i",#slt'
I
I
t 36 TRIBHUVAN UNIVERSITY I
T.NSTITUTE OF ENGINEERING Level BE Full Marks 80
r Examination Control Division Programme BEX, BCT Pass Marks. 32
i ,2067 Mangsir Year / Part III/IT Time 3 hrs.
Candidatesure required to give their answers in thcir own words as far as practicable,
I
Attentpt All
questions.
I
L
Thefigures in the margin indicate Full Marks.
A.ssume suitable data if necessary.
j
1. Write down the mid point circle algorithm. How symmetry of circle helps to reduce
computation steps? Explain. [6++]
2. Write down the Bresenham's line drawingo algorithm for drawing straight line with
consideration of all the slope categories. : [0]
i
I
3. Which transformation converts a square to.a rhombus? Obtain reflection matrix to reflect
ti'
'l
4. A unit length cube with a diagonal passing through fO,o,ol'irifltTit,t) is'sh.ared with
respect to yz plane with the shear constants = 2 in both directions. Obtainthe coordinates
I
i.I
5. A 3-D scene is viewed from point (1,1,1) wiih'camera orientation described by the
orientation of
three orthogonal vectors (1,1,1), (1,2,-3) and (-5,4,1). Obtain the
transformation matrix'to describe the scene withftspbdt to cameia oiiCniation. I l0]
6. What are object space and image space method of hidden surface removal? Describe one
of the image space methods of hidden surface.removal.. - .-...,.- .'...-.,!r [4+6]
i
i 7. Explain the Phong shading algorithm. Mention the advantages of Phong shading over
Gouraud shading. [71-3]
I
8. Write short notes on: (any two) Is+5]
a) Bezier Curve
b) Resolution and Aspect ratio of a Monitor
c) Flat panel Displays
, !t{.*
!
1
I
I
I
I
-'I
I I
36 TRIBHWAIIIINTVSRSITT :
Exam.
-arl
-l
-l
I
I
i
,/ Candidates are required to give their answers in their own words as far as practicable.
'/ Attempt All questions. -''l
,/ Allquestions carry equal marlcs. I
i
'']
.lVDevise Bresenham's decision para:neters for a staigh! line with negative slope with
I
l*l < 1, applylng left to right sampling. Assume that the line is in first quadrant.
.t
--l
-/ :
Calculate all the pixels of a circle witli radius 10 and center at (50, 50) in the first octant
t starting from (50, 60) proceeding to positive x a:ris direction.
,,,
f,,.Yusnfy with necessary matrix operations that the two successive rotations in 2-D is
I
I
.additive. I
4/.A 2 units length cube with a diagonal passing through (0,0,0) and (2,2,2) is spinning -t
\'/ about an axis.parallel to z-a:ris with angle 180 degree. Obtain the matrix involyed for the
I
operation.-
l
5. ,perive appropriate mathematical relation to transform 2-D scene (points). in world I
i
-/ window to nonhalized view window. I
assumptrons. :
-t
i
-l
)
I
I
-1
i I
I
I
': I
-..1
I
I I
-l
t
-r
l
I
I
,-".J
-t i