Binary space partitions of orthogonal subdivisions

SIAM Journal on Computing

Volumn 34, Issue 6, 2005, Pages 1380-1397

  Hershberger, John ^a   Suri, Subhash ^b   Tóth, Csaba D ^c  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b Santa Barbara   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Binary space partitions; Tilings

Indexed keywords

BINARY SPACE PARTITIONS; ORTHOGONAL SUBDIVISIONS; SPACE-FILLING PACKINGS; TILINGS;

COMPUTABILITY AND DECIDABILITY; MATHEMATICAL TECHNIQUES; NUMERICAL METHODS; ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING; PROBLEM SOLVING;

BINARY SEQUENCES;

EID: 29344451452     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704445706     Document Type: Article

References (19)

1. P. K. AGARWAL, E. F. GROVE, T. M. MURALI, AND J. S. VITTER, Binary space partitions for fat rectangles, SIAM J. Comput., 29 (2000), pp. 1422-1448.
2. C. BALLIEUX, Motion Planning Using Binary Space Partitions, Tech. report Inf/src/93-25, Utrecht University, Utrecht, The Netherlands, 1993.
3. J. L. BENTLEY, Multidimensional binary search trees used for associative searching, Comm. ACM, 18 (1975), pp. 509-517.
4. M. DE BERG, Linear size binary space partitions for uncluttered scenes, Algorithmica, 28 (2000), pp. 353-366.
5. P. BERMAN, B. DASGUPTA, AND S. MUTHUKRISHNAN, Exact size of binary space partitionings and improved rectangle tiling algorithms, SIAM J. Discrete Math., 15 (2002), pp. 252-267.
6. N. CHIN AND S. FEINER, Near real-time shadow generation using BSP trees, in Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques, ACM, New York, 1989, pp. 99-106.
7. N. CHIN AND S. FEINER, Fast object-precision shadow generation for area light sources using BSP trees, in Proceedings of the 1992 Symposium on Interactive 3D Graphics, ACM, New York, 1992, pp. 21-30.
8. A. DUMITRESCU, J. S. B. MITCHELL, AND M. SHARIR, Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles, Discrete Comput. Geom., 31 (2004), pp. 207-227.
9. D. EPPSTEIN, Three Untetrahedralizable Objects, The Geometry Junkyard, available online at http://www.ics.uci.edu/~eppstein/junkyard/untetra.
10. H. FUCHS, Z. M. KEDEM, AND B. NAYLOR, On visible surface generation by a priori tree structures, in Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, ACM, New York, 1980, pp. 124-133.
11. T. M. MURALI, Efficient Hidden-Surface Removal in Theory and in Practice, Ph.D. thesis, Department of Computer Science, Brown University, Providence, RI, 1998, pp. 80-81.
12. B. NAYLOR, J. A. AMANATIDES, AND W. THIBAULT, Merging BSP trees yields polyhedral set operations, in Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques, ACM, New York, 1990, pp. 115-124.
13. B. NAYLOR AND W. THIBAULT, Application of BSP Trees to Ray-Tracing and CSG Evaluation, Tech. report GIT-ICS 86/03, School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA, 1986.
14. 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.
15. M. S. PATERSON AND F. F. YAO, Optimal binary space partitions for orthogonal objects, J. Algorithms, 13 (1992), pp. 99-113.
16. R. A. SCHUMACKER, R. BRAND, M. GILLILAND, AND W. SHARP, Study for Applying Computer-Generated Images to Visual Simulation, Tech. report AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory, San Antonio, TX, 1969.
17. W. C. THIBAULT AND B. F. NAYLOR, Set operations on polyhedra using binary space partitioning trees, in Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, ACM, New York, 1987, pp. 153-162.
18. C. D. TÓTH, A note on binary plane partitions, Discrete Comput. Geom., 30 (2003), pp. 3-16.
19. C. D. TÓTH, Binary space partitions for orthogonal fat rectangles, in Proceedings of the 11th European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2832, Springer-Verlag, Berlin, 2003, pp. 494-505.