Self-customized BSP trees for collision detection

Computational Geometry: Theory and Applications

Volumn 15, Issue 1-3, 2000, Pages 91-102

  Ar, Sigal ^a   Chazelle, Bernard ^b   Tal, Ayellet ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Binary space partitioning; Collision detection; Self customization

Indexed keywords

EID: 0010308870     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00049-8     Document Type: Article

References (31)

1. P.K. Agarwal, L.J. Guibas, T.M. Murali, J.S. Vitter, Cylindrical static and kinetic binary space partitions, in: Proc. 13th Annu. Symp. Comput. Geom., 1997, pp. 39-48.
2. L. Arge, The buffer tree: a new technique for optimal I/O-algorithms, in: S.G. Akl, F. Dehne, J.-R. Sack, N. Santoro (Eds.), Algorithms and Data Structures, Springer, Berlin, 1995, pp. 334-345.
3. B. Aronov, S. Fortune, Average-case ray shooting and minimum weight triangulations, in: Proc. 13th Annu. ACM Symp. Comput. Geom., 1997, pp. 203-211.
4. G. Barequet, B. Chazelle, L.J. Guibas, J. Mitchell, A. Tal, BOXTREE: a hierarchical representation for surfaces in 3D, Graphics Forum 15 (1996) C-387-396.
5. M.S. Bartlett, The Statistical Analysis of Spatial Pattern, Chapman and Hall, London, 1975.
6. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer, Berlin, 1997.
7. Y. Chrysanthou, M. Slater, Computing dynamic changes to BSP trees, Computer Graphics Forum (EUROGRAPHICS '92 Proceedings) 11 (1992) 321-332.
8. J. Cohen, M. Lin, D. Manocha, K. Ponamgi, I-COLLIDE: an interactive and exact collision detection system for large-scaled environments, in: Proc. ACM Internat. 3D Graphics Conf., 1995, pp. 189-196.
9. A. Dempster, N. Laird, D. Rubin, Maximum likelihood from incomplete data via the EM algorithm, J. Roy. Statist. Soc. Ser. B 39 (1977) 1-38.
10. D.P. Dobkin, D.G. Kirkpatrick, Fast detection of polyhedral intersection, Theoret. Comput. Sci. 27 (1983) 241-253.
11. R.M. Duda, P.E. Hart, Pattern Classification and Scene Analysis, Wiley, New York, 1973.
12. H. Fuchs, Z.M. Kedem, B. Naylor, On visible surface generation by a priori tree structures, Comput. Graph. 14 (1980) 124-133.
13. S. Gottschalk, M.C. Lin, D. Manocha, OBBTree: A hierarchical structure for rapid interference detection, in: Proc. SIGGRAPH '96, pp. 171-180.
14. M. Held, J.T. Klosowski, J.S.B. Mitchell, Evaluation of collision detection methods for virtual reality fly-throughs, in: Proc. 7th Canadian Conf. Computational Geometry, 1995, pp. 205-210.
15. A.K. Jain, R.C. Dubes, Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs, NJ, 1988.
16. F. Jensen, An Introduction to Bayesian Networks, Springer, Berlin, 1996.
17. R.M. Karp, R. Motwani, P. Raghavan, Deferred data structuring, SIAM J. Comput. 17 (1988) 883-902.
18. A. Okabe, B. Boots, K. Sugihara, Spatial Tesselations, Wiley, New York, 1992.
19. A.W. Paeth, Graphics Gems V, Academic Press, New York, 1995.
20. M.S. Paterson, F.F. Yao, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete Comput. Geom. 5 (1990) 485-503.
21. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, CA, 1988.
22. L. Rabiner, B.H. Juang, Fundamentals of Speech Recognition, Prentice-Hall Signal Processing Series, Prentice-Hall, Englewood Cliffs, NJ, 1993.
23. N. Roussopoulos, D. Leifker, Direct spatial search on pictorial databases using packed R-trees, in: Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems, 1985, pp. 17-31.
24. H. Samet, Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods, Addison-Wesley, Reading, MA, 1989.
25. +-tree: A dynamic index for multidimensional objects, in: Proc. 13th VLDB Conf., 1987, pp. 507-518.
26. D.S. Sleator, R.E. Tarjan, Self-adjusting heaps, SIAM J. Comput. 15 (1986).
27. K. Sung, P. Shirley, Ray tracing with the BSP tree, in: D. Kirk (Ed.), Graphics Gems III, Academic Press, New York, 1992, pp. 271-274.
28. A. Tal, D.P. Dobkin, Visualization of geometric algorithms, IEEE Trans. Visualization Comput. Graphics 1 (1995) 194-204.
29. S.J. Teller, C.H. Sequin, Visibility preprocessing for interactive walkthroughs, Comput. Graph. 25 (1991) 61-69.
30. E. Torres, Optimization of the binary space partition algorithm (BSP) for the visualization of dynamic scenes, in: EUROGRAPHICS '90, Eurographics Association, 1990, pp. 507-518.
31. G. Upton, B. Fingleton, Spatial Data Analysis by Examples, Wiley, New York, 1985.