CS 426 Exercises
Ray Tracing
-
What is a primary ray? a secondary ray?
-
What is a ray tree? What determines the branching
factor at each node of the ray tree?
-
Describe how shadows are determined in a recursive
ray tracer. Extend your answer to consider polygonal
area light sources.
-
Derive the algebraic solution for the intersection
of a ray and a plane.
-
Derive the algebraic solution for the intersection
of a ray and a sphere.
-
Derive the algebraic solution for the intersection
of a ray and an infinite cylinder.
-
Which of the following spatial data structures
partition 3D space into non-overlapping cells:
a) grid, b) octree, c) BSP tree, d) bounding volume
hierarchy?
-
What is the expected computational complexity of
intersecting a ray with a scene containing N triangles
using the following spatial data structures:
a) none, a) grid, c) BSP tree.
-
If L represents emission from a light source, C represents
reception at a camera, D represents a diffuse reflection at a surface,
and S is a pure specular reflection at a surface, which of the
following ray paths are modeled by your ray tracer of assignment #3:
a) LDC
b) LSC
c) LDDC
d) LSSC
e) LSDSC
f) LDSDC
-
Ray tracing is an approximate solution method for
the rendering equation. Explain.