Deferred, self-organizing BSP trees

Computer Graphics Forum

Volumn 21, Issue 3, 2002, Pages 269-278

  Ar, Sigal ^a   Montag, Gil ^a   Tal, Ayellet ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Binary space partitioning; Collision detection; Deferred data structures; Ray shooting; Self organizing data structures; Walkthrough

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INFORMATION ANALYSIS; TREES (MATHEMATICS);

BINARY SPACE PARTITIONING (BSP) TREES;

DATA STRUCTURES;

EID: 0036732077     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.t01-1-00586     Document Type: Conference Paper

References (25)

1. Cylindrical static and kinetic binary space partitions
2. Self-organizing data structures
3. Self-customized BSP trees for collision detection
4. The buffer tree: A new technique for optimal I/O-algorithms
5. Average-case ray shooting and minimum weight triangulations
6. BOXTREE: A hierarchical representation for surfaces in 3D
7. Computing dynamic changes to BSP trees
8. Shadow volume BSP trees for computation of shadows in dynamic scenes
9. I-COLLIDE: An interactive and exact collision detection system for large-scaled environments
10. Fast detection of polyhedral intersection
11. On visible surface generation by a priori tree structures
12. OBBTree: A hierarchical structure for rapid interference detection
13. Evaluation of collision detection methods for virtual reality fly-throughs
14. Deferred data structuring
15. Constructing good partitioning trees
16. Efficient binary space partitions for hidden-surface removal and solid modeling
17. Self-adjusting heaps
18. Self-adjusting binary search trees
19. Visibility preprocessing for interactive walkthroughs
20. Optimization of the binary space partition algorithm (BSP) for the visualization of dynamic scenes