A segment-tree based kinetic BSP

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 134-140

  De Berg, M ^a   Comba, J ^a   Guibas, L J ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; RESPONSE TIME (COMPUTER SYSTEMS);

BINARY SPACE PARTITION (BSP); KINETIC DATA STRUCTURE (KDS);

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0034832867     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378647     Document Type: Conference Paper

References (25)

1. Lower bounds for kinetic planar subdivisions
2. Kinetic binary space partitions for triangles
3. Cylindrical static and kinetic binary space partitions
4. Data structures for mobile data
5. Linear size binary space partitions for uncluttered scenes
6. New results on binary space partitions in the plane
7. Near real-time shadow generation using BSP trees
8. Fast object-precision shadow generation for areal light sources using BSP trees
9. On visible surface generation by a priori tree structures
10. A dichromatic framework for balanced trees
11. Consistent solid and boundary representations from arbitrary polygonal data
12. Interactive solid geometry via partitioning trees
13. Constructing good partitioning trees
14. Merging BSP trees yields polyhedral set operations
15. Efficient binary space partitions for hidden-surface removal and solid modeling
16. Optimal binary space partitions for orthogonal objects
17. A new approach to planar point location
18. Visibility preprocessing for interactive walkthroughs
19. Set operations on polyhedra using binary space partitioning trees
20. Optimization of the binary space partition algorithm (BSP) for the visualization of dynamic scenes