Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Near real-time shadow generation using BSP trees
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Merging BSP trees yields polyhedral set operations
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Optimal binary space partitions for orthogonal objects
Journal of Algorithms
Modeling global diffuse illumination for image synthesis
Modeling global diffuse illumination for image synthesis
Fast object-precision shadow generation for area light sources using BSP trees
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
Visibility computations in densely occluded polyhedral environments
Visibility computations in densely occluded polyhedral environments
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Consistent solid and boundary representations from arbitrary polygonal data
Proceedings of the 1997 symposium on Interactive 3D graphics
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Linear Size Binary Space Partitions for Fat Objects
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Binary space partitions for fat rectangles
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations
| Hi-index | 0.00 |
In this paper, we develop a simple technique for constructing a Binary Space Partition (BSP) for a set of orthogonal rectangles in R3. Our algorithm has the novel feature that it tunes its performance to the geometric properties of the rectangles, e.g., their aspect ratios. We have implemented our algorithm and tested its performance on real data sets. We have also systematically compared the performance of our algorithm with that of other techniques presented in the literature. Our studies show that our algorithm constructs BSPs of near-linear size and small height in practice, has fast running times, and answers queries efficiently. It is a method of choice for constructing BSPs for orthogonal rectangles.