CS602-Midterm
1 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
2 / 50
Normalized cross product of two vectors on that surface provides normal vector
3 / 50
Which of the following is not true about matrices?
4 / 50
We can draw the circle using ___________.
5 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
6 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
7 / 50
In video text memory, ______ are used to display a character.
8 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
9 / 50
Boundary Filling Algorithm can work for complex polygons.
10 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
11 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
12 / 50
13 / 50
Computer Graphics are used in _______.
14 / 50
To show 256 colors , the no of bits required for each pixel are
15 / 50
Discard a line with both endpoints outside clipping boundary is called as ____________
16 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
17 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
18 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
19 / 50
The curve is always contained within the _______ of the control points
20 / 50
Two matrices are said to be equal, if they have
21 / 50
22 / 50
The circle and ellipse are symmetric across 1 octants.
23 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
24 / 50
Each number that makes up a matrix is called an __________ of the matrix.
25 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
26 / 50
____is the tendency of the text to flash as it moves up or down.
27 / 50
_________ OpenGL function is used for aiming and positioning the camera towards the object
28 / 50
Discard a line with both endpoints outside clipping boundaries is called as
29 / 50
A unit vector has zero magnitude.
30 / 50
31 / 50
Vectors can be multiplied in a way
32 / 50
polygons are basically concave polygons that may have self-intersecting edges.
33 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
34 / 50
35 / 50
Parity is a concept used to determine which ________ lie within a polygon.
36 / 50
37 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
38 / 50
We can draw the circle
39 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
40 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
41 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
42 / 50
Various curve functions are useful in ______.
43 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
44 / 50
45 / 50
________ is the set of points that are equidistant from its origin.
46 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
47 / 50
48 / 50
Each hyperbola consists of two __________ .
49 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
50 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
Your score is
The average score is 54%
Restart quiz
