{"title":"Real time collision detection in buildings using polygon presence grid","authors":"Shahid Razzaq, A. A. Shah, Shamyl Bin Mansoor","doi":"10.1109/INMIC.2011.6151459","DOIUrl":null,"url":null,"abstract":"Achieving real time collision detection in high vertex count geometrical models like those of buildings, while maintaining an adequate frame rate, is a challenging problem. Time complexity of collision detection algorithms in such scenarios is an important factor and algorithms that provide constant time collision query processing are required. This paper presents a constant time collision detection algorithm for high vertex count and complex geometrical models by using uniform spatial grids and polygon surface subdivision technique. The algorithm thus shifts the performance balance in favor of the time constraints with a compromise on space complexity. We show the results of the proposed technique on a 400K+ vertex building model.","PeriodicalId":207616,"journal":{"name":"2011 IEEE 14th International Multitopic Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 14th International Multitopic Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC.2011.6151459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Achieving real time collision detection in high vertex count geometrical models like those of buildings, while maintaining an adequate frame rate, is a challenging problem. Time complexity of collision detection algorithms in such scenarios is an important factor and algorithms that provide constant time collision query processing are required. This paper presents a constant time collision detection algorithm for high vertex count and complex geometrical models by using uniform spatial grids and polygon surface subdivision technique. The algorithm thus shifts the performance balance in favor of the time constraints with a compromise on space complexity. We show the results of the proposed technique on a 400K+ vertex building model.