The scene graph
	l DAG – directed acyclic graph – Simply an n-ary tree without loops l leaves contains geometry l each node holds a – bounding volume (BV) – pointers to children – possibly a transform l examples of BVs: spheres, boxes l the BV in a node encloses all the geometry of the nodes in its subtree