Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are defined via quadrature over the unit triangle. Quasi-Monte Carlo methods for the triangle have been developed by Pillards and Cools [J. Comput. Appl. Math., 174 (2005), pp. 29--42] and by Brandolini et al. [``A Koksma--Hlawka inequality for simplices,” in Trends in Harmonic Analysis, Springer, 2013, pp. 33--46]. This paper presents two quasi-Monte Carlo constructions in the triangle with a vanishing discrepancy. The first is a version of the van der Corput sequence customized to the unit triangle. It is an extensible digital construction that attains a discrepancy below $12/{\sqrt{N}}$. The second construction rotates an integer lattice through an angle whose tangent is a quadratic irrational number. It attains a discrepancy of $O(\log(N)/N),$ which is the best possible rate. Previous work strongly indicated that such a discrepancy was possible, but no constructions were available. S...
Low Discrepancy Constructions in the Triangle
Published 2014 in SIAM Journal on Numerical Analysis
ABSTRACT
PUBLICATION RECORD
- Publication year
2014
- Venue
SIAM Journal on Numerical Analysis
- Publication date
2014-03-11
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-18 of 18 references · Page 1 of 1
CITED BY
Showing 1-28 of 28 citing papers · Page 1 of 1