Sampling with Hammersley and Halton Points
- 1 January 1997
- journal article
- research article
- Published by Taylor & Francis in Journal of Graphics Tools
- Vol. 2 (2) , 9-24
- https://doi.org/10.1080/10867651.1997.10487471
Abstract
The Hammersley and Halton point sets, two well-known, low discrepancy sequences, have been used for quasi-Monte Carlo integration in previous research. A deterministic formula generates a uniformly distributed and stochasticlooking sampling pattern at low computational cost. The Halton point set is also useful for incremental sampling. In this paper, we discuss detailed implementation issues and our experience of choosing suitable bases for the point sets, not just on the two-dimensional plane but also on a spherical surface. The sampling scheme is also applied to ray tracing, with a significant improvement in error over standard sampling techniques.Keywords
This publication has 12 references indexed in Scilit:
- Equidistribution on the SphereSIAM Journal on Scientific Computing, 1997
- Computing the discrepancy with applications to supersampling patternsACM Transactions on Graphics, 1996
- Faster Valuation of Financial DerivativesThe Journal of Portfolio Management, 1995
- Sampling Patterns Optimized for Uniform Distribution of EdgesPublished by Elsevier ,1995
- A Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity SettingPublished by Springer Nature ,1995
- Multi-Jittered SamplingPublished by Elsevier ,1994
- INTERVAL SAMPLINGPublished by Elsevier ,1991
- EFFICIENT GENERATION OF SAMPLING JITTER USING LOOK-UP TABLESPublished by Elsevier ,1990
- Distributed ray tracingACM SIGGRAPH Computer Graphics, 1984
- Algorithm 247: Radical-inverse quasi-random point sequenceCommunications of the ACM, 1964