基于矢量的窄相位碰撞检测距离计算技术

H. Sulaiman, M. Othman, Mohd Shakir Md Saat, Abd Majid Bin Darsono, A. Bade, Mohd Harun Abdullah
{"title":"基于矢量的窄相位碰撞检测距离计算技术","authors":"H. Sulaiman, M. Othman, Mohd Shakir Md Saat, Abd Majid Bin Darsono, A. Bade, Mohd Harun Abdullah","doi":"10.1109/ISTMET.2014.6936563","DOIUrl":null,"url":null,"abstract":"Distance computation between three-dimensional (3D) for narrow phase collision detection is always a common problem for researchers to produce high quality optimization with reasonable speed of intersection experiment. Given a set of objects with hundreds to thousands of polygons, finding the nearly exact distance between 3D objects are rather expensive and exhausted. In this paper, we presented our current work on performing distance computation between 3D objects based on vector-based searching using Dynamic Origin Point (DyOP). Our theoretical work suggested that by implementing DyOP, we could reduce the numbers of testing that will be undergone by the simulation and thus avoiding expensive computational cost.","PeriodicalId":364834,"journal":{"name":"2014 International Symposium on Technology Management and Emerging Technologies","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Vector-based technique for distance computation in narrow phase collision detection\",\"authors\":\"H. Sulaiman, M. Othman, Mohd Shakir Md Saat, Abd Majid Bin Darsono, A. Bade, Mohd Harun Abdullah\",\"doi\":\"10.1109/ISTMET.2014.6936563\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distance computation between three-dimensional (3D) for narrow phase collision detection is always a common problem for researchers to produce high quality optimization with reasonable speed of intersection experiment. Given a set of objects with hundreds to thousands of polygons, finding the nearly exact distance between 3D objects are rather expensive and exhausted. In this paper, we presented our current work on performing distance computation between 3D objects based on vector-based searching using Dynamic Origin Point (DyOP). Our theoretical work suggested that by implementing DyOP, we could reduce the numbers of testing that will be undergone by the simulation and thus avoiding expensive computational cost.\",\"PeriodicalId\":364834,\"journal\":{\"name\":\"2014 International Symposium on Technology Management and Emerging Technologies\",\"volume\":\"121 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Symposium on Technology Management and Emerging Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTMET.2014.6936563\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Symposium on Technology Management and Emerging Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTMET.2014.6936563","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

窄相位碰撞检测中三维空间距离的计算一直是困扰研究人员的难题,如何以合理的速度进行高质量的交叉口实验优化。给定一组具有数百到数千个多边形的对象,找到3D对象之间几乎精确的距离是相当昂贵和耗尽的。在本文中,我们介绍了基于动态原点(DyOP)的矢量搜索在三维物体之间进行距离计算的研究进展。我们的理论工作表明,通过实现DyOP,我们可以减少模拟将经历的测试次数,从而避免昂贵的计算成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vector-based technique for distance computation in narrow phase collision detection
Distance computation between three-dimensional (3D) for narrow phase collision detection is always a common problem for researchers to produce high quality optimization with reasonable speed of intersection experiment. Given a set of objects with hundreds to thousands of polygons, finding the nearly exact distance between 3D objects are rather expensive and exhausted. In this paper, we presented our current work on performing distance computation between 3D objects based on vector-based searching using Dynamic Origin Point (DyOP). Our theoretical work suggested that by implementing DyOP, we could reduce the numbers of testing that will be undergone by the simulation and thus avoiding expensive computational cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信