Abstract
We consider the use of bounding boxes to detect collisions among a set of convex objects in R d. We derive tight bounds on the ratio between the number of box intersections and the number of object intersections. Confirming intuition, we show that the performance of bounding boxes improves significantly when the underlying objects are all convex. In particular, the ratio is θ(α 1- 1/d σbox 1/2) if each object has aspect ratio at most α and the set has scale factor θbox. More significantly, the bounding box performance ratio is (\( \Theta \left( {\alpha _{{\text{avg}}}^{\frac{{2(1 - 1/d)}} {{3 - 1/d}}} {\mathbf{ }}\alpha _{box}^{\frac{1} {{3 - 1/d}}} {\mathbf{ }}n^{\frac{{1 - 1/d}} {{3 - 1/d}}} } \right) \) ) if only the average aspect ratio αavg of the n objects is known. These bounds are the best possible as we show matching lower bound constructions. The case of convex objects is interesting for several reasons: first, in many applications, the objects are either naturally convex or are approximated by their convex hulls for convenience; second, in some applications, the penetration of convex hulls is interpreted as collision; and finally, the question is interesting from a theoretical standpoint.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. D. Cohen, M. C. Lin, D. Manocha and M. K. Ponamgi. I-COLLIDE: An interactive and exact collision detection system for large-scale environments. Proc. of ACM Interactive 3D Graphics Conference, pp. 189–196, 1995.
H. Edelsbrunner. Reporting intersections of geometric objects by means of covering rectangles. Bulletin of the EATCS, 13, pp. 7–11, 1981.
J. D. Foley, A. van Dam, S. K. Feiner, J. F. Hughes Computer Graphics: Principles and Practice (2nd Edition in C). Addison Wesley, 1996.
A. Garcia-Alonso, N. Serrano and J. Flaquer. Solving the Collision Detection Problem. IEEE Computer Graphics and Applications, 14, pp. 36–43, 1995.
N. Greene. Detecting Intersection of a Rectangular Solid and a Convex Polyhedron. Graphics Gems IV, pp. 83–110, 1994.
P. Gupta, R. Janardan and M. Smid. Efficient algorithms for counting and reporting pairwise intersection between convex polygons. Technical report, Computer Science, King’s College, UK, 1996.
C. Hoffmann. Geometric and Solid Modeling. Morgan Kaufmann, 1989.
J. T. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral, and K. Zikan. Real-time collision detection for motion simulation within complex environments. ACM SIGGRAPH’96 Visual Proceedings, pp. 151, 1996.
J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, 1991.
L. McMillan. An Image-Based Approach to Three-Dimensional Computer Graphics. Ph.D. Thesis, University of North Carolina at Chapel Hill, 1997.
M. P. Moore and J. Wilhelms. Collision Detection and Response for Computer Animation. Computer Graphics, 22, pp. 289–298, 1988.
S. Suri, P. M. Hubbard and J. F. Hughes. Collision Detection in Aspect and Scale Bounded Polyhedra. Proc. of 9th Annual Symposium on Discrete Algorithms, 1998. ACM Transactions on Graphics. In Press.
Y. Zhou and S. Suri. Analysis of a Bounding Box Heuristic for Object Intersection. Journal of the ACM, 46(6): 833–857, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Y., Suri, S. (2000). Collision Detection Using Bounding Boxes: Convexity Helps. In: Paterson, M.S. (eds) Algorithms - ESA 2000. ESA 2000. Lecture Notes in Computer Science, vol 1879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45253-2_40
Download citation
DOI: https://doi.org/10.1007/3-540-45253-2_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41004-1
Online ISBN: 978-3-540-45253-9
eBook Packages: Springer Book Archive