File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Detecting collision of polytopes using a heuristic search for separating vectors

TitleDetecting collision of polytopes using a heuristic search for separating vectors
Authors
KeywordsCollision Detection
Computational Geometry
Computer Graphics
Virtual Reality
Issue Date2003
Citation
Jisuanji Xuebao/Chinese Journal Of Computers, 2003, v. 26 n. 7, p. 837-847 How to Cite?
AbstractThe collision detection problem is to determine whether two moving objects collide or not at any moment. It is fundamental to computer simulation of a physical environment, and has applications in computer graphics, CAD/CAM, virtual reality, and robotics. This paper proposes a new method, called HS-jump, for collision detection for polytopes. HS-jump combines an efficient scheme to report collision for two colliding polytopes and a fast heuristic strategy to search for a separating vector of two separated polytopes. A separating vector is the normal vector of a separating plane of two disjoint polytopes. To speed up the implementation of the algorithm, the hierarchical representation of a polytope is used to compute the supporting vertex pair, and a balanced binary tree is used to store the vertices of the spherical convex polygon, and between-frame coherence is exploited. Due to the particular nature of the search scheme used, HS-jump becomes more efficient when the convex polyhedra are more spherically shaped. Hence, in the case of applying HS-jump to convex poly-hedra with a large number of vertices, HS-jump delivers the maximum efficiency if the objects are on average not very elongated.
Persistent Identifierhttp://hdl.handle.net/10722/152302
ISSN
2015 SCImago Journal Rankings: 0.338
References

 

DC FieldValueLanguage
dc.contributor.authorLi, XQen_US
dc.contributor.authorMeng, XXen_US
dc.contributor.authorWang, JYen_US
dc.contributor.authorWang, WPen_US
dc.contributor.authorChung, Ken_US
dc.contributor.authorYiu, SMen_US
dc.date.accessioned2012-06-26T06:37:02Z-
dc.date.available2012-06-26T06:37:02Z-
dc.date.issued2003en_US
dc.identifier.citationJisuanji Xuebao/Chinese Journal Of Computers, 2003, v. 26 n. 7, p. 837-847en_US
dc.identifier.issn0254-4164en_US
dc.identifier.urihttp://hdl.handle.net/10722/152302-
dc.description.abstractThe collision detection problem is to determine whether two moving objects collide or not at any moment. It is fundamental to computer simulation of a physical environment, and has applications in computer graphics, CAD/CAM, virtual reality, and robotics. This paper proposes a new method, called HS-jump, for collision detection for polytopes. HS-jump combines an efficient scheme to report collision for two colliding polytopes and a fast heuristic strategy to search for a separating vector of two separated polytopes. A separating vector is the normal vector of a separating plane of two disjoint polytopes. To speed up the implementation of the algorithm, the hierarchical representation of a polytope is used to compute the supporting vertex pair, and a balanced binary tree is used to store the vertices of the spherical convex polygon, and between-frame coherence is exploited. Due to the particular nature of the search scheme used, HS-jump becomes more efficient when the convex polyhedra are more spherically shaped. Hence, in the case of applying HS-jump to convex poly-hedra with a large number of vertices, HS-jump delivers the maximum efficiency if the objects are on average not very elongated.en_US
dc.languageengen_US
dc.relation.ispartofJisuanji Xuebao/Chinese Journal of Computersen_US
dc.subjectCollision Detectionen_US
dc.subjectComputational Geometryen_US
dc.subjectComputer Graphicsen_US
dc.subjectVirtual Realityen_US
dc.titleDetecting collision of polytopes using a heuristic search for separating vectorsen_US
dc.typeArticleen_US
dc.identifier.emailWang, WP:wenping@cs.hku.hken_US
dc.identifier.emailYiu, SM:smyiu@cs.hku.hken_US
dc.identifier.authorityWang, WP=rp00186en_US
dc.identifier.authorityYiu, SM=rp00207en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0142028668en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0142028668&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume26en_US
dc.identifier.issue7en_US
dc.identifier.spage837en_US
dc.identifier.epage847en_US
dc.publisher.placeChinaen_US
dc.identifier.scopusauthoridLi, XQ=7501701381en_US
dc.identifier.scopusauthoridMeng, XX=7401629599en_US
dc.identifier.scopusauthoridWang, JY=36078663700en_US
dc.identifier.scopusauthoridWang, WP=35147101600en_US
dc.identifier.scopusauthoridChung, K=7404086075en_US
dc.identifier.scopusauthoridYiu, SM=7003282240en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats