DocumentCode
475732
Title
Notice of Violation of IEEE Publication Principles
Efficient Collision Detection for Arbitrary Polyhedral Model Based on GPU and Swept Volume
Author
Peng, Shujuan ; Li, Yuanxiang ; Zeng, Hui
Author_Institution
Dept. of Comput. Sch., Wuhan Univ., Wuhan
Volume
2
fYear
2008
fDate
3-4 Aug. 2008
Firstpage
260
Lastpage
264
Abstract
Notice of Violation of IEEE Publication Principles
"Efficient Collision Detection for Arbitrary Polyhedral Model Based on GPU and Swept Volume"
by Shujuan Peng and Yuanxiang Li and Hui Zeng
in the Proceedings of the International Colloquium on Computing, Communication, Control and Management, ISECS, Vol 2, August 2008, pp. 260-264
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.
This paper contains significant portions of original text from the paper cited below. The original text was copied with insufficient attribution (including appropriate references to the original author(s) and/or paper title) and without permission.
Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:
"IBCD: A Fast Collision Detection Algorithm Based on Image Space Using OBB"
by Z. Fan, H. Wan, S. Gao
in the Journal of Visualization and Computer Animation (14) John Wiley and Sons, September 2003, pp. 169-181
This paper presents an efficient collision detection algorithm for arbitrary polyhedral objects moving randomly within the virtual environment. We decompose the non-convex objects into some convex pieces using the surface convex decomposition, construct the OBB for each convex piece and build the bounding volume hierarchy for the convex hull in the pro-precess phrase. Given the initial and final configurations of a moving polyhedral model, in the run-time phrase, our algorithm creates the continuous motion using the motion interpolation and use the swept volume to get the potentially collision objects set. The algorithm makes efficient use of the graphics rendering hardware (Z-buffer and stencil buffer) to reduce the computational cost of CPU in the run-time collis ion. The simulation result proves our algorithm is efficient compared with other related algorithms.
"Efficient Collision Detection for Arbitrary Polyhedral Model Based on GPU and Swept Volume"
by Shujuan Peng and Yuanxiang Li and Hui Zeng
in the Proceedings of the International Colloquium on Computing, Communication, Control and Management, ISECS, Vol 2, August 2008, pp. 260-264
After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE\´s Publication Principles.
This paper contains significant portions of original text from the paper cited below. The original text was copied with insufficient attribution (including appropriate references to the original author(s) and/or paper title) and without permission.
Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:
"IBCD: A Fast Collision Detection Algorithm Based on Image Space Using OBB"
by Z. Fan, H. Wan, S. Gao
in the Journal of Visualization and Computer Animation (14) John Wiley and Sons, September 2003, pp. 169-181
This paper presents an efficient collision detection algorithm for arbitrary polyhedral objects moving randomly within the virtual environment. We decompose the non-convex objects into some convex pieces using the surface convex decomposition, construct the OBB for each convex piece and build the bounding volume hierarchy for the convex hull in the pro-precess phrase. Given the initial and final configurations of a moving polyhedral model, in the run-time phrase, our algorithm creates the continuous motion using the motion interpolation and use the swept volume to get the potentially collision objects set. The algorithm makes efficient use of the graphics rendering hardware (Z-buffer and stencil buffer) to reduce the computational cost of CPU in the run-time collis ion. The simulation result proves our algorithm is efficient compared with other related algorithms.
Keywords
interpolation; rendering (computer graphics); solid modelling; virtual reality; GPU; Z-buffer; arbitrary polyhedral object model; bounding volume hierarchy; convex hull; graphics rendering hardware; motion interpolation; run-time collision detection algorithm; stencil buffer; surface convex decomposition; swept volume; virtual environment; Algorithm design and analysis; Computational modeling; Detection algorithms; Graphics; Hardware; Interpolation; Solid modeling; dynamic bounding volume hierarchy; motion interpolation; non-convex multi-link odel; self-collision detection; temporal culling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing, Communication, Control, and Management, 2008. CCCM '08. ISECS International Colloquium on
Conference_Location
Guangzhou
Print_ISBN
978-0-7695-3290-5
Type
conf
DOI
10.1109/CCCM.2008.71
Filename
4609686
Link To Document