CS602-Midterm
1 / 50
Polygons consisting of ________ can cause problems when rendering.
2 / 50
Boundary Filling Algorithm can work for complex polygons.
3 / 50
By preserving the original shape of an object with a scaling is called _______ scaling.
4 / 50
The given primitives are clipped to the boundaries of _______ and primitives lying outside are not drawn.
5 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
6 / 50
Bezier curve is tangent to the lines connecting ____.
7 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
8 / 50
Computer Graphics are used in _______.
9 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
10 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
11 / 50
Save a line with both endpoints inside all clipping boundaries.
12 / 50
A * B = |A| * |B| * cos(?) where ? is the angle between the two vectors
13 / 50
A unit vector has zero magnitude.
14 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
15 / 50
Concave polygons are a superset of ________ polygons, having fewer restrictions than _____polygons.
16 / 50
Discard a line with both endpoints outside clipping boundaries is called as
17 / 50
18 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
19 / 50
Bernstein polynomial functions are the basic functions of _____ curves.
20 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
21 / 50
DDA abbreviated for ________.
22 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
23 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
24 / 50
Twice the radius of circle is called as ___________.
25 / 50
The father of Computer Graphics is:
26 / 50
Rotation performed around a fixed point called ____________.
27 / 50
Vectors can be multiplied in a way
28 / 50
Rotating a point requires
29 / 50
We can draw the circle using _________
30 / 50
the horizontal refresh ------------------------------
31 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
32 / 50
33 / 50
Which of the following is not true about matrices?
34 / 50
We can take transpose of any matrix.
35 / 50
Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111.
36 / 50
Set up your tripod and pointing the camera at the scene
37 / 50
38 / 50
To show 256 colors , the no of bits required for each pixel are
39 / 50
The circle and ellipse are symmetric across 1 octants.
40 / 50
Which of the following is NOT a modern application for Computer Graphics -------------------
41 / 50
Polygons are basically concave polygons that may have self-intersecting edges
42 / 50
________ is the set of points that are equidistant from its origin.
43 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
44 / 50
45 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
46 / 50
Discard a line with both endpoints outside clipping boundary is called as ____________
47 / 50
Parity is a concept used to determine which ________ lie within a polygon.
48 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
49 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
50 / 50
The axonometric projection is ___________ where the direction of projection makes same angle with all axes.
Your score is
The average score is 54%
Restart quiz
