Abstract
Animation authoring involves an author’s interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detection and prediction of collision in minimal time and with high accuracy is a challenge. This paper proposes using the bounding volume-based space subdivision mechanism to reduce search space for an object pair collision search. This data structure is enhanced using a direction-based spatial hash table, which predicts collision between static and dynamic objects. These techniques are shown to work in conjunction with existing search space reduction methods. The event of collision is accurately detected using known methods, such as kinetic data structures. Simulation results show that for a scene with 10000 objects with varying dynamic objects (10–90%), the method finds probable collision-pairs with 95–99% accuracy.
Article PDF
Similar content being viewed by others
References
Basch, J., Erickson, J., Guibas, L.J., Hershberger, J., Zhang, L.: Kinetic collision detection between two simple polygons. In: Proc. 10th Sympos. Discrete Algorithms (Baltimore, Maryland, USA, January 17–19, 1999), pp. 102-111. Society for Industrial and Applied Mathematics, Philadelphia, PA (1999)
Bergen, V.D.B.: Collision detection in Interactive 3D Environments. In: The Morgan Kaufmann Series in Interactive 3-D Technology. Elsevier Morgan Kauffman Publishers, San Francisco, CA (2003) (ISBN 1-55860-801-X)
Dong, J.K., Leonidas, J.G., Sung, Y.S.: Fast collision detection among multiple moving spheres. IEEE Trans. Vis. Comput. Graph. 4(3), 230–242 (1998)
Ganter, M.A., Isarankura, B.P.: Dynamic collision detection using space partitioning. J. Mechanisms, Transmissions, Automation in Des. 115(1), 150–155 (1993) (BVHs)
Gomez, M.: Compressed axis-aligned bounding box trees. In: DeLoura, M. (ed.), Game Programming Gems 2, pp. 388–393. Cengage Delmar Learning (2001)
Gottschalk, S.: Collision Queries using Oriented Bounding Boxes. PhD Thesis, University of North Carolina, Department of Computer Science (1998)
Gottschalk, S., Lin, M.C., Manocha, D.: OBB-Tree: A hierarchical structure for rapid interference detection. In: SIGGRAPH ’96, pp. 171–180. ACM, New York, NY
Hubbard, P.M.: Approximating polyhedra with spheres for time-critical collision detection. ACM Trans. Graph. 15(3), 179–210 (1996)
Klosowski, J.T., Held, M., Mitchell, J.S., Sowizral, H., Zikan, K.: Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans. Vis. Comput. Graph. 4(1), 21–36 (1998)
Luque, R.G., Comba, J.L., Freitas, C.M.: Broad-phase collision detection using semi-adjusting BSP-trees. In: Proceedings of the 2005 symposium on Interactive 3D graphics and games. April 03–06 (2005), pp. 179–186. ACM, New York, NY (2005)
MAYA http://www.autodesk.com/eng/index.shtml
Palmer, I.J., Grimsdale, R.L.: Collision detection for animation using sphere-trees. Comput. Graph. Forum 14(2), 105–116 (1995)
Quinlan, S.: Bounding volume hierarchy (with spheres): efficient distance computation between non-convex objects. In: Proc. IEEE Int. Conf. on Robotics and Automation 4(8–13), 3324–3329 (1994)
Samet, H.: Spatial Data Structures: Quadtree, Octrees and Other Hierarchical Methods. Addison-Wesley (1989), Boston
Teschner, M., Heidelberger, B., Mueller, M., Pomeranets, D., Gross, M.: Optimized spatial hashing for collision detection of deformable objects. In: Proceedings of vision, modelling, visualization VMV’03, pp. 47–54. Munich, Germany (2003)
Frank, A.U., Barrera, R.: The Fieldtree: A data structure for geographic information systems. In: Proceedings of the First Symposium on Design and Implementation of Large Spatial Databases (Santa Barbara, California). Buchmann, A.P., Günther, O., Smith, T.R., Wang, Y. (Eds.), pp. 29-44. Springer, New York, NY (1990)
Thibault, W.C., Naylor, B.F.: Set operations on polyhedra using binary space partitioning trees. In: Proceedings of the 14th Annual Conference on Comput. Graph. and Interactive Techniques, SIGGRAPH’87. Stone, M.C. (ed.), pp. 153–162. ACM, New York, NY (1987)
Zachmann, G.: Optimizing the collision detection pipeline. In: Proc. of the First International Game Technology Conference (GTEC), pp. 18–21. Hong Kong (2001)
Zachmann, G.: Rapid collision detection by dynamically aligned DOP-trees. In: Proceedings of the Virtual Reality Annual International Symposium, (March 14–18, 1998), p. 90, IEEE Computer Society, Washington, DC (1998)
Zyda, M.J., Pratt, D.R., Osborne, W.D., Monahan, J.G.: NPSNET: Real-time collision detection and response. J. Vis. Comput. Animation 4(1), 13–24 (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Agarwal, P., Rajagopalan, S. & Prabhakaran, B. Minimizing probable collision pairs searched in interactive animation authoring. Visual Comput 24, 347–359 (2008). https://doi.org/10.1007/s00371-007-0193-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-007-0193-9