Daniel Meneveaux
ABSTRACT
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the radiosity method are time consuming and (ii) the large amount of memory needed is very large. In this paper, we address this problem by proposing a new clustering technique as well as a new method of visibility computation for complex indoor scenes. Our clustering algorithm groups polygons that are close to each other in each room (or corridor) of the building. It relies on a classification method of k-mean type and allows the use of several kinds of distance functions. For each group of polygons (or cluster), we estimate the set of potentially visible clusters with the help of openings such as doors or windows. This computation results in a graph in which the nodes correspond to clusters and the edges express visibility relationships between the corresponding clusters. We use this graph for computing radiosity in complex buildings while reducing both the amount of memory needed and the computing time. Our global illumination method is a MWRA (multi-wavelet radiosity algorithm). Unlike cluster-based radiosity methods, our MWRA does not approximate (but computes accurately) the light energy impinging or leaving a cluster after multiple reflections. We provide results for 3 different test scenes containing a high number of polygons.
- Airey, J. M. 1990. Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculation. PhD thesis, University of North Carolina at Chapel hill.]] Google Scholar
Digital Library
- Amanatides, J., and Woo, A. 1987. A fast voxel traversal algorithm for ray tracing. In Eurographics'87.]]Google Scholar
- Bouatouch, K., and Pattanaik, S. N. 1995. Discontinuity meshing and hierarchical multiwavelet radiosity. Graphics Interface'95.]]Google Scholar
- Cazals, F., Drettakis, G., and Puech, C. 1995. Filtering, clustering and hierarchy construction: a new solution for ray tracing complex scenes. Computer Graphics Forum (Eurographics '95) 14, 3.]]Google Scholar
- Chin, N., and Feiner, S. 1989. Near real-time shadow generation using bsp trees. Computer Graphics 23, 3 (July), 99-106.]] Google ScholarDigital Library
- Cleary, J., and Wyvill, G. 1988. Analysis of an algorithm for fast distributed ray tracing using uniform space subdivision. The Visual Computer 4, 2 (July), 65-83.]]Google ScholarCross Ref
- Coorg, S., and Teller, S. 1997. Real-time occlusion culling for models with large occluders. ACM Symposium on Interactive 3D graphics..]] Google ScholarDigital Library
- Drettakis, G., and Fiume, E. 1994. A fast shadow algorithm for area light sources using backprojection. ACM SIGGRAPH'94.]] Google ScholarDigital Library
- Drettakis, F. D. G., and Puech, C. 1997. The visibility skeleton: A powerful and efficient multi-purpose global visibility tool. SIGGRAPH'97.]] Google ScholarDigital Library
- Funkhouser, T. 1996. Coarse-grained parallelism for hierarchical radiosity using group iterative methods. ACM SIGGRAPH'96 proceedings (Aug.), 343-352.]] Google ScholarDigital Library
- Gibson, S., and Hubbold, R. 1996. Efficient hierarchical refinement and clustering for radiosity in complex environments. Computer Graphics Forum 15, 297-310.]]Google ScholarCross Ref
- Gigante, M. 1990. Accelerated ray tracing using non-uniform grids. In AusGraph'90.]]Google Scholar
- Goldsmith, J., and Salmon, J. 1987. Automatic creation of object hierarchies for ray tracing. In IEEE Computer Graphics and Applications, vol. 7, 14-20.]] Google ScholarDigital Library
- Goral, C., Torrance, K., Greenberg, D., and Battaile, B. 1984. Modeling the interaction of light between diffuse surfaces. Computer Graphics 18, 3 (July), 213-222.]] Google ScholarDigital Library
- Gortler, S. J., Schroder, P., Cohen, M. F., and Hanrahan, P. 1993. Wavelet radiosity. In Computer Graphics Proceedings, Annual Conference Series, ACM, Ed., 221-230.]] Google ScholarDigital Library
- Haber, J., Stamminger, M., and Seidel, H.-P. 2000. Enhanced automatic creation of multi-purpose object hierarchies. In Pacific Graphics'2000, 52-61.]] Google ScholarDigital Library
- Haines, E. A., and Wallace, J. R. 1991. Shaft culling for efficient ray-cast radiosity. In Proceedings of 2nd Workshop on Rendering, 122-138.]]Google Scholar
- Hall, D. J., and Ball, G. H. 1965. Isodata a novel method of data analysis and pattern classification. Tech. Rep. 5 RI project 5533, Stanford Research Institute, CA, USA.]]Google Scholar
- Hanrahan, P., Salzman, D., and Aupperle, L. 1991. A rapid hierarchical radiosity algorithm for unoccluded environments. Computer Graphics 25, 4 (July), 197-205.]] Google ScholarDigital Library
- Hasenfratz, J.-M., Damez, C., Sillion, F., and Drettakis, G. 1999. A practical analysis of clustering strategies for hierarchical radiosity. In Computer Graphics Forum (Proc. of Eurographics '99), P. Brunet and R. Scopigno, no. 18(3), 221-232.]]Google Scholar
- John M. Airey, John H. Rohlf, F. P. B. 1990. Towards image realism with interactive update rates in complex virtual building environments. ACM Siggraph (May), 41-50.]] Google ScholarDigital Library
- Kay, T. L., and Kajiya, J. T. 1986. Ray tracing complex scenes. ACM SIGGRAPH'86., 269-278.]] Google ScholarDigital Library
- Klimaszewski, K. S. 1997. Faster ray tracing using adaptive grids. IEEE Computer Graphics and Applications 17, 1 (Jan.), 42-51.]] Google ScholarDigital Library
- Leblanc, L., and Poulin, P. 2000. Guaranteed occlusion and visibility in cluster hierarchical radiosity. In Eurographics Workshop on Rendering 2000, 89-100.]] Google ScholarDigital Library
- Meneveaux, D., and Bouatouch, K. 1999. Synchronisation and load balancing for parallel hierarchical radiosity of complex scenes on a heterogeneous computer network. Computer Graphics Forum 18, 4 (Dec.).]]Google ScholarCross Ref
- Meneveaux, D., Bouatouch, K., and Maisel, E. 1998. Memory management schemes for radiosity computation in complex environments. In Computer Graphics International.]] Google ScholarDigital Library
- Meneveaux, D., Maisel, E., Delmont, R., and Bouatouch, K. 1998. A new partitioning method for architectural environments. Journal of Vizualisation and Computer Animation, 3148 (Nov.).]]Google Scholar
- Müller, G., Schfer, S., and Fellner, D. W. 2000. Automatic creation of object hierarchies of radiosity clustering. Computer Graphics Forum 19, 4 (Dec), 213-221. Sabine Coquillart, David J. Duke: Editorial. 194.]]Google ScholarCross Ref
- Salam, I., Nehlig, P., and Andres, E. 1999. Discrete raycasting. In 8th International Workshop on Discrete geometry for Computer Imagery (DGCI'99).]] Google ScholarDigital Library
- Sauvée, M. 1994. Maillage de discontinuités pour le modele de radiosité. Tech. rep., IRISA, Sept.]]Google Scholar
- Sillion, F., and Drettakis, G. 1995. Feature-based control of visibility error: A multi-resolution clustering algorithm for global illumination. ACM SIGGRAPH'95.]] Google ScholarDigital Library
- Sillion, F. 1994. Clustering and volume scattering for hierarchical radiosity calculations. 5th Eurographics Workshop on Rendering.]]Google Scholar
- Sillion, F. 1995. A unified hierarchical algorithm for global illumination with scattering volumes and objects clusters. IEEE Transaction On Graphics 1, 3.]] Google ScholarDigital Library
- Smits, B., Arvo, J., and Greenberg, D. 1994. A clustering algorithm for radiosity in complex environments. In Computer Graphics Proceedings, Annual Conference Series, 435-442.]] Google ScholarDigital Library
- Snyder, J., and Barr, A. 1987. Ray tracing complex models containing surface tesselations. In Computer Graphics ACM SIGGRAPH, 119-128.]] Google ScholarDigital Library
- T. Funkhouser, S. Teller, C. S., and Khorramabadi, D. 1996. The uc berkeley system for interactive visualization of large architectural models. Presence 5, 1, 13-44.]]Google ScholarDigital Library
- Teller, S., and Hanrahan, P. 1993. Global visibility algorithms for illumination computations. In Computer Graphics Proceedings, Annual Conference Series, 239-246.]] Google ScholarDigital Library
- Teller, S., Fowler, C., Funkhouser, T., and Hanrahan, P. 1994. Partitioning and ordering large radiosity computations. In Computer Graphics Proceedings, Annual Conference Series, 443-450.]] Google ScholarDigital Library
- Teller, S. 1992. Computing the antipenumbra of an area light source. In SIGGRAPH'92.]] Google ScholarDigital Library
- Teller, S. J. 1992. Visibility Computations in Density Occluded Polyhedral Environments. PhD thesis, University of California at Berkeley.]] Google ScholarDigital Library
Index Terms
- Efficient clustering and visibility calculation for global illumination
Recommendations
Implicit visibility and antiradiance for interactive global illumination
SIGGRAPH '07: ACM SIGGRAPH 2007 papersWe reformulate the rendering equation to alleviate the need for explicit visibility computation, thus enabling interactive global illumination on graphics hardware. This is achieved by treating visibility implicitly and propagating an additional ...
Precomputed illuminance composition for real-time global illumination
I3D '16: Proceedings of the 20th ACM SIGGRAPH Symposium on Interactive 3D Graphics and GamesIn this paper we present a new real-time approach for indirect global illumination under dynamic lighting conditions. We use surfels to gather a sampling of the local illumination and propagate the light through the scene using a hierarchy and a set of ...
An efficient GPU-based approach for interactive global illumination
SIGGRAPH '09: ACM SIGGRAPH 2009 papersThis paper presents a GPU-based method for interactive global illumination that integrates complex effects such as multi-bounce indirect lighting, glossy reflections, caustics, and arbitrary specular paths. Our method builds upon scattered data sampling ...
Comments