Efficient Collision Detection Using a Dual Bounding Volume Hierarchy
Identifieur interne : 005121 ( Main/Merge ); précédent : 005120; suivant : 005122Efficient Collision Detection Using a Dual Bounding Volume Hierarchy
Auteurs : Jung-Woo Chang [Corée du Sud] ; Wenping Wang [Hong Kong] ; Myung-Soo Kim [Corée du Sud]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. This approach combines the compactness of OBBs and the simplicity of spheres. The majority of distant objects are separated using the simpler sphere tests. The remaining objects are in close proximity, where some separation axes are significantly more effective than others. We select 5 from among the 15 potential separating axes for OBBs. Experimental results show that our algorithm achieved favorable speed up with respect to the existing OBB algorithms.
Url:
DOI: 10.1007/978-3-540-79246-8_11
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002916
- to stream Istex, to step Curation: 002916
- to stream Istex, to step Checkpoint: 001502
Links to Exploration step
ISTEX:3879DDD9DFA2B3EC3830BAE321AEC850DEDDAD91Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Collision Detection Using a Dual Bounding Volume Hierarchy</title><author><name sortKey="Chang, Jung Woo" sort="Chang, Jung Woo" uniqKey="Chang J" first="Jung-Woo" last="Chang">Jung-Woo Chang</name></author><author><name sortKey="Wang, Wenping" sort="Wang, Wenping" uniqKey="Wang W" first="Wenping" last="Wang">Wenping Wang</name></author><author><name sortKey="Kim, Myung Soo" sort="Kim, Myung Soo" uniqKey="Kim M" first="Myung-Soo" last="Kim">Myung-Soo Kim</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3879DDD9DFA2B3EC3830BAE321AEC850DEDDAD91</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-79246-8_11</idno><idno type="url">https://api.istex.fr/document/3879DDD9DFA2B3EC3830BAE321AEC850DEDDAD91/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002916</idno><idno type="wicri:Area/Istex/Curation">002916</idno><idno type="wicri:Area/Istex/Checkpoint">001502</idno><idno type="wicri:doubleKey">0302-9743:2008:Chang J:efficient:collision:detection</idno><idno type="wicri:Area/Main/Merge">005121</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient Collision Detection Using a Dual Bounding Volume Hierarchy</title><author><name sortKey="Chang, Jung Woo" sort="Chang, Jung Woo" uniqKey="Chang J" first="Jung-Woo" last="Chang">Jung-Woo Chang</name><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Seoul National University</wicri:regionArea></affiliation></author><author><name sortKey="Wang, Wenping" sort="Wang, Wenping" uniqKey="Wang W" first="Wenping" last="Wang">Wenping Wang</name><affiliation wicri:level="1"><country xml:lang="fr">Hong Kong</country><wicri:regionArea>University of Hong Kong</wicri:regionArea></affiliation></author><author><name sortKey="Kim, Myung Soo" sort="Kim, Myung Soo" uniqKey="Kim M" first="Myung-Soo" last="Kim">Myung-Soo Kim</name><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Seoul National University</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2008</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">3879DDD9DFA2B3EC3830BAE321AEC850DEDDAD91</idno><idno type="DOI">10.1007/978-3-540-79246-8_11</idno><idno type="ChapterID">11</idno><idno type="ChapterID">Chap11</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. This approach combines the compactness of OBBs and the simplicity of spheres. The majority of distant objects are separated using the simpler sphere tests. The remaining objects are in close proximity, where some separation axes are significantly more effective than others. We select 5 from among the 15 potential separating axes for OBBs. Experimental results show that our algorithm achieved favorable speed up with respect to the existing OBB algorithms.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/HapticV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005121 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 005121 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= HapticV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:3879DDD9DFA2B3EC3830BAE321AEC850DEDDAD91
|texte= Efficient Collision Detection Using a Dual Bounding Volume Hierarchy
}}
| This area was generated with Dilib version V0.6.23. |  |