Binary space partitions for fat rectangles

SIAM Journal on Computing

Volumn 29, Issue 5, 2000, Pages 1422-1448

  Agarwal, Pankaj K ^a   Grove, Edward F ^b   Murali, T M ^c   Vitter, Jeffrey Scott ^a  

^a Duke University   (United States)

^b 353 Serra Mall ^*  (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASPECT RATIO; COMPUTER GRAPHICS; MATHEMATICAL MODELS;

BINARY SPACE PARTITIONS (BSP); FAT RECTANGLES;

COMPUTATIONAL GEOMETRY;

EID: 0034541609     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797320578     Document Type: Article

References (31)

1. P. K. AGARWAL, J. ERICKSON, AND L. J. GUIBAS, Kinetic binary space partitions for intersecting segments and disjoint triangles, in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, pp. 107-116.
2. P. K. AGARWAL, L. J. GUIBAS, T. M. MURALI, AND J. S. VITTER, Cylindrical static and kinetic binary space partitions, in Proceedings of the 13th ACM Symposium on Comput. Geom., ACM, New York, 1997, pp. 39-48.
3. P. K. AGARWAL AND S. SURI. Surface approximation and geometric partitions, in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, pp. 24-33.
4. J. M. AIREY, Increasing Update Rates in the Building Walkthrough System, with Automatic Model-space Subdivision and Potentially Visible Set Calculations, Ph.D. thesis, Dept. of Computer Science, University of North Carolina, Chapel Hill, NC, 1990.
5. C. BALLIEUX, Motion Planning Using Binary Space Partitions, Technical Report inf/src/93-25, Utrecht University, Utrecht, The Netherlands, 1993.
6. A. T. CAMPBELL, Modeling Global Diffuse Illumination for Image Synthesis, Ph.D. thesis, Department of Computer Sciences, University of Texas, Austin, TX 1991.
7. T. CASSEN, K. R. SUBRAMANIAN, AND Z. MICHALEWICZ, Near-optimal construction of partitioning trees by evolutionary techniques, in Proceedings of Graphics Interface '95, Quebec, Canada, Canadian Human-Computer Communications Society, 1995, pp. 263-271.
8. E. CATMULL, A subdivision algorithm for computer display of curved surfaces, Technical Report UTEC-CSC-74-133, Department Computer Sciences, University of Utah, Salt Lake City, UT, 1974.
9. B. CHAZELLE, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SIAM J. Comput., 13 (1984), pp. 488-507.
10. N. CHIN AND S. FEINER, Near real-time shadow generation using BSP trees, in Proceedings of the ACM International Conference on Computer Graphics and Interactive Techniques, Boston, MA, 1989, pp. 99-106.
11. N. CHIN AND S. FEINER, Fast object-precision shadow generation for area light sources using BSP trees, in Proceedings of the ACM Symposium on Interactive 3D Graphics, Cambridge, MA, 1992, pp. 21-30.
12. Y. CHRYSANTHOU, Shadow Computation for 3D Interaction and Animation, Ph.D. thesis, Queen Mary and Westfield College, University of London, London, UK, 1996.
13. M. DE BERG, Linear size binary space partitions for fat objects, in Proceedings of the 3rd Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 979, Springer-Verlag, Berlin, 1995, pp. 252-263.
14. S. E. DORWARD, A survey of object-space hidden surface removal, Internat. J. Comput. Geom. Appl., 4 (1994), pp. 325-362.
15. J. D. FOLEY, A. VAN DAM, S. K. FEINER, AND J. F. HUGHES, Computer Graphics: Principles and Practice, 2nd ed., Addison-Wesley, Reading, MA, 1990.
16. H. FUCHS, Z. M. KEDEM, AND B. NAYLOR, On visible surface generation by a priori tree structures, in Proceedings of the ACM International Conference on Computer Graphics and Interactive Techniques, ACM, New York, 1980, pp. 124-133.
17. C. MATA AND J. S. B. MITCHELL, Approximation algorithms for geometric tour and network design problems, in Proceedings of the 11th Annual ACM Symposium on Comput. Geom., ACM, New York, 1995, pp. 360-369.
18. T. M. MURALI, P. K. AGARWAL, AND J. S. VITTER, Constructing binary space partitions for orthogonal rectangles in practice, in Proceedings of the 6th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 1461, Springer, Berlin, 1998, pp. 211-222.
19. T. M. MURALI AND T. A. FUNKHOUSER, Consistent solid and boundary representations from, arbitrary polygonal data, in Proceedings of the ACM Symposium on Interactive 3D Graphics, Providence, RI, 1997. pp. 155-162.
20. B. NAYLOR, Constructing good partition trees, in Proceedings of Graphics Interface, Toronto, Ontario, Canada, Canadian Human-Computer Communications Society, 1993, pp. 181-191.
21. B. NAYLOR AND W. THIBAULT, Application of BSP Trees to Ray-Tracing and CSG Evaluation, Technical Report GIT-ICS 86/03, School of Information and Computer Science, Georgia Institute of Technology, 1986.
22. B. F. NAYLOR, SCULPT: An interactive solid modeling tool, in Proceedings of Graphics Interface, Halifax, Nova Scotia, Canada, Canadian Human-Computer Communications Society, 1990, pp. 138-148.
23. B. F. NAYLOR, Interactive solid geometry via partitioning trees, in Proceedings of Graphics Interface, Vancouver, B.C., Canada, Canadian Human-Computer Communications Society, 1992, pp. 11-18.
24. B. F. NAYLOR, J. AMANATIDES, AND W. C. THIBAULT, Merging BSP trees yields polyhedral set operations, in Proceedings of the ACM International Confereuce on Computer Graphics and Interactive Techniques, Dallas, TX, 1990, pp. 115-124.
25. M. S. PATERSON AND F. F. YAO, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete Comput. Geom., 5 (1990), pp. 485-503.
26. M. S. PATERSON AND F. F. YAO, Optimal binary space partitions for orthogonal objects, J. Algorithms, 13 (1992), pp. 99-113.
27. R. A. SCHUMACKER, R. BRAND, M. GILLILAND, AND W. SHARP, Study for Applying Computer-Generated Images to Visual Simulation, Technical Report AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory, Brooks Air Force Base, San Antonio, TX, 1969.
28. I. E. SUTHERLAND, R. F. SPROULL, AND R. A. SCHUMACKER, A characterization of ten hidden-surface algorithms, ACM Comput. Surv., 6 (1974), pp. 1-55.
29. S. J. TELLER, Visibility Computations in Densely Occluded Polyhedral Environments, Ph.D. thesis, Department of Computer Science, University of California at Berkeley, Berkeley, CA 1992.
30. W. C. THIBAULT AND B. F. NAYLOR, Set operations on polyhedra using binary space partitioning trees, in Proceedings of the ACM International Conference on Computer Graphics and Interactive Techniques, Anaheim, CA, 1987, pp. 153-162.
31. E. TORRES, Optimization of the binary space partition algorithm (BSP) for the visualization of dynamic scenes, in Proceedings of Eurographics, European Association for Computer Graphics, Aire-la-Ville, Switzerland, 1990, pp. 507-518.