Binary space partitions for line segments with a limited number of directions

SIAM Journal on Computing

Volumn 32, Issue 2, 2003, Pages 307-325

  Tóth, Csaba D ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Binary space partition; Computational geometry; Line segments

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; SET THEORY; THEOREM PROVING;

AUTOPARTITIONS; BINARY SPACE PARTITIONS; LINE SEGMENTS;

COMPUTATIONAL GEOMETRY;

EID: 0037610118     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702403785     Document Type: Article

References (28)

1. P. K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, SIAM J. Comput., 21 (1992), pp. 540-570.
2. 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.
3. P. K. Agarwal and J. Matoušek, Ray shooting and parametric search, SIAM J. Comput., 22 (1993), pp. 794-806.
4. S. Ar, B. Chazelle, and A. Tal, Self-customized BSP trees for collision detection, Comput. Geom. Theory Appl., 15 (2000), pp. 91-102.
5. B. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality, BIT, 25 (1985), pp. 76-90.
6. N. Chin and S. Feiner, Near real-time shadow generation using BSP trees, in Proceedings of the 16th Conference on Computer Graphics and Interactive Techniques (Boston, MA), SIGGRAPH, ACM Press, New York, 1989, pp. 99-106.
7. Y. Chrysanthou and M. Slater, Computing dynamic changes to BSP tree, Comput. Graphics Forum, 11 (1992), pp. 321-332.
8. N. Dadoun, D. G. Kirkpatrick, and J. P. Walsh, The geometry of beam tracing, in Proceedings of the 1st ACM Symposium on Computational Geometry (Baltimore, MD), ACM, New York, 1985, pp. 55-61.
9. F. d'Amore and P. G. Franciosa, On the optimal binary plane partition for sets of isothetic rectangles, Inform. Process. Lett., 44 (1992), pp. 255-259.
10. M. de Berg, Linear size binary space partitions for uncluttered scenes, Algorithmica, 28 (2000), pp. 353-366.
11. M. de Berg, M. de Groot, and M. Overmars, New results on binary space partitions in the plane, Comput. Geom. Theory Appl., 8 (1997), pp. 317-333.
12. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry. Algorithms and Applications, 2nd ed., Springer-Verlag, Berlin, 2000.
13. S. E. Dorwald, A survey of object-space hidden surface removal, Internat. J. Comput. Geom. Appl., 4 (1994), pp. 325-362.
14. A. Dumitrescu, J. S. B. Mitchell, and M. Sharir, Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles, in Proceedings of the 17th ACM Symposium on Computational Geometry (Medford, MA), ACM, New York, 2001, pp. 141-150.
15. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Monogr. Theoret. Comput. Sci. EATCS Ser. 10, Springer-Verlag, Berlin, 1987.
16. H. Edelsbrunner, J. O'Rourke, and R. Seidel, Constructing arrangements of lines and hyperplanes with applications, SIAM J. Comput., 15 (1986), pp. 341-363.
17. H. Fuchs, Z. M. Kedem, and B. Naylor, On visible surface generation by a priory tree structures, in Proceedings of the 7th Conference on Computer Graphics and Interactive Techniques (Seattle, WA), SIGGRAPH, ACM Press, New York, 1980, pp. 124-133.
18. D. Gordon and S. Chen, Front-to-back display of BSP trees, IEEE Comp. Graphics and Appl., 11 (1991), pp. 79-85.
19. B. Naylor, Partitioning tree image representation and generation from 3D geometric models, in Proceedings of the 1992 Graphics Interface Conference (Vancouver, BC), Canadian Human-Computer Communications Society, 1992, pp. 202-212.
20. B. Naylor, J. Amanatides, and W. Thibault, Merging BSP trees yields polyhedral set operations, in Proceedings of the 17th Conference on Computer Graphics and Interactive Techniques (Dallas, TX), SIGGRAPH, ACM Press, New York, 1990, pp. 115-124.
21. M. S. Paterson and F. F. Yao, Binary space partitions for orthogonal objects, in Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA), SIAM, Philadelphia, 1990, pp. 100-106.
22. 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.
23. M. S. Paterson and F. F. Yao, Optimal binary space partitions for orthogonal objects, J. Algorithms, 13, (1992), pp. 99-113.
24. R. A. Schumacker, R. Brand, M. Gilliland, and W. Sharp, Study for Applying Computer-Generated Images to Visual Simulation, Tech. Report, U.S. Air Force Human Resources Laboratory, Brooks Air Force Base, San Antonio, TX, 1969.
25. K. Sung and P. Shirley, Ray tracing with the BSP tree, in Graphics Gems III, D. Kirk, ed., Academic Press, San Diego, CA, 1992, pp. 271-274.
26. I. E. Sutherland, R. F. Sproull, and R. A. Schumacker, A characterization of ten hidden-surface algorithms, ACM Comput. Survey, 9 (1984), pp. 1-55.
27. Cs. D. Tóth, A note on binary plane partitions, in Proceedings of the 17th ACM Symposium on Computational Geometry (Medford, MA), ACM, New York, 2001, pp. 151-156.
28. G. Vanecek, Brep-index: A multidimensional space partitioning tree, Internat. J. Comput. Geom. Appl., 1 (1991), pp. 243-261.