Computer Science 455
Instructor: R. P. Burton
Third Quiz
February 14-15, 2005
Name _________________________________________ Score ____________/39
How many points in homogeneous space map (correspond) to a single point in two-dimensional space?
just one
exactly two
infinitely many
(c)
If you have a matrix that is the composition of several individual two-dimensional affine transformations, it’s inverse should be computed using
Cramer’s rule
Gauss elimination with partial pivoting
Gauss elimination with full pivoting
any of the above – none had advantages over any of the others
(b)
Suppose you know the individual affine transformations used to produce a composite matrix. The inverse of the composite matrix can be determined by
multiplying the matrices together in the opposite order
inverting the individual matrices and multiplying them together in the same order
inverting the individual matrices and multiplying them together in the opposite order
(c)
Reflection through the origin is the equivalent of
scaling by -1 in x and -1 in y
rotating through 180 degrees
both (a) and (b)
(c)
It is meaningful to speak of, and reasonable to program, all of the following except
reflection across a principal axis
reflection across a line parallel to a principal axis
reflection across an arbitrary line
reflection through the origin
reflection through an arbitrary point
(no exceptions here)
(f)
The inverse of a shearing transformation is realized by
negating the shearing factor
inverting the shearing factor
negating and inverting the shearing factor
(none of the above)
(a)
Shearing first in x and then in y produces the same results as shearing first in y and then in x, with the same shearing factors.
true
false
(b)
The inverse of a composite shearing matrix (which shears in both x and y) is realized by _____ in the composite matrix.
negating the shearing factors
inverting the shearing factor
negating and inverting the shearing factors
(none of the above)
(d)
If you have a unit square with vertices at (1,0), (2,0), (2,1), and (2,2) and you shear y based on x, how many vertices remain in their original positions? (NOTE: these points do not actually form a square, but that doesn’t change the answer)
none
one
two
(a)
How many nonzero elements would be in a matrix for translating data involving 6 variables (what you and I would refer to as six-dimensional data)?
6
7
12
13
14
(d)
A single rule could be provided which would suffice for inverting a scaling matrix for data with 2, 3, …, 100 variables. (Assume no scaling factors with the value 0.)
true
false
(a – invert all the elements on the diagonal)
As expressed in a single, easily-writable matrix, translation in nD involves up to n translation factors; scaling in nD involves up to n scaling factors; rotation in nD involves ___ sines and ___ cosines.
2
n/2
n
(a)
What is the most consistent way to speak about rotation, independent of the dimensionality of the space?
“about a point”
“about a line”
“about an entity of dimension one less than the dimension of the space in which the rotation is taking place”
“as keeping the coordinates in the something-something plane”
(d)
Why is the minus sign on the sine in a “funny” place for “rotation about the y-axis (to use the common parlance)”
because computer graphics uses left-handed coordinates
because computer graphics uses a y axis which points downward
because rotation “about the y-axis” is clockwise whereas other rotations are counterclockwise
because the sines and cosines migrate down and to the right as you advance from rotation about x to rotations about y to rotations about z
(d)
For rotation about an axis not parallel to a principal axis, it is appropriate (and usually necessary) to find an arctangent (or an arccotangent).
true
false
(b)
Suppose you have an arbitrary line segment with one end at the origin. Rotation of this arbitrary line segment about the z-axis changes the _____ coordinates of the other end of the line segment.
x and y
x and z
y and z
x, y, and z
(a)
In order for rotation to occur about an arbitrary line segment, the (extended) arbitrary line segment MUST pass through the origin.
true
false
(b)
x points in, y points up, and z points left. Where is the minus sign for clockwise rotation about z?
first row
second row
third row
(a)
Reflection in 3D can take place relative to all of the following EXCEPT
an arbitrary point
an arbitrary line
an arbitrary plane
(no exceptions here)
(d)
Two reflection transformations A and B are commutative (i.e. AB = BA).
true
false
(a)
In 3D it possible to shear x with respect to all of the following EXCEPT
x
y
z
y and z
(no exceptions here)
(e)
In general, to rotate about an arbitrary line segment, two “preparatory” rotations precede the intended rotation. In these two “preparatory” rotations, the hypotenuse(s) (determined by the arbitrary line segment) used to calculate sines and cosines is/are
the same
different
(b)
Suppose an object J is defined in a coordinate system C which is defined relative to the origin of world coordinates W. To represent J relative to W
find a transformation which maps C onto W and apply it to J
find a transformation which maps W on to C and apply it to J
find a transformation which maps C onto W and apply it to C
find a transformation which maps W on to C and apply it to C
(b)
Suppose you want to rotate the little flag on the mail box to indicate there is mail to be picked up. The little flag is to be rotated about its origin, which, conveniently, is precisely where the nut and bolt are. But, the flag’s position is described relative to the mailbox whose position is described related to the farm whose position is described relative to the county whose position is described relative to the state, …. relative to the sun. To rotate the flag, find a transformation which maps
the flag coordinate system to the sun coordinate system
the sun coordinate system to the flag coordinate system
(b)
Traditionally (i.e. as graphics was being developed), a window was a region of
the world
the display surface
(a)
Changes to the window _____ affect the contents of the scene (as presented to the user); changes to the viewport _____ affect the contents of the scene (as presented to the user).
directly, directly
directly, inversely
inversely, directly
inversely, inversely
(c)
The window-to-viewport transformation can be expressed as one or more affine transformations.
true
false
(a)
A rotated window _____; a rotated viewport _____.
makes sense, makes sense
makes sense, doesn’t make much sense
doesn’t make much sense, makes sense
doesn’t make much sense, doesn’t make much sense
(b)
All things considered, clipping should take place relative to the _____ rather than relative to the ______.
window, viewport
viewport, window
(b)
For whom is the standard point-clipping algorithm named?
Sutherland
Hodgman
Weiler
Atherton
nobody – it hardly took much thought to develop it
(e)
Given the endpoint codes for Cohen Sutherland clipping, it is possible to determine all of the following EXCEPT
trivial acceptance
trivial rejection
exactly which actual clipping region boundaries are crossed
(no exceptions here)
(c)
Cohen Sutherland with midpoint subdivision is computationally efficient whether endpoint codes are represented as integers or as floating point values.
true
false
(b)
The “p’s and q’s” of Liang and Barsky communicate (or facilitate the easy calculation of) all of the following EXCEPT
lines parallel to a window boundary
the direction from which the (extended) line crosses the (extended) boundary
the point at which the (extended) line crosses the (extended) boundary
Whether or not the actual line crosses the actual boundary
(no exceptions here)
(d)
For Nicholl Lee Nicholl, the slope of a line segment needs to be compared against the slope of _____ other line(s) to determine which boundaries it crosses.
one
two
four
nine
(c)
Sutherland Hodgman can produce lines which were never part of the original polygon, but only for concave subject polygons.
true
false
(a)
The clip polygon for Weiler Atherton must be rectangular, but need not be a rectangle aligned with the coordinate axes.
true
false
(b)
For “all or nothing” string clipping, it is sufficient to clip a diagonal of the bounding box for the string, but the diagonal must be upper-left-to-lower right diagonal if the bounding box intersects the upper-left or lower-right corner of the clipping rectangle.
true
false
(b)
As discussed in class, techniques for clipping curves are beyond the scope of the course.
true
false
(b)
All of the clipping algorithms discussed in class lend themselves to blanking.
true
false
what’s blanking?
(a)