Sciweavers

44 search results - page 3 / 9
» Fast Approximate Quantitative Visibility for Complex Scenes
Sort
View
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 5 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CGF
2008
109views more  CGF 2008»
13 years 7 months ago
Occlusion Textures for Plausible Soft Shadows*
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
Elmar Eisemann, Xavier Décoret
TOG
2008
120views more  TOG 2008»
13 years 7 months ago
Real-time, all-frequency shadows in dynamic scenes
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
Thomas Annen, Zhao Dong, Tom Mertens, Philippe Bek...
SIBGRAPI
2006
IEEE
14 years 1 months ago
Plausible Image Based Soft Shadows Using Occlusion Textures
This paper presents a novel image-based approach to render plausible soft shadows for complex dynamic scenes with rectangular light sources. The algorithm's performance is mo...
Elmar Eisemann, Xavier Décoret
ICASSP
2011
IEEE
12 years 11 months ago
Fast single image fog removal using edge-preserving smoothing
Imaging in poor weather is often severely degraded by scattering due to suspended particles in the atmosphere such as haze and fog. In this paper, we propose a novel fast defoggin...
Jing Yu, Qingmin Liao