BSP Tree FAQ

BSP Tree Frequently Asked Questions (FAQ)

Full Listing

Questions

  1. CHANGES
  2. ABOUT THIS DOCUMENT
  3. ACKNOWLEDGEMENTS
  4. HOW CAN YOU CONTRIBUTE?
  5. ABOUT THE PSEUDO C++ CODE
  6. WHAT IS A BSP TREE?
  7. HOW DO YOU BUILD A BSP TREE?
  8. HOW DO YOU PARTITION A POLYGON WITH A PLANE?
  9. HOW DO YOU REMOVE HIDDEN SURFACES WITH A BSP TREE?
  10. HOW DO YOU COMPUTE ANALYTIC VISIBILITY WITH A BSP TREE?
  11. HOW DO YOU ACCELERATE RAY TRACING WITH A BSP TREE?
  12. HOW DO YOU PERFORM BOOLEAN OPERATIONS ON POLYTOPES WITH A BSP TREE?
  13. HOW DO YOU PERFORM COLLISION DETECTION WITH A BSP TREE?
  14. HOW DO YOU HANDLE DYNAMIC SCENES WITH A BSP TREE?
  15. HOW DO YOU COMPUTE SHADOWS WITH A BSP TREE?
  16. HOW DO YOU EXTRACT CONNECTIVITY INFORMATION FROM BSP TREES?
  17. HOW ARE BSP TREES USEFUL FOR ROBOT MOTION PLANNING?
  18. HOW ARE BSP TREES USED IN DOOM?
  19. HOW CAN YOU MAKE A BSP TREE MORE ROBUST?
  20. HOW EFFICIENT IS A BSP TREE?
  21. HOW CAN YOU MAKE A BSP TREE MORE EFFICIENT?
  22. HOW CAN YOU AVOID RECURSION?
  23. WHAT IS THE HISTORY OF BSP TREES?
  24. WHERE CAN YOU FIND SAMPLE CODE AND RELATED ONLINE RESOURCES?
  25. REFERENCES
BSP Tree FAQ (bspfaq@sgi.com)

Kindly sponsored by Silicon Graphics, Incorporated.