Search
Now showing items 681-688 of 688
Wrinkle Meshes
(The Eurographics Association, 2010)
We present a simple and fast method to add wrinkles to dynamic meshes such as simulated cloth or the skin of an animated character. To get the desired surface details, we attach a higher resolution wrinkle mesh to the ...
Fast Local and Global Similarity Searches in Large Motion Capture Databases
(The Eurographics Association, 2010)
Fast searching of content in large motion databases is essential for efficient motion analysis and synthesis. In this work we demonstrate that identifying locally similar regions in human motion data can be practical even ...
Real-time Simulation of Large Bodies of Water with Small Scale Details
(The Eurographics Association, 2010)
We present a hybrid water simulation method that combines grid based and particles based approaches. Our specialized shallow water solver can handle arbitrary underlying terrain slopes, arbitrary water depth and supports ...
Edge-Avoiding À-TrousWavelet Transform for fast Global Illumination Filtering
(The Eurographics Association, 2010)
We present a fast and simple filtering method designed for ray traced Monte Carlo global illumination images which achieves real-time rates. Even on modern hardware only few samples can be traced for interactive applications, ...
Texture Compression of Light Maps using Smooth Profile Functions
(The Eurographics Association, 2010)
Light maps have long been a popular technique for visually rich real-time rendering in games. They typically contain smooth color gradients which current low bit rate texture compression techniques, such as DXT1 and ETC2, ...
GPU Random Numbers via the Tiny Encryption Algorithm
(The Eurographics Association, 2010)
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) are expected to cater general purpose and ...
A Work-Efficient GPU Algorithm for Level Set Segmentation
(The Eurographics Association, 2010)
We present a novel GPU level set segmentation algorithm that is both work-efficient and step-efficient. Our algorithm: (1) has linear work-complexity and logarithmic step-complexity, both of which depend only on the size ...
Smart Query Definition for Content-Based Search in Large Sets of Graphs
(The Eurographics Association, 2010)
Graphs are used in various application areas such as chemical, social or shareholder network analysis. Finding relevant graphs in large graph databases is thereby an important problem. Such search starts with the definition ...