Learn More
We present a new general-purpose method for optimizing existing point sets. The resulting distributions possess high-quality blue noise characteristics and adapt precisely to given density functions. Our method is similar to the commonly used Lloyd's method while avoiding its drawbacks. We achieve our results by utilizing the concept of capacity, which for(More)
In many applications today user interaction is moving away from mouse and pens and is becoming pervasive and much more physical and tangible. New emerging interaction technologies allow developing and experimenting with new interaction methods on the long way to providing intuitive human computer interaction. In this paper, we aim at recognizing gestures to(More)
In this article we revisit the problem of blue noise sampling with a strong focus on the spectral properties of the sampling patterns. Starting from the observation that oscillations in the power spectrum of a sampling pattern can cause aliasing artifacts in the resulting images, we synthesize two new types of blue noise patterns: <i>step blue noise</i>(More)
Efficient sampling often relies on irregular point sets that uniformly cover the sample space. We present a flexible and simple optimization strategy for such point sets. It is based on the idea of increasing the mutual distances by successively moving each point to the "farthest point," i.e., the location that has the maximum distance from the rest of the(More)
We investigate common pitfalls in the spectral analysis of point sets based on amplitude/power spectrum and radial statistics. We demonstrate the sensitivity of these measurements to the type of Fourier transform and formulate recommendations for crucial analysis and formatting parameters. Following these guidelines elevates comparability between different(More)
We investigate semi-stochastic tilings based on Wang or corner tiles for the real-time synthesis of example-based textures. In particular, we propose two new tiling approaches: (1) to replace stochastic tilings with pseudo-random tilings based on the Halton low-discrepancy sequence, and (2) to allow the controllable generation of tilings based on a(More)
(a) Path lines of 81672 molecules over 600 time steps (b) Grouped molecules for a single time step (c) LCCVD representatives for the groups in (b) (d) Path lines of the representatives for all time steps Figure 1: Showing all points of a large and time-dependent data set at once usually results in expensive (non-interactive) rendering, high storage(More)