CS602-Midterm
1 / 50
Line connecting any two points within a polygon does not intersect any edge, then it will be a _________ polygon.
2 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
3 / 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.
4 / 50
Intensity of the electron beam is controlled by setting __________ levels on the control grid, a metal cylinder that fits over the cathode.
5 / 50
Various curve functions are useful in ______.
6 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
7 / 50
( x^2 / a^2 ) + ( y^2 / b^2 ) = 1 is an equation of __________.
8 / 50
Rotating a point requires
9 / 50
The curve is always contained within the _______ of the control points
10 / 50
Which one of the following is not the graphics library is use:
11 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
12 / 50
In Trimetric the direction of projection makes unequal angle with the three principal axes
13 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
14 / 50
Translation moves objects without ____________.
15 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
16 / 50
Parity is a concept used to determine which ________ lie within a polygon.
17 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
18 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
19 / 50
Bezier curve is tangent to the lines connecting ____.
20 / 50
Orthographic projections that show more than one side of an object are called __________ projections.
21 / 50
The circle and ellipse are symmetric across 1 octants.
22 / 50
23 / 50
24 / 50
Cross product of two vectors result in a ___________.
25 / 50
________ is the set of points that are equidistant from its origin.
26 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
27 / 50
Boundary Filling Algorithm can work for complex polygons.
28 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
29 / 50
We can draw the circle using _________
30 / 50
Polygons consisting of ________ can cause problems when rendering.
31 / 50
There are _________ basic types of polygon.
32 / 50
33 / 50
34 / 50
35 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
36 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
37 / 50
Each hyperbola consists of two ___________.
38 / 50
25 * 10 resolution with 16 colors supports
39 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
40 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
41 / 50
A unit vector has zero magnitude.
42 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
43 / 50
Discard a line with both endpoints outside clipping boundaries is called as
44 / 50
This projection technique has the direction of projection perpendicular to the viewing plane, and the viewing direction is perpendicular to one of the principle faces.
45 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
46 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
47 / 50
“Computer Graphics” and “Computer Vision” are ____________.
48 / 50
We can take transpose of any matrix.
49 / 50
To show 256 colors , the no of bits required for each pixel are
50 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
Your score is
The average score is 54%
Restart quiz
