Visibility sampling on gpu and applications

In this paper, we show how recent GPUs can be used to very efficiently and conveniently sample the visibility between two surfaces, given a set of occluding triangles. We use bitwise arithmetics to evaluate, encode, and combine the samples blocked by each triangle. In particular, the number of operations is almost independent of the number of samples. Our method requires no CPU/GPU transfers, is fully implemented as geometric, vertex and fragment shaders, and thus does not impose to modify the way the geometry is sent to the graphics card. We finally present applications to soft shadows, and visibility analysis for level design. The ultimate version of this paper has been published at Eurographics 2007.

@Article { ED07c,
  author       = "Eisemann, Elmar and Decoret, Xavier",
  title        = "Visibility sampling on gpu and applications",
  journal      = "Computer Graphics Forum (Proc. of Eurographics)",
  number       = "3",
  volume       = "26",
  year         = "2007",
  url          = "http://graphics.tudelft.nl/Publications-new/2007/ED07c"
}