Abstract
Wavelet radiosity is, by its nature, restricted to parallelograms or triangles. This paper presents an innovative technique enabling wavelet radiosity computations on planar surfaces of arbitrary shape, including concave contours or contours with holes. This technique replaces the need for triangulating such complicated shapes, greatly reducing the complexity of the wavelet radiosity algorithm and the computation time. It also gives a better approximation of the radiosity function, resulting in better visual results. Our technique works by separating the radiosity function from the surface geometry, extending the radiosity function defined on the original shape onto a simpler domain — a parallelogram — better behaved for hierarchical refinement and wavelet computations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. R. Baum, S. Mann, K. P. Smith, and J. M. Winget. Making Radiosity Usable: Automatic Preprocessing and Meshing Techniques for the Generation of Accurate Radiosity Solutions. Computer Graphics (ACM SIGGRAPH ’91 Proceedings), 25(4):51–60, July 1991.
P. Bekaert and Y. Willems. Error Control for Radiosity. In Rendering Techniques ’96 (Proceedings of the Seventh Eurographics Workshop on Rendering), pages 153–164, New York, NY, 1996. Springer-Verlag/Wien.
P. Bekaert and Y. D. Willems. Hirad: A Hierarchical Higher Order Radiosity Implementation. In Proceedings of the Twelfth Spring Conference on Computer Graphics (SCCG ’96), Bratislava, Slovakia, June 1996. Comenius University Press.
J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, 1998.
K. Bouatouch and S. N. Pattanaik. Discontinuity Meshing and Hierarchical Multiwavelet Radiosity. In W. A. Davis and P. Prusinkiewicz, editors, Proceedings of Graphics Interface ’95, pages 109–115, San Francisco, CA, May 1995. Morgan Kaufmann.
X. Cavin, L. Alonso, and J.-C. Paul. Parallel Wavelet Radiosity. In Second Eurographics Workshop on Parallel Graphics and Visualisation, pages 61–75, Rennes, France, Sept. 1998.
F. Cuny, L. Alonso, and N. Holzschuch. A novel approach makes higher order wavelets really efficient for radiosity. Computer Graphics Forum (Eurographics 2000 Proceedings), 19(3), Sept. 2000. To appear. Available from http://www.lona.fr/~holzschu/Publications/paper20.pdf/~holzschu/Publications/paper20.pdf.
O. Devillers, M. Teillaud, and M. Yvinec. Dynamic location in an arrangement of line segments in the plane. Algorithms Review, 2(3):89–103, 1992.
H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Nov. 1987.
S. Gibson and R. J. Hubbold. Efficient hierarchical refinement and clustering for radiosity in complex environments. Computer Graphics Forum, 15(5):297–310, Dec. 1996.
C.M. Goral, K. E. Torrance, D. P. Greenberg, and B. Battaile. Modelling the Interaction of Light Between Diffuse Surfaces. Computer Graphics (ACM SIGGRAPH ’84 Proceedings), 18(3):212–222, July 1984.
S. J. Gortler, P. Schroder, M. F. Cohen, and P. Hanrahan. Wavelet Radiosity. In Computer Graphics Proceedings, Annual Conference Series, 1993 (ACM SIGGRAPH ’93 Proceedings), pages 221–230, 1993.
P. Hanrahan, D. Salzman, and L. Aupperle. A Rapid Hierarchical Radiosity Algorithm. Computer Graphics (ACM SIGGRAPH ’91 Proceedings), 25(4): 197–206, July 1991.
J. M. Hasenfratz, C. Damez, F. Sillion, and G. Drettakis. A practical analysis of clustering strategies for hierarchical radiosity. Computer Graphics Forum (Eurographics ’99 Proceedings), 18(3):C-221-C-232, Sept. 1999.
C. Schwarz, J. Teich, A. Vainshtein, E. Welzl, and B. L. Evans. Minimal enclosing parallelogram with application. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C34–C35, 1995.
F. Sillion. A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters. IEEE Transactions on Visualization and Computer Graphics. 1(3), Sept. 1995.
B. Smits, J. Arvo, and D. Greenberg. A Clustering Algorithm for Radiosity in Complex Environments. In Computer Graphics Proceedings, Annual Conference Series, 1994 (ACM SIGGRAPH ’94 Proceedings), pages 435–442, 1994.
M. Stamminger, H. Schirmacher, P. Slusallek, and H.-P. Seidel. Getting rid of links in hierarchical radiosity. Computer Graphics Journal (Proc. Eurographics ’98), 17(3):C165–C174, Sept. 1998.
A. Willmott and P. Heckbert. An empirical comparison of progressive and wavelet radiosity. In J. Dorsey and P. Slusallek, editors, Rendering Techniques ’97 (Proceedings of the Eighth Eurographics Workshop on Rendering), pages 175–186, New York, NY, 1997. Springer Wien. ISBN 3–211–83001–4.
A. Willmott, P. Heckbert, and M. Garland. Face cluster radiosity. In Rendering Techniques ’99, pages 293–304, New York, NY, 1999. Springer Wien.
C. Winkler. Expérimentation d’algorithmes de calcul de radiosité à base d’ondelettes. Thèse d’université, Institut National Polytechnique de Lorraine, 1998.
Author information
Authors and Affiliations
Consortia
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Wien
About this paper
Cite this paper
Holzschuch, N., Cuny, F., Alonso, L., LORIA. (2000). Wavelet Radiosity on Arbitrary Planar Surfaces. In: Péroche, B., Rushmeier, H. (eds) Rendering Techniques 2000. EGSR 2000. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6303-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6303-0_15
Published:
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83535-7
Online ISBN: 978-3-7091-6303-0
eBook Packages: Springer Book Archive