基于粒子的高分辨率可变形物体碰撞检测

Thiti Rungcharoenpaisal, P. Kanongchaiyos
{"title":"基于粒子的高分辨率可变形物体碰撞检测","authors":"Thiti Rungcharoenpaisal, P. Kanongchaiyos","doi":"10.1145/1666778.1666801","DOIUrl":null,"url":null,"abstract":"Computational time of collision detection can be exceeded when there are too many checking for non-colliding primitives on some particular areas of high-resolution deformable objects. The problem is usually solved with best-fit bounding volume hierarchies (BVHs) which require much more memory and time for updating the bounding volumes when the objects deform. Hence, a particle-based collision detection method is enhanced to reduce the checking for non-colliding primitives by adding movable particles on the object vertices corresponding to each particular area. The distance of corresponding particles are computed for selecting the closest vertices between each pair of objects. The experimental results show that the proposed method has less colliding checking time than using BVHs when using with the deformable objects. Moreover, the proposed primitive-checking method can be parallel processed on GPU increasing speed performance while accuracy is still preserved when the results are compared to the previous BVH method.","PeriodicalId":180587,"journal":{"name":"ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Collision detection for high-resolution deformable object using particle-based approach\",\"authors\":\"Thiti Rungcharoenpaisal, P. Kanongchaiyos\",\"doi\":\"10.1145/1666778.1666801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computational time of collision detection can be exceeded when there are too many checking for non-colliding primitives on some particular areas of high-resolution deformable objects. The problem is usually solved with best-fit bounding volume hierarchies (BVHs) which require much more memory and time for updating the bounding volumes when the objects deform. Hence, a particle-based collision detection method is enhanced to reduce the checking for non-colliding primitives by adding movable particles on the object vertices corresponding to each particular area. The distance of corresponding particles are computed for selecting the closest vertices between each pair of objects. The experimental results show that the proposed method has less colliding checking time than using BVHs when using with the deformable objects. Moreover, the proposed primitive-checking method can be parallel processed on GPU increasing speed performance while accuracy is still preserved when the results are compared to the previous BVH method.\",\"PeriodicalId\":180587,\"journal\":{\"name\":\"ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1666778.1666801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1666778.1666801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

当对高分辨率可变形物体的某些特定区域进行过多的非碰撞原语检查时,会导致碰撞检测的计算时间过多。该问题通常通过最佳拟合边界卷层次(best fit bounding volume hierarchies, BVHs)来解决,当物体变形时,BVHs需要更多的内存和时间来更新边界卷。因此,增强了基于粒子的碰撞检测方法,通过在每个特定区域对应的物体顶点上添加可移动粒子来减少对非碰撞原语的检查。计算相应粒子的距离,选择每对物体之间最接近的顶点。实验结果表明,与BVHs相比,该方法在处理可变形物体时具有更短的碰撞检测时间。此外,该方法可以在GPU上并行处理,提高了速度性能,同时与之前的BVH方法进行比较,结果保持了精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Collision detection for high-resolution deformable object using particle-based approach
Computational time of collision detection can be exceeded when there are too many checking for non-colliding primitives on some particular areas of high-resolution deformable objects. The problem is usually solved with best-fit bounding volume hierarchies (BVHs) which require much more memory and time for updating the bounding volumes when the objects deform. Hence, a particle-based collision detection method is enhanced to reduce the checking for non-colliding primitives by adding movable particles on the object vertices corresponding to each particular area. The distance of corresponding particles are computed for selecting the closest vertices between each pair of objects. The experimental results show that the proposed method has less colliding checking time than using BVHs when using with the deformable objects. Moreover, the proposed primitive-checking method can be parallel processed on GPU increasing speed performance while accuracy is still preserved when the results are compared to the previous BVH method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An esthetics rule-based ranking system for amateur photos Qualitative evaluation of quantitative dance motion data A tone reproduction operator accounting for mesopic vision Real-time horizon-based reflection occlusion Poisson compositing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1