CS602-Midterm
1 / 50
Three or more points that lie on the same line are called _____.
2 / 50
________ is the set of points that are equidistant from its origin.
3 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
4 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
5 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
6 / 50
In video text memory, ______ are used to display a character.
7 / 50
In 2D transformation, ______ can be achieved by rotating the object about 110 degrees.
8 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
9 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
10 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
11 / 50
If the polygons are _________ line clipping techniques are sufficient for clipping.
12 / 50
We can take transpose of __________.
13 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
14 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
15 / 50
Two points are said to be collinear, if they lie on the
16 / 50
A * B = |A| * |B| * cos(?) Where ? is the angle between the two vectors
17 / 50
Discard a line with both endpoints outside clipping boundaries is called as
18 / 50
Perspective projection is specified with the function glFrustum().
19 / 50
Vectors can be multiplied in a way
20 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
21 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
22 / 50
Various curve functions are useful in ______.
23 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
24 / 50
Twice the radius of circle is called as ___________.
25 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
26 / 50
A scaling transformation alters the ______ of an object.
27 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
28 / 50
We can draw the circle using ___________.
29 / 50
30 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
31 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
32 / 50
33 / 50
There are _______ basic types of polygon.
34 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
35 / 50
DDA abbreviated for ________.
36 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
37 / 50
38 / 50
The circle and ellipse are symmetric across 1 octants.
39 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
40 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
41 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
42 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
43 / 50
Silhouette edges occur when dot product of surface normal vector and the view vector is __________.
44 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
45 / 50
46 / 50
Polygons consisting of ________ can cause problems when rendering.
47 / 50
Which of the following is not true about matrices?
48 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition_____.
49 / 50
Set up your tripod and pointing the camera at the scene
50 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
Your score is
The average score is 54%
Restart quiz
