CS602-Midterm
1 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
2 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
3 / 50
We can take transpose of any matrix.
4 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
5 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
6 / 50
Global coordinate systems can be defined with respect to local coordinate system
7 / 50
In video text memory, ______ are used to display a character.
8 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
9 / 50
25 * 10 resolution with 16 colors supports
10 / 50
Boundary Filling Algorithm can work for complex polygons.
11 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
12 / 50
Perspective projection is specified with the function glFrustum().
13 / 50
Shadow mask methods can display a __________ range of colours.
14 / 50
Polygons are basically concave polygons that may have self-intersecting edges
15 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
16 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
17 / 50
18 / 50
Each number that makes up a matrix is called an __________ of the matrix.
19 / 50
20 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
21 / 50
There are _________ basic types of polygon.
22 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
23 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
24 / 50
25 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
26 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
27 / 50
28 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
29 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
30 / 50
Shadow mask methods can display a __________ range of colors.
31 / 50
Discard a line with both endpoints outside clipping boundaries is called as
32 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
33 / 50
Rotating a point requires
34 / 50
35 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
36 / 50
the horizontal refresh ------------------------------
37 / 50
There are _______ basic types of polygon.
38 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
39 / 50
In __________ algorithm(s), old color must be read before it is invoked.
40 / 50
____is the tendency of the text to flash as it moves up or down.
41 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
42 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
43 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
44 / 50
Bezier curve is tangent to the lines connecting ____.
45 / 50
46 / 50
The dot product of two vectors A and B is __________. Iff the angle between them is less than 20 or greater than 270 degrees.
47 / 50
Two points are said to be collinear, if they lie on the
48 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
49 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
50 / 50
Various curve functions are useful in ______.
Your score is
The average score is 54%
Restart quiz
