Computer Science 455
Instructor: R. P. Burton
Fifth Quiz
March 14-15, 2005
Name _________________________________________ Score ____________/52
Pick the best technique for modeling a best friend’s face
constructive solid geometry
polygonal approximation
fractals
particle systems
sweeping
(b)
Pick the best technique for modeling Mt. Timpanogos for a fly-by movie
constructive solid geometry
polygonal approximation
fractals
particle systems
sweeping
(c)
Pick the best technique for modeling a fire on the west side of Mt. Timpanogos
constructive solid geometry
polygonal approximation
fractals
particle systems
sweeping
(d)
Pick the best technique for modeling the gears inside a watch
constructive solid geometry
polygonal approximation
fractals
particle systems
sweeping
(a)
Pick the best technique for modeling a curved, tapered rod
constructive solid geometry
polygonal approximation
fractals
particle systems
sweeping
(e)
Which of the following is a quadric surface?
an ellipse
an ellipsoid
a hyperellipsoid
(all are quadric surface)
(b)
Which of the following is most likely to qualify as a “blobby” object?
a basketball
a medicine ball
a bicep
a chunk of snow frozen solid
(c)
Projection from 3D to 2D is a reversible transformation.
true
false
(b)
Brighter lines appear closer than fainter lines (assuming other characteristics are common to both sets of lines) to all users.
true
false
(b)
A line that is presented as a dashed line or as a colored line should not be referred to as a “hidden” line.
true
false
(b)
Parallel projection is preferable to perspective projection only because it is easier and less expensive to do.
true
false
(b)
In a parallel projection, the direction of projection is
parallel to the screen
perpendicular to the screen
at almost any angle to the screen
(c)
It _____ possible to have a parallel, orthographic, axonometric, isometric projection.
is
is not
(a)
Which projection “looks” more realistic?
cavalier
cabinet
(b)
An image presented on a screen as a perspective projection is most realistic if the viewing coordinates are divided by
the depths (z) of the corresponding points
the distance to the corresponding point (which considers x, y, and z)
the depths (z) and either x or y
(a)
Where MUST the origin of coordinates be in order to produce correct projections?
at the eye
at the center of the view plane
either (a) or (b) works
(c)
Every set of parallel lines not parallel to the projection screen can produce a vanishing point.
true
false
(a)
Transforming from world coordinates to viewing coordinates is simply a special case of transforming from one coordinate system to another.
true
false
(a)
What is the shape of the view volume for parallel projection?
a finite parallelepiped
an infinite parallelepiped
a finite frustum
an infinite frustum
(b)
An oblique projection can be converted to an orthographic projection simply by shearing.
true
false
(a)
The sole purpose of near and far planes is to take cross sections (i.e. to eliminate some elements or parts of elements).
true
false
(b)
What is the shape of a normalized view volume? (pick the most specific, accurate answer)
an infinite parallelepiped
an infinite rectangular parallelepiped
a finite parallelepiped
a finite rectangular parallelepiped
a cube
(e)
To convert from a perspective projection to an equivalent parallel projection,
divide by depth
(it can’t be done; there is no one-to-one correspondence)
(a)
All of the following extend easily to three dimensions except
Cohen-Sutherland
Liang & Barsky
Nicholl Lee Nicholl
(no exceptions here)
(c)
A parametric representation of a curve overcomes all of the following except
multiple values of x for some values of y
multiple values of y for some values of x
self-intersection
(no exceptions here)
(d)
Two curve sections with a common endpoint and common tangents at that endpoint exhibit ______ continuity.
no
zero-order
first-order
second-order
(c)
Parametric forms are suitable for curves, but not for surfaces (which extend in multiple dimensions).
true
false
(b)
All things considered, curves which _______ control points generally are preferred.
approximate
interpolate
(a)
Like the Bresenham formulation, the Bezier coordinate function is mathematically sound, but devoid of any obvious intuitive meaning.
true
false
(b)
Given 5 sets of 6 points, how many Bezier blending functions are needed?
4
5
6
7
30
(c)
If and only if the control points (taken in order) determine a convex polygon is there a convex hull for the corresponding Bezier curve.
true
false
(b)
Pick the most complete (and still true) of the following statements:
A Bezier curve can be closed
and the tangents at the point of closure can match.
(b)
Bezier curves exhibit _____ control; B-spline curves exhibit _____ control.
local, local
local, global
global, local
global, global
(c)
Pick the most complete (and still true) of the following statements:
A B-spline curve can be closed
and the tangents at the point of closure can match.
(b)
If Bezier techniques are used to model the surface of an automobile, it is impossible to change the shape of the hood without affecting the shape of the boot (the trunk).
true
false
(b)
If B-spline techniques are used to model the surface of an automobile, it is impossible to change the shape of the hood without affecting the shape of the boot (the trunk).
true
false
(b)
Ray casting is suitable for all of the following EXCEPT
union
intersection
difference
(no exceptions here)
(d)
To store information in an octree (assuming the same resolution in all directions) requires about ______ more memory than storing information in a quadtree.
50%
100%
200%
n3-n2 where n is the resolution in each direction
(d)
All of the following can occur during sweeping EXCEPT
translation along a non-linear path
rotation
scaling
shearing
(no exceptions here)
(e)
Most contemporary hidden-element algorithms are _____-space algorithms.
object
image
(b)
For a scene composed of closed polyhedra, back-face elimination removes approximately _____ of the faces.
1/10
1/5
½
¾
90%
(c)
If the scene is represented in viewing coordinates, back-face removal requires (for each planar polygon)
the planar coefficients
the planar coefficients except D
just one of the planar coefficients
the sign of just one of the planar coefficients
(d)
The depth-buffer method ______ surfaces to be sorted before they are processed by the (remainder of the) algorithm.
requires
does not require
(b)
Calculating the depth of the second of two adjacent points (for the z-buffer algorithm) requires
adding or subtracting a constant
adding or subtracting the result of a division of constants unique to the adjacent point
calculating planar coefficients for the adjacent point, and adding or subtracting the division of the planar coefficients
(a)
The scan-line method _____ surfaces to be sorted before they are processed by the (remainder of the) algorithm.
requires
does not require
(b)
What is the maximum number of surfaces that can be “on” for the purposes of the scan-line algorithm?
one
two
unlimited
(c)
Since a polygon can have an arbitrary orientation (making it possible for polygons to overlap in x, y, and/or z), it is not possible to sort polygons by depth.
true
false
(b)
Suppose polygons can be ordered so that no two polygons overlap in z. If the polygons are scan-converted in order of decreasing depth, the resulting presentation will contain the visible surfaces (and visible portions of surfaces).
true
false
(a)
Suppose polygons can be ordered so that no two polygons overlap in x. If the polygons are scan-converted in ANY order, the resulting presentation will contain the visible surfaces (and visible portions of surfaces).
true
false
(a)
Which test is likely to be helpful for ordering polygons?
Are all the vertices of one polygon further away than the plane of the other surface?
Are all the vertices of the other surface closer than the plane of the one surface?
(both (a) and (b) are helpful)
(c)
Painter’s algorithm sometimes requires dividing polygons, even when the polygons are planar.
true
false
(a)
Which of the following visible element techniques does not lend itself well to partially transparent surfaces?
z-buffer
scan-line
depth-sorting
(all lend themselves well to partially transparent surfaces)
(a)