Improving k-buffer Methods via Occupancy Maps

Vasilakis, Andreas A.; Papaioannou, Georgios

Improving k-buffer Methods via Occupancy Maps

Files

069-072.pdf (571.06 KB)

shaders.zip (6.57 KB)

Date

2015

Authors

Vasilakis, Andreas A.
Papaioannou, Georgios

Publisher

The Eurographics Association

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.

        @inproceedings{10.2312:egsh.20151017
,
booktitle = {EG 2015 - Short Papers
},
editor = {B. Bickel and T. Ritschel
},
title = {{Improving k-buffer Methods via Occupancy Maps
}},
author = {Vasilakis, Andreas A. and 
Papaioannou, Georgios
},
year = {2015
},
publisher = {The Eurographics Association
},
ISBN = {},
DOI = {10.2312/egsh.20151017
}
}