Cylindrical static and kinetic binary space partitions

Computational Geometry: Theory and Applications

Volumn 16, Issue 2, 2000, Pages 103-127

  Agarwal, Pankaj K ^a   Guibas, Leonidas J ^b   Murali, T M ^c   Vitter, Jeffrey Scott ^a  

^a Duke University   (United States)

^b Stanford University   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

Binary space partitions; Computational geometry; Computer graphics; Hierarchical data structures; Kinetic data structures

Indexed keywords

EID: 0000791293     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00005-5     Document Type: Article

References (36)

1. P.K. Agarwal, J. Erickson, L.J. Guibas, Kinetic binary space partitions for intersecting segments and disjoint triangles, in: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 107-116.
2. P.K. Agarwal, E.F. Grove, T.M. Murali, J.S. Vitter, Binary space partitions for fat rectangles, in: Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci., October 1996, pp. 482-491.
3. P.K. Agarwal, S. Suri, Surface approximation and geometric partitions, in: Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, 1994, pp. 24-33.
4. J.M. Airey, Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations, Ph.D. Thesis, Department of Computer Science, University of North Carolina, Chapel Hill, 1990.
5. C. Ballieux, Motion planning using binary space partitions, Technical Report inf/src/93-25, Utrecht University, 1993.
6. J. Basch, L.J. Guibas, J. Hershberger, Data structures for mobile data, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 747-756.
7. J.L. Bentley, T.A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. 28 (1979) 643-647.
8. M. Bern, D. Eppstein, R Plassman, F. Yao, Horizon theorems for lines and polygons, in: J. Goodman, R. Pollack, W. Steiger (Eds.), Discrete and Computational Geometry: Papers from the DIMACS Special Year, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 6, American Mathematical Society, Providence, RI, 1991, pp. 45-66.
9. A.T. Campbell, Modeling global diffuse illumination for image synthesis, Ph.D. Thesis, Department of Computer Sciences, University of Texas, Austin, 1991.
10. T. Cassen, K.R. Subramanian, Z. Michalewicz, Near-optimal construction of partitioning trees by evolutionary techniques, in: Proc. of Graphics Interface '95, 1995, pp. 263-271.
11. B. Chazelle, L.J. Guibas, D.T. Lee, The power of geometric duality, BIT 25 (1985) 76-90.
12. N. Chin, S. Feiner, Near real-time shadow generation using BSP trees, in: Proc. SIGGRAPH 89, Comput. Graph., Vol. 23, ACM SIGGRAPH, 1989, pp. 99-106.
13. N. Chin, S. Feiner, Fast object-precision shadow generation for areal light sources using BSP trees, in: Proc. 1992 Sympos. Interactive 3D Graphics, 1992, pp. 21-30.
14. Y. Chrysanthou, Shadow computation for 3D interaction and animation, Ph.D. Thesis, Queen Mary and Westfield College, University of London, 1996.
15. K.L. Clarkson, New applications of random sampling in computational geometry, Discrete Comput. Geom. 2 (1987) 195-222.
16. K.L. Clarkson, P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989) 387-421.
17. M. de Berg, Linear size binary space partitions for fat objects, in: Proc. 3rd Annu. European Sympos. Algorithms, Lecture Notes in Computer Science, Vol. 979, Springer, Berlin, 1995, pp. 252-263.
18. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Heidelberg, 1987.
19. H. Fuchs, Z.M. Kedem, B. Naylor, On visible surface generation by a priori tree structures, in: Proc. SIGGRAPH 80, Comput. Graph., Vol. 14, ACM SIGGRAPH, 1980, pp. 124-133.
20. L.J. Guibas, Kinetic data structures: A state of the art report, in: P.K. Agarwal, L.E. Kavraki, M.T. Mason (Eds.), Robotics: An Algorithmic Perspective, 1998, pp. 191-209.
21. D. Haussler, E. Welzl, Epsilon-nets and simplex range queries, Discrete Comput. Geom. 2 (1987) 127-151.
22. C. Mata, J.S.B. Mitchell, Approximation algorithms for geometric tour and network design problems, in: Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 360-369.
23. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, 1995.
24. T.M. Murali, T.A. Funkhouser, Consistent solid and boundary representations from arbitrary polygonal data, in: Proc. 1997 Sympos. Interactive 3D Graphics, 1997.
25. B. Naylor, 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.
26. B.F. Naylor, SCULPT: an interactive solid modeling tool, in: Proc. Graphics Interface '90,1990, pp. 138-148.
27. B.F. Naylor, Interactive solid geometry via partitioning trees, in: Proc. Graphics Interface '92, 1992, pp. 11-18.
28. B.F. Naylor, J. Amanatides, W.C. Thibault, Merging BSP trees yields polyhedral set operations, in: Proc. SIGGRAPH 90, Comput. Graph., Vol. 24, ACM SIGGRAPH, 1990, pp. 115-124.
29. M.S. Paterson, F.F. Yao, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete Comput. Geom. 5 (1990) 485-503.
30. M.S. Paterson, F.F. Yao, Optimal binary space partitions for orthogonal objects, J. Algorithms 13 (1992) 99-113.
31. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
32. R.A. Schumacker, R. Brand, M. Gilliland, 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.
33. R. Seidel, Backwards analysis of randomized geometric algorithms, in: J. Pach (Ed.), New Trends in Discrete and Computational Geometry, Springer, Heidelberg, 1993, pp. 37-68.
34. S.J. Teller, Visibility computations in densely occluded polyhedral environments, Ph.D. Thesis, Department of Computer Science, University of California, Berkeley, 1992.
35. W.C. Thibault, B.F. Naylor, Set operations on polyhedra using binary space partitioning trees, in: Proc. SIGGRAPH 87, Comput. Graph., Vol. 21, ACM SIGGRAPH, 1987, pp. 153-162.
36. E. Torres, Optimization of the binary space partition algorithm (BSP) for the visualization of dynamic scenes, in: Eurographics '90, North-Holland, 1990, pp. 507-518.