“A median cut algorithm for light probe sampling” by Debevec

  • ©Paul E. Debevec




    A median cut algorithm for light probe sampling



    We present a technique for approximating a light probe image as a constellation of light sources based on a median cut algorithm. The algorithm is efficient, simple to implement, and can realistically represent a complex lighting environment with as few as 64 point light sources.


    1. Agarwal, S., Ramamoorthi, R., Belongie, S., and Jensen, H. W. 2003. Structured importance sampling of environment maps. ACM Transactions on Graphics 22, 3 (July), 605–612.
    2. Cohen, J. M., and Debevec, P. 2001. The LightGen HDRShop plugin. http://www.hdrshop.com/main-pages/plugins.html.
    3. Crow, F. C. 1984. Summed-area tables for texture mapping. In Computer Graphics (Proceedings of SIGGRAPH 84), vol. 18, 207–212.
    4. Heckbert, P. 1982. Color image quantization for frame buffer display. In SIG-GRAPH ’82: Proceedings of the 9th annual conference on Computer graphics and interactive techniques, ACM Press, New York, NY, USA, 297–307.
    5. Kollig, T., and Keller, A. 2003. Efficient illumination by high dynamic range images. In Eurographics Symposium on Rendering: 14th Eurographics Workshop on Rendering, 45–51.
    6. Ostromoukhov, V., Donohue, C., and Jodoin, P.-M. 2004. Fast hierarchical importance sampling with blue noise properties. ACM Transactions on Graphics 23, 3 (Aug.), 488–495.

Additional Images:

©Paul E. Debevec ©Paul E. Debevec

ACM Digital Library Publication:

Overview Page: