CS602-Midterm
1 / 50
Tessellation can be adaptive to the ____________ degree of curvature of a surface.
2 / 50
Sutherland-Hodgeman clipping algorithm clips any polygon against a concave clip polygon
3 / 50
Perspective projection is specified with the function glFrustum().
4 / 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.
5 / 50
Bezier curve can represent the more complex piecewise ___________ curve.
6 / 50
Cross product of two vectors result in a ___________.
7 / 50
Vectors can be multiplied in a way
8 / 50
Which one of the following step is not involved to write pixel using video BIOS services.
9 / 50
Twice the radius of circle is called as ___________.
10 / 50
If the polygons are _______, line-clipping techniques are sufficient for clipping.
11 / 50
Which one is not valid out code to perform trivial accept / reject test in line clipping:
12 / 50
When scaling factor Sx and Sy are assigned the same value, __________ scaling is produced that maintains relative object proportions.
13 / 50
DDA abbreviated for ________.
14 / 50
The basis functions fi(u) in Bezier curve must be symmetric with respect to u and (u-2)
15 / 50
A scaling transformation alters the ______ of an object.
16 / 50
Concave polygons are superset of________ polygons, having fewer restrictions than ______polygons.
17 / 50
The circle and ellipse are symmetric across 1 octants.
18 / 50
Boundary Filling Algorithm can work for complex polygons.
19 / 50
The process of subdivision an entity or surface into one or more non-overlapping primitives.
20 / 50
Set up your tripod and pointing the camera at the scene
21 / 50
Both Boundary Filling and Flood filling algorithms are ____ as compared to scan line filling algorithm.
22 / 50
25 * 10 resolution with 16 colors supports
23 / 50
To move a _________ from one location to another, we translate the center point and redraw the same using new center point.
24 / 50
Discard a line with both endpoints outside clipping boundaries is called as
25 / 50
actual filling process in boundary filling algorithm begins when a point ____ of the figure is selected.
26 / 50
Rotating a point requires
27 / 50
We can draw the circle using _________
28 / 50
Both Boundary Filling and Flood filling algorithms are non-recursive techniques.
29 / 50
Rotation performed around a fixed point called ____________.
30 / 50
polygons are basically concave polygons that may have self-intersecting edges.
31 / 50
A unit vector has zero magnitude.
32 / 50
__________transformation produces shape distortions as if objects were composed of layers that are caused to slide over each other.
33 / 50
“Computer Graphics” and “Computer Vision” are ____________.
34 / 50
Concave polygons are a superset of ____________ polygons, having fewer restrictions than ___________ polygons.
35 / 50
36 / 50
There are _______ basic types of polygon.
37 / 50
In __________ algorithm(s), old color must be read before it is invoked.
38 / 50
39 / 50
Various curve functions are useful in ______.
40 / 50
It is safe to assume that all raster-type monitors can accept the same input
41 / 50
42 / 50
Computer graphics is very helpful in producing graphical representations for scientific visualization.
43 / 50
44 / 50
45 / 50
Geometric patterns that is repeated at ever smaller scales to produce irregular shapes and surfaces are called ___________
46 / 50
In Trivial acceptance/reject test there are four bits of nine regions, Bit 3 represents condition_____.
47 / 50
We can draw eight points corresponding to each (x , y) point calculation in _________ drawing algorithm.
48 / 50
49 / 50
Two points are said to be collinear, if they lie on the
50 / 50
The actual filling process in boundary filling algorithm begins when a point _________ of the figured is selected.
Your score is
The average score is 54%
Restart quiz
