Perfect binary space partitions

Computational Geometry: Theory and Applications

Volumn 7, Issue 1-2, 1997, Pages 81-91

  De Berg, Mark ^a   De Groot, Marko M ^a   Overmars, Mark H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003501338     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00045-3     Document Type: Article

References (12)

1. Ta. Asano, Te. Asano, L.J. Guibas, J. Hershberger and H. Imai, Visibility of disjoint polygons, Algorithmica 1 (1986) 49-63.
2. M. de Berg, M. Overmars and O. Schwarzkopf, Computing and verifying depth orders, SIAM J. Comput. 23 (1994) 437-446.
3. J. Erickson and R. Seidel, Better lower bounds on detecting affine and spherical degeneracies, Proc. 34th IEEE Symp. Found. Comput. Sci. (1993) 528-536.
4. H. Fuchs, Z.M. Kedem and B. Naylor, On visible surface generation by a priori tree structures, Comput. Graph. 14 (1980) 124-133.
5. 2) problems in computational geometry, Computational Geometry: Theory and Applications 5 (1995) 165-185.
6. S.K. Ghosh and D.M. Mount, An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput. 20 (1991) 888-910.
7. M.H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. Syst. Sci. 23 (1981) 166-204.
8. M.H. Overmars and E. Welzl, New methods for computing visibility graphs, in: Proc. 4th ACM Symp. Comput. Geom. (1988) 164-171.
9. M.S. Paterson and F.F. Yao, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete Comput. Geom. 5 (1990) 485-503.
10. M.S. Paterson and F.F. Yao, Optimal binary space partitions for orthogonal objects, J. Algorithms 13 (1992) 99-113.
11. M. Pocchiola and G. Vegter, Computing the visibility graph via pseudo-triangulation, in: Proc. 11th ACM Symp. Comput. Geom. (1995) 248-257.
12. 2) time, Inform. Process. Lett. 20 (1985) 167-171.