A note on binary plane partitions

Discrete and Computational Geometry

Volumn 30, Issue 1, 2003, Pages 3-16

  Tóth, Csaba D ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037633580     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-2921-x     Document Type: Conference Paper

References (8)

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), 1422-1448.
2. M. de Berg, M. de Groot, and M. Overmars, New results on binary space partitions in the plane. Comput. Geom. Theory Appl. 8 (1997), 317-333.
3. H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by priory tree structures. Comput. Graph. 14(3) (1980), 124-133 (Proc. SIGGRAPH '80).
4. M.S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete Comput. Geom. S (1990), 485-503.
5. M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms 13 (1992), 99-113.
6. 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, US Air Force Human Resources Laboratory, Brooks Air Force Base, San Antonio, TX, 1969.
7. I. E. Sutherland, R. F. Sproull, and R. A. Schumacker. A characterization often hidden-surface algorithms. ACM Comput. Surveys 9 (1984), 1-55.
8. Cs. D. Tóth. Binary space partitions for line segments with a limited number of directions. SIAM J. Comput., to appear.