###
Computer Science 598d

Thought Exercise #3

Scene Graph Comparision

Due: March 31, 1998

We have written programs that optimize scene graphs. The new scene
graphs have fewer nodes, better bounding volume hierarchies, etc.
But, how do we know that they describe the same objects as the original
scene graph?
Please email me a one/two paragraph description of an algorithm that
can be used to determine whether two arbitrary scene graphs describe a
scene with the same geometric and material properties before class on March
31.