Parallel Monte Carlo Sampling Scheme for Sphere and Hemisphere
The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. Monte Carlo methods for solving the rendering equation use sampling of the solid angle subtended by unit hemisphere or unit sphere in order to perform the numerical integration of the rendering equation.
In this work we consider the problem for generation of uniformly distributed random samples over hemisphere and sphere. Our aim is to construct and study the parallel sampling scheme for hemisphere and sphere. First we apply the symmetry property for partitioning of hemisphere and sphere. The domain of solid angle subtended by a hemisphere is divided into a number of equal sub-domains. Each sub-domain represents solid angle subtended by orthogonal spherical triangle with fixed vertices and computable parameters. Then we introduce two new algorithms for sampling of orthogonal spherical triangles.
Both algorithms are based on a transformation of the unit square. Similarly to the Arvo’s algorithm for sampling of arbitrary spherical triangle the suggested algorithms accommodate the stratified sampling. We derive the necessary transformations for the algorithms. The first sampling algorithm generates a sample by mapping of the unit square onto orthogonal spherical triangle. The second algorithm directly compute the unit radius vector of a sampling point inside to the orthogonal spherical triangle. The sampling of total hemisphere and sphere is performed in parallel for all sub-domains simultaneously by using the symmetry property of partitioning. The applicability of the corresponding parallel sampling scheme for Monte Carlo and Quasi-Monte Carlo solving of rendering equation is discussed.
KeywordsSolid Angle Closed Domain Bulgarian Academy Global Illumination Spherical Triangle
Unable to display preview. Download preview PDF.
- 1.Arvo, J.: Stratifed sampling of spherical triangles. In: Computer Graphics Proceedings, Annual Conference Series, ACM Siggraph, pp. 437–438. ACM Press, New York (1995)Google Scholar
- 2.Dutré, P.: Global Illumination Compendium, Script of September 29 2003, http://www.cs.kuleuven.ac.be/~phil/GI/TotalCompendium.pdf
- 4.Keller, A.: Quasi-Monte Carlo Methods in Computer Graphics: The Global Illumination Problem. In: Lectures in Applied Mathematics, vol. 32, pp. 455–469 (1996)Google Scholar
- 5.Rogers, D.F.: Procedural Elements for Computer Graphics. McGraw-Hill, New York (1985)Google Scholar