CS602-Midterm
1 / 50
Boundary Filling Algorithm can work for complex polygons.
2 / 50
Rotating a point requires
3 / 50
Global coordinate systems can be defined with respect to local coordinate system
4 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
5 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
6 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
7 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
8 / 50
________ is the set of points that are equidistant from its origin.
9 / 50
________is used to move a point, or a set of points, linearly in space
10 / 50
We can take transpose of __________.
11 / 50
“Computer Graphics” and “Computer Vision” are ____________.
12 / 50
13 / 50
We can draw the circle using _________
14 / 50
It is safe to assume that all raster-type monitors can accept the same input
15 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
16 / 50
17 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 4 represents condition _____.
18 / 50
The equation of hyperbola centered at origin (if the transverse axis is along x -axis) can be given as:
19 / 50
Computer Graphics are used in _______.
20 / 50
Shadow mask methods can display a __________ range of colours.
21 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
22 / 50
A scaling transformation alters the ______ of an object.
23 / 50
_________ direct view storage tube maintains the picture display.
24 / 50
Shortcoming of Sutherland-Hodgeman Algorithm is concave polygons may be displayed with extensors lines
25 / 50
26 / 50
Each number that makes up a matrix is called an __________ of the matrix.
27 / 50
Each hyperbola consists of two __________ .
28 / 50
29 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 1 represents condition_____.
30 / 50
To show 256 colors , the no of bits required for each pixel are
31 / 50
The ______ tests are performed for the midpoints between pixels near the circle path at each sampling step.
32 / 50
Polygons consisting of ________ can cause problems when rendering.
33 / 50
Which of the following statements is not true about flood-fill and boundary-fill? Algorithms?
34 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
35 / 50
If the value of scaling factors sx and sy is greater than 1, then size of objects will be ____________.
36 / 50
A line, or straight line, is, roughly speaking, an (infinitely) thin, (infinitely) long, straight geometrical object.
37 / 50
__________ projection is obtained by projecting points along parallel lines that are not perpendicular to the projection plane.
38 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
39 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
40 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
41 / 50
42 / 50
A two dimensional rotation is applied to an object by repositioning it along a _____ path in the XY plane
43 / 50
In ______ transformation one coordinate is held fixed and the other coordinate or coordinates are shifted.
44 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
45 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
46 / 50
the horizontal refresh ------------------------------
47 / 50
Locations can be translated or "transformed" from one coordinate system to the other. Select correct option:
48 / 50
49 / 50
We can take transpose of any matrix.
50 / 50
Vectors can be multiplied in a way
Your score is
The average score is 54%
Restart quiz
