论文信息 - Computing the discrepancy - 字舞流文

Computing the discrepancy

We develop algorithms for computing the discrepancy of point sets in various Euclidean range spaces.

David Eppstein | David P. Dobkin

[1] Tony Warnock,et al. Computational investigations of low-discrepancy point-sets. , 1972 .

[2] David P. Dobkin,et al. Random-edge discrepancy of supersampling patterns , 1993 .

[3] W. Schmidt. On irregularities of distribution vii , 1972 .

[4] J. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[5] Roman Kuchkuda,et al. An introduction to ray tracing , 1993, Comput. Graph..

[6] William W. L. Chen. On irregularities of distribution. , 1980 .

[7] Mark H. Overmars,et al. New upper bounds in Klee's measure problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[8] James T. Kajiya,et al. The rendering equation , 1986, SIGGRAPH.

[9] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[10] Subhash Suri,et al. Offline maintenance of planar configurations , 1991, SODA '91.

[11] Robert L. Cook,et al. Distributed ray tracing , 1984, SIGGRAPH.

[12] Harald Niederreiter,et al. Methods for Estimating Discrepancy , 1972 .

[13] Leonidas J. Guibas,et al. Topologically sweeping an arrangement , 1986, STOC '86.