Binary space partitions for 3D subdivisions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 100-108

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; OPTIMIZATION;

BINARY SPACE PARTITIONS; RECURSIVE CONVEX SUBDIVISION; WORSTCASE COMPLEXITY;

RECURSIVE FUNCTIONS;

EID: 0037740575     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. C. Balliex. Motion planning using binary space partitions. Technical Report Inf/src/93-25, Utrecht University, 1993.
2. P. Berman, B. DasGupta, and S. Muthukrishnan. Slice and dice: A simple, improved approximate tiling recipe. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 455-464, 2002.
3. B. Chazelle. Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J. Comput., 13:488-507, 1984.
4. N. Chin and S. Feiner. Near real-time shadow generation using BSP trees. In Proc. SIGGRAPH '89, volume 23, pages 99-106, New York, 1989.
5. N. Chin and S. Feiner. Fast object-precision shadow generation for areal light sources using BSP trees. Comput. Graph., 25:21-30, March 1992. Proc. 1992 Sympos. Interactive 3D Graphics.
6. M. de Berg, M. de Groot, and M. Overmars. New results on binary space partitions in the plane. Comput. Geom. Theory Appl., 8:317-333, 1997.
7. A. Dumitrescu, J. S. B. Mitchell, and M. Sharir. Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 141-149, 2001.
8. H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14(3):124-133, 1980. Proc. SIGGRAPH '80.
9. B. Naylor, J. A. Amanatides, and W. Thibault. Merging BSP trees yields polyhedral set operations. Comput. Graph., 24(4):115-124, August 1990. Proc. SIGGRAPH '90.
10. B. Naylor and W. Thibault. Application of BSP trees to ray-tracing and CSG evaluation. Technical Report GIT-ICS 86/03, Georgia Institute of Tech., School of Information and Computer Science, February 1986.
11. M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom., 5:485-503, 1980.
12. M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms, 13:99-113, 1992.
13. 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, 1969.
14. W. C. Thibault and B. F. Naylor. Set operations on polyhedra using binary space partitioning trees. Comput. Graph., 21(4):153-162, 1987, Proc. SIGGRAPH '87.
15. C. D. Töth. Binary space partitions for line segments with a limited number of directions. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 465-471, 2002.
16. C. D. Töth. A note on binary plane partitions. In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 151-156, 2001.