Computer Graphics Forum · 2013 · 64 citations · 27 references
ComputingComputer ScienceComputational GeometryComputer VisionDigital ImagingGeometry ProcessingImage SynthesisMonte Carlo MethodsConvergence Rate AnalysisIntegration In Spherical FormSpherical ProjectionSpherical Topology
Abstract Quasi‐Monte Carlo (QMC) methods exhibit a faster convergence rate than that of classic Monte Carlo methods. This feature has made QMC prevalent in image synthesis, where it is frequently used for approximating the value of spherical integrals (e.g. illumination integral). The common approach for generating QMC sampling patterns for spherical integration is to resort to unit square low‐discrepancy sequences and map them to the hemisphere. However such an approach is suboptimal as these sequences do not account for the spherical topology and their discrepancy properties on the unit square are impaired by the spherical projection. In this paper we present a strategy for producing high‐quality QMC sampling patterns for spherical integration by resorting to spherical Fibonacci point sets. We show that these patterns, when applied to illumination integrals, are very simple to generate and consistently outperform existing approaches, both in terms of root mean square error (RMSE) and image quality. Furthermore, only a single pattern is required to produce an image, thanks to a scrambling scheme performed directly in the spherical domain.
27
Concrete Mathematics: A Foundation for Computer Science
Ronald Graham, Donald E. Knuth, Oren Patashnik et al. · Computers in Physics · 1989 · 2.5K citations
Concrete Mathematics: A Foundation for Computer Science.
Edward A. Bender, Ronald Graham, Donald E. Knuth et al. · American Mathematical Monthly · 1991 · 1.4K citations
Low-discrepancy and low-dispersion sequences
Harald Niederreiter · Journal of Number Theory · 1988 · 487 citations