{"title":"直接发送合成并行排序最后渲染","authors":"S. Eilemann, R. Pajarola","doi":"10.2312/EGPGV/EGPGV07/029-036","DOIUrl":null,"url":null,"abstract":"In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can easily be incorporated into most visualization systems. However, the efficient final depth-compositing for polygonal data, or alpha-blending for volume data of partial rendering results is the key to achieve scalability in sort-last parallel rendering. In this paper, we demonstrate the efficiency as well as flexibility of the direct send sort-last compositing algorithm, and compare it to existing approaches, both in a theoretical analysis and in an experimental setting.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"33 1","pages":"29-36"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Direct send compositing for parallel sort-last rendering\",\"authors\":\"S. Eilemann, R. Pajarola\",\"doi\":\"10.2312/EGPGV/EGPGV07/029-036\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can easily be incorporated into most visualization systems. However, the efficient final depth-compositing for polygonal data, or alpha-blending for volume data of partial rendering results is the key to achieve scalability in sort-last parallel rendering. In this paper, we demonstrate the efficiency as well as flexibility of the direct send sort-last compositing algorithm, and compare it to existing approaches, both in a theoretical analysis and in an experimental setting.\",\"PeriodicalId\":90824,\"journal\":{\"name\":\"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization\",\"volume\":\"33 1\",\"pages\":\"29-36\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2312/EGPGV/EGPGV07/029-036\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/EGPGV/EGPGV07/029-036","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Direct send compositing for parallel sort-last rendering
In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can easily be incorporated into most visualization systems. However, the efficient final depth-compositing for polygonal data, or alpha-blending for volume data of partial rendering results is the key to achieve scalability in sort-last parallel rendering. In this paper, we demonstrate the efficiency as well as flexibility of the direct send sort-last compositing algorithm, and compare it to existing approaches, both in a theoretical analysis and in an experimental setting.