Sciweavers

1390 search results - page 208 / 278
» Computing the depth of a flat
Sort
View
CGF
2008
200views more  CGF 2008»
14 years 10 months ago
Deep Opacity Maps
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...
Cem Yuksel, John Keyser
GIS
2006
ACM
14 years 9 months ago
B-Spline curve smoothing under position constraints for line generalisation
Currently, most of the operations performed for the construction of marine charts are still done manually. However, with the development of more and more powerful techniques, new ...
Eric Guilbert, Hui Lin 0002
JEI
2007
79views more  JEI 2007»
14 years 9 months ago
Stereo matching via selective multiple windows
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mih...
CGF
2004
93views more  CGF 2004»
14 years 9 months ago
Instant Volumetric Understanding with Order-Independent Volume Rendering
Rapid, visual understanding of volumetric datasets is a crucial outcome of a good volume rendering application, but few current volume rendering systems deliver this result. Our g...
Benjamin Mora, David S. Ebert
JCSS
1998
74views more  JCSS 1998»
14 years 9 months ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich