Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » By Affiliations
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top 20 Journal Cited
 » Top 20 Cited
 » Top 20 Author Cited
 » Usage Since Sept 2007


 
 
 

Login | Create Account

New Bounding Volume Approach for Detecting Collision in Computer Animation

Abdullah Bade, and Norhaida Suaib, and Abdullah Mohd. Zin, and Tengku Mohd. Tengku Sembok, (2006) New Bounding Volume Approach for Detecting Collision in Computer Animation. Malaysian Journal of Computer Science, 19 (2). pp. 127-140. ISSN 0127-9084

Full text not available from this repository.

Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=393

Affiliations

Universiti Teknologi Malaysia
Universiti Kebangsaan Malaysia

Abstract

This paper presents a method for fast-approximate collision detection between 3D models S undergoing rigid body motion known as oriented convex polyhedra R(S). By enclosing 3D models tightly, the fineness of detected collision can be enhanced. It is known that the large number of void areas which belongs to any 3D bounding volumes B(S) can affect the accuracy of collision detection system. Therefore, a way to compute R(S) using intersection of a set of halfspaces is described. The directions of these halfspaces are generated from calculating covariance matrix. To develop the tightest R(S), the quality of abutting corners by implementing Tribox Bounds method is improved. To detect collision between R(S), a straightforward approach by simply checking its interval pairs in local space system is performed. The proposed approach was implemented and a number of comparisons in terms of time and recorded collision with other B(S) were performed. From the conducted tests, R(S) performs well and might be a possible choice for detecting collision of 3D models undergoing rigid body motion.

Item Type:Journal
Keywords:Bounding Volumes, Collision Detection, Virtual Environments
Subjects:Q Science
ID Code:339

U. Assarsson, And T. Möller, “Optimized View Frustum Culling Algorithms for Bounding Boxes”. Journal of Graphics Tools, Vol. 5 Issue 1, 2000, pp.9 – 22.

G.V.D. Bergen, Collision Detection In Interactive 3D Environments, Morgan Kaufmann Publishers, USA, 2003.

G.V.D. Bergen, “Efficient Collision Detection Of Complex Deformable Using AABB Trees”. Journal of Graphics Tools, Vol. 2 No. 4, 1998, pp. 1-13.

F.Chin-Shyurng, And. W. Jui-Lung, “Efficient Time-Interrupted and Time-Continuous Collision Detection Among Polyhedral Objects in Arbitrary Motion”. Journal Of Information Science And Engineering, 15, 1999, pp. 769-799.

A.Crosnier, And J.Rossignac, “Tribox bounds for three-dimensional objects”. Computers & Graphics, Vol. 23 No.3, pp. 429-437.

C. Ericson, Real Time Collision Detection, Morgan Kaufmann Publishers, USA, 2004.

C. Funfzig, And. D.Fellner, “Easy realignment of k-Dop Bounding Volumes”. Proceeding of Graphics Interface 2003, Nova Scotia, Canada, pp. 257-264.

S.Gottschalk et al., “OBB-Tree: A Hierarchical Structure for Rapid Interference Detection”. In Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH. New Orleans, Louisiana, pp. 171- 180.

S.Gottschalk, 2000. “Collision Queries Using Oriented Bounding Box”, Ph.D Thesis, Department of Computer Science, University of North Carolina, Chapel Hill.

P.M. Hubbard, “Collision Detection For Interactive Graphics Application’. IEEE Transactions on Visualization and Computer Graphics, Vol.1 No.3, 1995, pp. 218-230.

D.Halperin, And M.Sharir, “New bounds for lower envelopes in three dimensions with application to visibility in terrains”, Proceedings of 9th ACM Symposium on Computational Geometry. 1993, pp. 11-18.

T.L. Kay, And J.T. Kajiya. “Ray Tracing Complex Scenes”, Computer Graphics (SIGGRAPH ’86 Proceedings. Vol. 20, 1986, pp. 269-278.

J.T. Klosowski, 1998. “Efficient Collision Detection For Interactive 3D Graphics And Virtual Environment”, Ph.D Thesis, State University of New York, Stony Brook.

J.T. Klosowski et al., “Efficient Collision Detection Using Bounding Volume Hierarchies Of k-Dops”. IEEE Transaction on Visualization and Computer Graphics. Vol. 4 No.1, 1998.

Petr. Konecny, 1998. “Bounding Volumes in Computer Graphics”. MSc Thesis, Faculty of Informatics, Masaryk Universitiy, Brno, Czech Republic.

M. Lahanas et al., “Optimized Bounding Boxes for Three-Dimensional Treatment Planning in Brachytherapy”. Medical Physics, Vol. 27 No.10, 2000, pp. 2333-2342.

T.Larsson, And T.Akenine-Möller, “Strategies for Bounding Volume Hierarchy Updates for Ray Tracing of Deformable Models”. MRTC Report, 2003.

T.Moller, And E.Haines,. Real-Time Rendering. A K Peters Ltd, 1999.

G.Müller et al., “A Rapid Clustering Algorithm for Efficient Rendering”. Eurographics Association, 1999, ISSN 1017-4656.

G.Zachmann, “Rapid collision detection by dynamically aligned DOP-Trees”. Proceeding of IEEE Virtual Reality Annual International Symposium (VRAIS 1998), Atlanta, Georgia, 1998, pp. 90-97.

Repository Staff Only: item control page
 
 
 
 
 
   
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.