Sciweavers

61 search results - page 5 / 13
» On the Number of Graphical Forest Partitions
Sort
View
DCC
2005
IEEE
14 years 7 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
EGH
2005
Springer
14 years 1 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
TOG
2010
134views more  TOG 2010»
13 years 2 months ago
Unbiased, adaptive stochastic sampling for rendering inhomogeneous participating media
Realistic rendering of participating media is one of the major subjects in computer graphics. Monte Carlo techniques are widely used for realistic rendering because they provide u...
Yonghao Yue, Kei Iwasaki, Bing-Yu Chen, Yoshinori ...
GRAPHITE
2006
ACM
14 years 1 months ago
Interactive landscape visualization using GPU ray casting
—This paper demonstrates the simple yet effective usage of height fields for interactive landscape visualizations using a ray casting approach implemented in the pixel shader of...
Stephan Mantler, Stefan Jeschke
GRAPHICSINTERFACE
2003
13 years 9 months ago
Texture Partitioning and Packing for Accelerating Texture-based Volume Rendering
To apply empty space skipping in texture-based volume rendering, we partition the texture space with a box-growing algorithm. Each sub-texture comprises of neighboring voxels with...
Wei Li 0004, Arie E. Kaufman