CS602-Midterm
1 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
2 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____path in the XY plane
3 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
4 / 50
Plasma-panel displays use a gas mixture that usually includes ____.
5 / 50
Cross product of two vectors result in a ___________.
6 / 50
Process of moving points in space is called
7 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
8 / 50
Twice the radius of circle is called as ___________.
9 / 50
Intensity of the electron beam is controlled by setting _________ levels on the control grid, a metal cylinder that fits over the cathode.
10 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
11 / 50
Which of the following is not true about matrices?
12 / 50
Save a line with both endpoints inside all clipping boundaries.
13 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
14 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
15 / 50
Finding unit vector is done by simply dividing each component by the width.
16 / 50
the horizontal refresh ------------------------------
17 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
18 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
19 / 50
Vectors can be multiplied in a way
20 / 50
A _________ is the set of all points (x , y) that are the same distance from the directrix and focus not on the directrix.
21 / 50
Three or more points that lie on the same line are called _____.
22 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 2 represents condition_____.
23 / 50
Boundary Filling Algorithm can work for complex polygons.
24 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
25 / 50
To show 256 colors , the no of bits required for each pixel are
26 / 50
Bezier curve is tangent to the lines connecting ____.
27 / 50
Parity is a concept used to determine which ________ lie within a polygon.
28 / 50
Computer Graphics are used in _______.
29 / 50
We can draw the circle using _________
30 / 50
In __________ algorithm(s), old color must be read before it is invoked.
31 / 50
In video text memory, ________ are used to display a character.
32 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
33 / 50
_________ OpenGL function is used for aiming and positioning the camera towards the object
34 / 50
There are _________ basic types of polygon.
35 / 50
Shadow mask methods can display a __________ range of colors.
36 / 50
The circle and ellipse are symmetric across 1 octants.
37 / 50
Translation moves objects without ____________.
38 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
39 / 50
According to Odd Parity Rule, a point is inside the polygon, if:
40 / 50
Two matrices are said to be equal, if they have
41 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
42 / 50
________ is the set of points that are equidistant from its origin.
43 / 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.
44 / 50
__________ is the process of describing an object or scene so that we can construct an image of it
45 / 50
46 / 50
__________ transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
47 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
48 / 50
UV light is used in Plasma Panel displays to excite phosphor.
49 / 50
Polygons consisting of ________ can cause problems when rendering.
50 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
Your score is
The average score is 54%
Restart quiz
