Sciweavers

1773 search results - page 154 / 355
» Depth from Diffusion
Sort
View
SPAA
2009
ACM
15 years 7 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
RT
1999
Springer
15 years 6 months ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
111
Voted
VISUALIZATION
1996
IEEE
15 years 6 months ago
Illustrating Transparent Surfaces with Curvature-Directed Strokes
Transparency can be a useful device for simultaneously depicting multiple superimposed layers of information in a single image. However, in computer-generated pictures -as in phot...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 4 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
GRAPHICSINTERFACE
2008
15 years 3 months ago
Layered variance shadow maps
Shadow maps are commonly used in real-time rendering, but they cannot be filtered linearly like standard color, resulting in severe aliasing. Variance shadow maps resolve this pro...
Andrew Lauritzen, Michael McCool