Vasilakis, Andreas A.Papaioannou, GeorgiosB. Bickel and T. Ritschel2015-04-152015-04-152015https://doi.org/10.2312/egsh.20151017In 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.I.3.7 [Computer Graphics]Three Dimensional Graphics and RealismHidden line/surface removal10.2312/egsh.2015101769-72