Abstract
The quality parameter t of (t,m,s)-nets controls extensive stratification properties of the generated sample points. However, the definition allows for points that are arbitrarily close across strata boundaries. We continue the investigation of (t,m,s)-nets under the constraint of maximizing the mutual distance of the points on the unit torus and present two new constructions along with algorithms. The first approach is based on the fact that reordering (t,s)-sequences can result in (t,m,s+1)-nets with varying toroidal distance, while the second algorithm generates points by permutations instead of matrices.
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
Cook, R., Carpenter, L., Catmull, E.: The Reyes image rendering architecture. SIGGRAPH Computer Graphics 21(4), 95–102 (1987)
Dammertz, S., Keller, A.: Image synthesis by rank-1 lattices. In: A. Keller, S. Heinrich, H. Niederreiter (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 217–236. Springer (2008)
Faure, H.: Discrépance de suites associées à un système de numération (en dimension s). Acta Arithmetica 41(4), 337–351 (1982)
Faure, H.: Discrepancy and diaphony of digital (0,1)-sequences in prime base. Acta Arithmetica 117, 125–148 (2005)
Faure, H., Tezuka, S.: Another random scrambling of digital (t,s)-sequences. In: K. Fang, F. Hickernell, H. Niederreiter (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 242–256, Springer-Verlag, Berlin (2002)
Grünschloß, L., Hanika, J., Schwede, R., Keller, A.: (t,m,s)-nets and maximized minimum distance. In: A. Keller, S. Heinrich, H. Niederreiter (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 397–412. Springer (2008)
Hofer, R., Larcher, G.: On existence and discrepancy of certain digital Niederreiter-Halton sequences (2009). To appear in Acta Arithmetica
Keller, A.: Myths of computer graphics. In: H. Niederreiter (ed.) Monte Carlo and Quasi-Monte Carlo Methods 2004, pp. 217–243. Springer (2006)
Kollig, T., Keller, A.: Efficient multidimensional sampling. Computer Graphics Forum 21(3), 557–563 (2002)
Larcher, G., Pillichshammer, F.: Walsh series analysis of the L 2-discrepancy of symmetrisized point sets. Monatsheft Mathematik 132, 1–18 (2001)
Larcher, G., Pillichshammer, F.: Sums of distances to the nearest integer and the discrepancy of digital nets. Acta Arithmetica 106, 379–408 (2003)
Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia (1992)
Pharr, M., Humphreys, G.: Physically Based Rendering: From Theory to Implementation, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2004)
Sedgewick, R.: Permutation generation methods. ACM Computing Surveys 9(2), 137–164 (1977)
Sobol’, I.: On the distribution of points in a cube and the approximate evaluation of integrals. Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki 7(4), 784–802 (1967)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grünschloß, L., Keller, A. (2009). (t,m,s)-Nets and Maximized Minimum Distance, Part II. In: L' Ecuyer, P., Owen, A. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04107-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-04107-5_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04106-8
Online ISBN: 978-3-642-04107-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)