Space Partitioning and Scene Graphs

More documents

Recommendations

Info

Object bounding volumes Object-centred data structure Wrap complex objects in simple ones● Level of detail If ray does not intersect boundingvolume, it won't intersect the object Common types:● Axis-aligned boxes● Oriented boxes● Spheres● Convex hullsCMPT370: spatial data structures 2 Apr 20098
Bounding volume hierarchies Straightforward bounding volumes still storeobjects in a flat list: O(n) intersection tests Use a tree structure: boxes within boxes Recursively test for intersections:● If ray misses large box,don't need to descend tree● If ray hits large box,recurse into smaller boxes Challenges:● Constructing full balanced treeCMPT370: spatial data structures 2 Apr 20099
Page 1 and 2: Data Structures for Modelling2 Apri
Page 3 and 4: Why use spatial data structs? Geome
Page 5 and 6: Octrees In 1D: binary tree In 2D: q
Page 7: Building balanced trees Use the obj
Page 11 and 12: Controlling detail Consider project
Page 13 and 14: The OSG distribution Core OSG: main
Page 15 and 16: OSG::Group Generic node thatmay con
Page 17 and 18: OSG::Geode Contains the actual geom
Page 19: OSGEdit Import models from other pr

Space Partitioning and Scene Graphs

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?