Improving k-buffer Methods via Occupancy Maps
| dc.contributor.author | Vasilakis, Andreas A. | en_US |
| dc.contributor.author | Papaioannou, Georgios | en_US |
| dc.contributor.editor | B. Bickel and T. Ritschel | en_US |
| dc.date.accessioned | 2015-04-15T08:32:45Z | |
| dc.date.available | 2015-04-15T08:32:45Z | |
| dc.date.issued | 2015 | en_US |
| dc.description.abstract | In this work, we investigate an efficient approach to treat fragment racing when computing k-nearest fragments. Based on the observation that knowing the depth position of the k-th fragment we can optimally find the k-closest fragments, we introduce a novel fragment culling component by employing occupancy maps.Without any softwareredesign, the proposed scheme can easily be attached at any k-buffer pipeline to efficiently perform early-z culling. Finally, we report on the efficiency, memory space, and robustness of the upgraded k-buffer alternatives providing comprehensive comparison results. | en_US |
| dc.description.sectionheaders | Rendering and Images | en_US |
| dc.description.seriesinformation | EG 2015 - Short Papers | en_US |
| dc.identifier.doi | 10.2312/egsh.20151017 | en_US |
| dc.identifier.pages | 69-72 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/egsh.20151017 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | I.3.7 [Computer Graphics] | en_US |
| dc.subject | Three Dimensional Graphics and Realism | en_US |
| dc.subject | Hidden line/surface removal | en_US |
| dc.title | Improving k-buffer Methods via Occupancy Maps | en_US |