CPS 124/296.3
Fall 2001

Data Structures


Many Complex Objects in Large Areas

Point location
Line clipping
Object intersection
Ray tracing
Hidden surface removal

Step 1: Simplify Objects

Axis aligned rectangles/cubes and circles/spheres are trivial to intersect against
Create bounding regions for complex objects
Refine bounding region as necessary

Step 2: Divide and Conquer Space

Uniform Grid
Quad-tree
Octtree
Binary Space Partition, BSP, tree
K-d tree
Can be made adaptive

Dynamic Objects

Active area of research
Perform incremental updates after each move rather than rebuild tree

References

Notes on graphics data structures
Visualization of hierarchical data structures
Spacial Indexing Applet
Continuous LOD Terrain Meshing Using Adaptive Quadtrees by T. Ulrich
Indexing Moving Points by P. Agarwal, L. Arge, J. Erickson
 

Feedback?