Binary space partitions for axis-parallel segments rectangles, and hyperrectangles

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2001, Pages 141-150

  Dumitrescu, A ^a   Mitchell, J S B ^a   Sharir, M ^a  

^a University of Wisconsin Milwaukee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; SET THEORY; THEOREM PROVING;

BINARY SPACE PARTITIONS;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0034832953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378583.378649     Document Type: Conference Paper

References (12)

1. On the optimal binary plane partition for sets of isothetic rectangles
2. New results on binary space partitions in the plane
3. Perfect binary space partitions
4. On the exact size of the binary space partitioning of sets of isothetic rectangles with applications
5. Improved approximation algorithms for rectangle tiling and packing
6. Near real-time shadow generation using BSP trees
7. A survey of object-space hidden surface removal
8. Efficient binary space partitions for hidden-surface removal and solid modeling
9. Optimal binary space partitions for orthogonal objects
10. A note on binary plane partitions
11. Set operations on polyhedra using binary space partitioning trees