Infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been investigated as a device for Monte Carlo simulation. In this paper, we investigate the structure of shot noise series representations from a simulation point of view and discuss the effectiveness of quasi-Monte Carlo method...

The Hermite radial basis functions (HRBFs) implicits have been used to reconstruct surfaces from scattered Hermite data points. In this work, we propose a closed-form formulation to construct HRBF-based implicits by a quasi-solution approximating the exact solution. A scheme is developed to automatically adjust the support sizes of basis functions to hold the error bound of a quasi-solution. Ou...

The Hermite radial basis functions (HRBFs) implicits have been used to reconstruct surfaces from scattered Hermite data points. In this work, we propose a closed-form formulation to construct HRBF-based implicits by a quasi-solution approximating the exact solution. A scheme is developed to automatically adjust the support sizes of basis functions to hold the error bound of a quasi-solution. Ou...

This self-contained tutorial surveys the state of the art in quasi-Monte Carlo rendering algorithms as used for image synthesis in the product design and movie industry. Based on the number theoretic constructions of low discrepancy sequences, it explains techniques to generate light transport paths to connect cameras and light sources. Summing up their contributions on the image plane results ...

Quasi-random (also called low discrepancy) sequences are a deterministic alternative to random sequences for use in Monte Carlo methods, such as integration and particle simulations of transport processes. The error in uniformity for such a sequence of N points in the s-dimensional unit cube is measured by its discrepancy, which is of size (log N) N-Ifor large N, as opposed to discrepancy of si...

We demonstrate a one-to-one correspondence between idempotent closure operators and the so-called saturated quasi-uniform structures on category C. Not only this result allows to obtain categorical counterpart P of Császár-Pervin quasi-uniformity P, that we characterize as transitive compatible with an interior operator, but also permits describe those topogenous orders are induced by The P⁎ P−...

Two moving mesh partial differential equations (MMPDEs) with spatial smoothing are derived based upon the equidistribution principle. This smoothing technique is motivated by the robust moving mesh method of Dorfi and Drury [J. Comput. Phys., 69 (1987), pp. 175–195]. It is shown that under weak conditions the basic property of no node-crossing is preserved by the spatial smoothing, and a local ...

We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the incremental and self-avoiding tendencies of pseudo-random sequences, ii) the lattice structure provided by multiresolution grids, and iii) lowdiscrepancy and low-dispersion measures of uniformity provided by quasi-random sequ...

We consider planar systems driven by a central force which depends periodically on time. If the force is sublinear and attractive, then there is a connected set of subharmonic and quasi-periodic solutions rotating around the origin at different speeds; moreover, this connected set stretches from zero to infinity. The result still holds allowing the force to be attractive only in average provide...

Appendix A: Properties of EDS grids In this appendix, we characterize the dispersion of points, the number of points, and the degree of uniformity of the constructed EDS. Also, we discuss the relation of our results to recent mathematical literature. A.1 Dispersion of points in EDS grids We borrow the notion of dispersion from the literature on quasi-Monte Carlo optimization methods; see, for e...