{"title":"使用GPU着色器计算最短路径映射","authors":"C. Camporesi, Marcelo Kallmann","doi":"10.1145/2668064.2668092","DOIUrl":null,"url":null,"abstract":"We present in this paper a new GPU-based approach to compute Shortest Path Maps (SPMs) from a source point in a polygonal domain. Our method takes advantage of GPU polygon rasterization with shader programming. After encoding the SPM in the frame buffer, globally shortest paths are efficiently computed in time proportional to the number of vertices in the path, and length queries are computed in constant time. We have evaluated our method in multiple environments and our results show a significant speedup in comparison to previous approaches.","PeriodicalId":138747,"journal":{"name":"Proceedings of the 7th International Conference on Motion in Games","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Computing shortest path maps with GPU shaders\",\"authors\":\"C. Camporesi, Marcelo Kallmann\",\"doi\":\"10.1145/2668064.2668092\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present in this paper a new GPU-based approach to compute Shortest Path Maps (SPMs) from a source point in a polygonal domain. Our method takes advantage of GPU polygon rasterization with shader programming. After encoding the SPM in the frame buffer, globally shortest paths are efficiently computed in time proportional to the number of vertices in the path, and length queries are computed in constant time. We have evaluated our method in multiple environments and our results show a significant speedup in comparison to previous approaches.\",\"PeriodicalId\":138747,\"journal\":{\"name\":\"Proceedings of the 7th International Conference on Motion in Games\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 7th International Conference on Motion in Games\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2668064.2668092\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Motion in Games","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2668064.2668092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present in this paper a new GPU-based approach to compute Shortest Path Maps (SPMs) from a source point in a polygonal domain. Our method takes advantage of GPU polygon rasterization with shader programming. After encoding the SPM in the frame buffer, globally shortest paths are efficiently computed in time proportional to the number of vertices in the path, and length queries are computed in constant time. We have evaluated our method in multiple environments and our results show a significant speedup in comparison to previous approaches.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
