Abstract
Good methods for random placing a point set on a plane are needed in many fields - object placement in interactive games and simulations, stippling and halftoning in printing technologies or sampling in Monte-Carlo integration. Usual requirements include random look of a sample set with minimal apparent regularity, on the other hand samples should cover the domain evenly (fulfilling constant or arbitrary PDF).
We will present some popular sampling algorithms together with their assesment. A couple of usual methods for measuring sampling quality (discrepancy, spectral analysis) will be discussed as well.