Содержание
- 2. 10/09/2001 CS 638, Fall 2001 Spatial Data Structures Spatial data structures store data indexed in some
- 3. 10/09/2001 CS 638, Fall 2001 Spatial Decompositions Focus on spatial data structures that partition space into
- 4. 10/09/2001 CS 638, Fall 2001 Using Decompositions Many geometric queries are expensive to answer precisely All
- 5. 10/09/2001 CS 638, Fall 2001 Octree Gems Ch 4.10 Root node represents a cube containing the
- 6. 10/09/2001 CS 638, Fall 2001 Octree Node Data Structure What needs to be stored in a
- 7. 10/09/2001 CS 638, Fall 2001 Building an Octree Define a function, buildNode, that: Takes a node
- 8. 10/09/2001 CS 638, Fall 2001 Example Construction
- 9. 10/09/2001 CS 638, Fall 2001 Assignment of Objects to Cells Basic operation is to intersect an
- 10. 10/09/2001 CS 638, Fall 2001 Polygon-Cell Intersection Tests: Poly-Planes Tests Planes are chosen because testing for
- 11. 10/09/2001 CS 638, Fall 2001 Polygon-Cell Intersection Tests: Edge-Cube Test Testing an edge against a cube
- 12. 10/09/2001 CS 638, Fall 2001 Polygon-Cell Intersection Tests: Interior-Cube Test Test for this type of intersection
- 13. 10/09/2001 CS 638, Fall 2001 Approximate Assignment Recall, we typically use spatial decompositions to answer approximate
- 14. 10/09/2001 CS 638, Fall 2001 Objects in Multiple Cells Assume an object intersects more than one
- 15. 10/09/2001 CS 638, Fall 2001 Neighboring Cells Sometimes it helps if a cell knows it neighbors
- 16. 10/09/2001 CS 638, Fall 2001 Finding Neighbors Your right neighbor in a binary tree is the
- 17. 10/09/2001 CS 638, Fall 2001 Frustum Culling With Octrees We wish to eliminate objects that do
- 18. 10/09/2001 CS 638, Fall 2001 Frustum Culling With Octrees We wish to eliminate objects that do
- 20. Скачать презентацию