New results on binary space partitions in the plane

Computational Geometry: Theory and Applications

Volumn 8, Issue 6, 1997, Pages 317-333

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

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Binary space partition; Fat objects; Homothets; Line segments; Planar

Indexed keywords

EID: 0000126187     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00008-4     Document Type: Article

References (20)

1. C. Ballieux, Motion planning using binary space partition, Report inf/src/93-25, Utrecht University (1993).
2. B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geom. 6 (1991) 485-524.
3. B. Chazelle, Personal communication (1993).
4. B. Chazelle and L.J. Guibas, Fractional cascading: I. A data structuring technique, Algorithmica 1 (1986) 133-162.
5. B. Chazelle and L.J. Guibas, Fractional cascading: II. Applications, Algorithmica 1 (1986) 163-191.
6. N. Chin and S. Feiner, Near real time shadow generation using bsp trees, in: SIGGRAPH'90 (1990) 99-106.
7. F. d'Amore and P.G. Franciosa, On the optimal binary plane partition for sets of isothetic rectangles, Inform. Process. Lett. 44 (1992) 255-259.
8. M. de Berg, Ray Shooting, Depth Orders and Hidden Surface Removal, Lecture Notes in Computer Science, Vol. 703 (Springer, Berlin, 1993).
9. H. Edelsbrunner, Computing the extreme distances between two convex polygons, J. Algorithms 6 (1985) 213-224.
10. H. Fuchs, Z.M. Kedem and B. Naylor, On visible surface generation by a priori tree structures, Comput. Graph. 14 (3) (1980) 124-133.
11. M.T. Goodrich and R. Tamassia, Dynamic ray shooting and shortest paths via balanced geodesic triangulations, in: Proc. 9th Annu. ACM Sympos. Comput. Geom. (1993) 318-327.
12. K. Mehlhorn and S. Näher, Dynamic fractional cascading, Algorithmica 5 (1990) 215-241.
13. B. Naylor, J. Amanatides and W. Thibault, Merging bsp trees yields polyhedral set operations, in: SIGGRAPH'90 (1990) 115-124.
14. M.H. Overmars, Range searching in a set of line segments, in: Proc. 1st Annu. ACM Sympos. Comput. Geom. (1985) 177-185.
15. 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.
16. M.S. Paterson and F.F. Yao, Optimal binary space partitions for orthogonal objects, J. Algorithms 13 (1992) 99-113.
17. F.P. Preparata, A new approach to planar point location, SIAM J. Comput. 10 (1981) 473-482.
18. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
19. W.C. Thibault and B.F. Naylor, Set operations on polyhedra using binary space partitioning trees, in: Proc. SIGGRAPH'87 (1987) 153-162.
20. A.F. van der Stappen, D. Halperin and M.H. Overmars, The complexity of the free space for a robot moving amidst fat obstacles, Computational Geometry: Theory and Applications 3 (1993) 353-373.