CS602-Midterm
1 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
2 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
3 / 50
Twice the radius of circle is called as ___________.
4 / 50
Rotating a point requires
5 / 50
In video text memory, ______ are used to display a character.
6 / 50
25 * 10 resolution with 16 colors supports
7 / 50
Various curve functions are useful in ______.
8 / 50
Which one of the following is not the graphics library is use:
9 / 50
We can draw the circle
10 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
11 / 50
Silhouette edges occur when dot product of surface normal vector and the view vector is __________.
12 / 50
Parity is a concept used to determine which ________ lie within a polygon.
13 / 50
Shadow mask methods can display a __________ range of colors.
14 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
15 / 50
Save a line with both endpoints inside all clipping boundaries is called as ____.
16 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
17 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
18 / 50
Three or more points that lie on the same line are called _____.
19 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
20 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
21 / 50
There are _________ basic types of polygon.
22 / 50
23 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
24 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
25 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
26 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
27 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____ path in the XY plane
28 / 50
We can draw the circle using ___________.
29 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
30 / 50
Normalized cross product of two vectors on that surface provides normal vector
31 / 50
Bezier curve is tangent to the lines connecting ____.
32 / 50
Each hyperbola consists of two ___________.
33 / 50
Discard a line with both endpoints outside clipping boundaries is called as
34 / 50
We can take transpose of any matrix.
35 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
36 / 50
In __________ algorithm(s), old color must be read before it is invoked.
37 / 50
Boundary Filling Algorithm can work for complex polygons.
38 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
39 / 50
Which of the following is not true about matrices?
40 / 50
41 / 50
_________ direct view storage tube maintains the picture display.
42 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
43 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition _____.
44 / 50
Because clipping against one edge is independent of all others, so it is _______ to arrange the clipping stages in a pipeline.
45 / 50
46 / 50
47 / 50
Vectors can be multiplied in a way
48 / 50
________ is the set of points that are equidistant from its origin.
49 / 50
Rotation performed around a fixed point called ____________.
50 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
Your score is
The average score is 54%
Restart quiz
