Abstract
In this article, we introduce a general-purpose method for computing radiosity on scenes made of parametric surfaces with arbitrary trimming curves. In contrast with past approaches that require a tessellation of the input surfaces (be it made up of triangles or patches with simple trimming curves) or some form of geometric approximation, our method takes full advantage of the rich and compact mathematical representation of objects. At its core lies the virtual mesh, an abstraction of the input geometry that allows complex shapes to be illuminated as if they were simple primitives. The virtual mesh is a collection of normalized square domains to which the input surfaces are mapped while preserving their energy properties. Radiosity values are then computed on these supports before being lifted back to the original surfaces. To demonstrate the power of our method, we describe a high-order wavelet radiosity implementation that uses the virtual mesh. Examples of objects and environments, designed for interactive applications or virtual reality, are presented. They prove that, by exactly integrating curved surfaces in the resolution process, the virtual mesh allows complex scenes to be rendered more quickly, more accurately, and much more naturally than with previously known methods.
- ARQUES,D.AND MICHELIN, S. 1995. A new radiosity approach for regular objects: Application to ruled surfaces. Comput. Graph. Forum 14, 3, 299-310. Proceedings of Eurographics '95.Google Scholar
- ARVO, J., TORRANCE, K., AND SMITS, B. 1994. A framework for the analysis of error in global illumination algorithms. Comput. Graph. Proc. Ann. Conf. Series 28, 4, 75-84. Proceedings of SIGGRAPH'94. Google Scholar
- BEKAERT,P.AND WILLEMS, Y. 1996. Error control for radiosity. In Proceedings of Eurographics Workshop on Rendering (Porto), 153-164. Google Scholar
- BOISSONNAT, J.-D. AND YVINEC, M. 1998. Algorithmic Geometry. Cambridge University Press, New York. Google Scholar
- BOUATOUCH,K.AND PATTANAIK, S. 1995. Discontinuity meshing and hierarchical multiwavelet radiosity. In Proceedings of Graphics Interface'95 (Quebec), 109-115.Google Scholar
- CHRISTENSEN, P., LISCHINSKI, D., STOLLNITZ, E., AND SALESIN, D. 1997. Clustering for glossy global illumination. ACM Trans. Graph. 16, 1, 3-33. Google Scholar
- CHRISTENSEN, P., STOLLNITZ, E., SALESIN,D.,AND DEROSE, T. 1996. Global illumination of glossy environments using wavelets and importance. ACM Trans. Graph. 15, 1, 37-71. Google Scholar
- COHEN,M.AND WALLACE, J. 1993. Radiosity and Realistic Image Synthesis. Academic Press Professional. Google Scholar
- CUNY, F. 2000. Radiosite a base d'ondelettes sur des surfaces parametriques. PhD thesis, Institut National Polytechnique de Lorraine.Google Scholar
- CUNY, F., ALONSO, L., AND HOLZSCHUCH, N. 2000. A novel approach makes higher order wavelets really efficient for radiosity. Comput. Graph. Forum 19, 3, 99-108. Proceedings of Eurographics 2000.Google Scholar
- GORAL, C., TORRANCE, K., GREENBERG,D.,AND BATTAILE, B. 1984. Modelling the interaction of light between diffuse surfaces. Comput. Graph. Proc., Ann. Conf. Series 18, 3, 212-222. Proceedings of SIGGRAPH'84. Google Scholar
- GORTLER, S., SCHRODER, P., COHEN, M., AND HANRAHAN, P. 1993. Wavelet radiosity. Comput. Graph. Proc. Ann. Conf. Series 27, 221-230. Proceedings of SIGGRAPH'93. Google Scholar
- HANRAHAN, P., SALZMAN,D.,AND AUPPERLE, L. 1991. A rapid hierarchical radiosity algorithm. Comput. Graph. Proc., Ann. Conf. Series 25, 4, 197-206. Proceedings of SIGGRAPH'91. Google Scholar
- HASENFRATZ, J.-M., DAMEZ, C., SILLION,F.,AND DRETTAKIS, G. 1999. A practical analysis of clustering strategies for hierarchical radiosity. Comput. Graph. Forum 18, 3, 221-232. Proceedings of Eurographics '99.Google Scholar
- HECKBERT, P. 1992. Discontinuity meshing for radiosity. In Proceedings of the Eurographics Workshop on Rendering (Bristol), 203-226.Google Scholar
- HECKBERT,P.AND WINGET, J. 1991. Finite element methods for global illumination. Tech. Rep. CSD-91-643, University of California, Berkeley. Google Scholar
- HOLZSCHUCH, N., CUNY,F.,AND ALONSO, L. 2000. Wavelet radiosity on arbitrary planar surfaces. In Proceedings of the Eleventh Eurographics Workshop on Rendering (Brno), 161-172. Google Scholar
- KAPLAN, W. 1984. Advanced Calculus. Addison-Wesley.Google Scholar
- LEVY,B.AND MALLET, J.-L. 1998. Non-distorted texture mapping for sheared triangulated meshes. Comput. Graph. Proc. Ann. Conf. Series 32, 343-352. Proceedings of SIGGRAPH'98. Google Scholar
- NOURSE, B., HAKALA, D., HILLYARD, R., AND MALRAISON, P. 1980. Natural quadrics in mechanical design. Autofact West 1, 363-378.Google Scholar
- PAUL, J.-C., CAVIN, X., AND ALONSO, L. 2000. Partitioning and scheduling large radiosity computations in parallel. J. Parallel Distrib. Comput. Pract. 3, 3 (Sept.). Special Issue on Parallel and Distributed Computer Graphics.Google Scholar
- REQUICHA,A.AND VOELCKER, H. 1982. Solid modeling: A historical summary and contemporary assessment. IEEE Comput. Graph. Appl. 2, 1, 9-24.Google Scholar
- RUSHMEIER, H., PATTERSON,C.,AND VEERASAMY, A. 1993. Geometric simplification for indirect illumination calculations. In Proceedings of Graphics Interface '93 (San Francisco), Morgan Kaufmann, San Mateo, Calif., 227-236.Google Scholar
- SCHAFER, S. 1997. Hierarchical radiosity on curved surfaces. In Proceedings of the Eighth Eurographics Workshop on Rendering, J. Dorsey and P. Slusallek, Eds., Springer-Wien, 187-192. Google Scholar
- SCHRODER, P. 1994. Wavelet algorithms for illumination computations. PhD thesis, Department of Computer Science, Princeton University. Google Scholar
- SCHWARZ, C., TEICH, J., VAINSHTEIN, A., WELZL, E., AND EVANS, B. 1995. Minimal enclosing parallelogram with application. In Proceedings of the Eleventh Annual ACMSymposium on Computational Geometry (Vancouver, Canada), 34-35. Google Scholar
- SILLION, F. 1995. A unified hierarchical algorithm for global illumination with scattering volumes and object clusters. IEEE Trans. Visual. Comput. Graph. 1, 3, 240-254. Google Scholar
- SILLION,F.AND PUECH, C. 1994. Radiosity and Global Illumination. Morgan Kaufmann, San Mateo, Calif. Google Scholar
- SMITS, B., ARVO,J.,AND GREENBERG, D. 1994. A clustering algorithm for radiosity in complex environments. Comput. Graph. Proc. Ann. Conf. Series 28, 435-442. Proceedings of SIGGRAPH'94. Google Scholar
- STAM, J. 1998. Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values. Comput. Graph. Proc., Ann. Conf. Series 32, 395-404. Proceedings of SIGGRAPH'98. Google Scholar
- STAMMINGER, M., SCHIRMACHER, H., SLUSALLEK,P.,AND SEIDEL, H.-P. 1998. Getting rid of links in hierarchical radiosity. Comput. Graph. Forum 17, 3, 165-174. Proceedings of Eurographics'98.Google Scholar
- STAMMINGER, M., SLUSALLEK,P.,AND SEIDEL, H.-P. 1997. Bounded radiosity-illumination on general surfaces and clusters. Comput. Graph. Forum 16, 3, 309-317. Proceedings of Eurographics'97.Google Scholar
- WILLMOTT,A.AND HECKBERT, P. 1997. An empirical comparison of progressive and wavelet radiosity. In Proceedings of the Eighth Eurographics Workshop on Rendering (New York), J. Dorsey and P. Slusallek, Eds., Springer, New York, 175-186. Google Scholar
- WILLMOTT, A., HECKBERT,P.,AND GARLAND, M. 1999. Face cluster radiosity. In Proceedings of the Tenth Eurographics Workshop on Rendering (Granada), 293-304. Google Scholar
- WINKLER, C. 1998. Experimentation d'algorithmes de calcul de radiositea base d'ondelettes. PhD thesis, Institut National Polytechnique de Lorraine.Google Scholar
- ZATZ, H. 1993. Galerkin radiosity: A higher-order solution method for global illumination. Comput. Graph. Proc. Ann. Conf. Series 27, 213-220. Proceedings of SIGGRAPH'93. Google Scholar
Index Terms
- The virtual mesh: a geometric abstraction for efficiently computing radiosity
Recommendations
Interactive global illumination based on coherent surface shadow maps
GI '08: Proceedings of Graphics Interface 2008Interactive rendering of global illumination effects is a challenging problem. While precomputed radiance transfer (PRT) is able to render such effects in real time the geometry is generally assumed static. This work proposes to replace the precomputed ...
Comments