Xiang Xu, Lu Wang, Yanning Xu, Chenglei Yang, Xiangxu Meng
{"title":"基于光子映射的分布式全局照明方法","authors":"Xiang Xu, Lu Wang, Yanning Xu, Chenglei Yang, Xiangxu Meng","doi":"10.1109/IIKI.2016.68","DOIUrl":null,"url":null,"abstract":"As an excellent global illumination algorithm, photon mapping requires a large amount of memory to store photons, and it has obvious spatial locality in the step of photon searching. In this paper, we propose a distributed photon mapping algorithm. Firstly, a new delivering strategy of rendering tasks is proposed based on the ray intersection, while path tracing is used to calculate the direct illumination. Before the rendering, our work automatically synchronizes the acceleration of geometries and photons to realize data partitioning. Secondly, an overlapped KD-Tree is proposed to store photons in order to solve the problem of boundary data merging. The method of this paper is tested using multiple scenes. With ensuring good rendering results, both the rendering speed and storage load obtain the linearly optimization.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Global Illumination Method Based on Photon Mapping\",\"authors\":\"Xiang Xu, Lu Wang, Yanning Xu, Chenglei Yang, Xiangxu Meng\",\"doi\":\"10.1109/IIKI.2016.68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an excellent global illumination algorithm, photon mapping requires a large amount of memory to store photons, and it has obvious spatial locality in the step of photon searching. In this paper, we propose a distributed photon mapping algorithm. Firstly, a new delivering strategy of rendering tasks is proposed based on the ray intersection, while path tracing is used to calculate the direct illumination. Before the rendering, our work automatically synchronizes the acceleration of geometries and photons to realize data partitioning. Secondly, an overlapped KD-Tree is proposed to store photons in order to solve the problem of boundary data merging. The method of this paper is tested using multiple scenes. With ensuring good rendering results, both the rendering speed and storage load obtain the linearly optimization.\",\"PeriodicalId\":371106,\"journal\":{\"name\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIKI.2016.68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIKI.2016.68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed Global Illumination Method Based on Photon Mapping
As an excellent global illumination algorithm, photon mapping requires a large amount of memory to store photons, and it has obvious spatial locality in the step of photon searching. In this paper, we propose a distributed photon mapping algorithm. Firstly, a new delivering strategy of rendering tasks is proposed based on the ray intersection, while path tracing is used to calculate the direct illumination. Before the rendering, our work automatically synchronizes the acceleration of geometries and photons to realize data partitioning. Secondly, an overlapped KD-Tree is proposed to store photons in order to solve the problem of boundary data merging. The method of this paper is tested using multiple scenes. With ensuring good rendering results, both the rendering speed and storage load obtain the linearly optimization.