Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
We present an approach for editing shadows in all-frequency lighting environments. To support artistic control, we propose to decouple shadowing from lighting and focus on providi...
Juraj Obert, Fabio Pellacini, Sumanta N. Pattanaik
This state-of-the-art report focuses on real-time image correction techniques that enable projector-camera systems to display images onto screens that are not optimized for projec...
Oliver Bimber, Daisuke Iwai, Gordon Wetzstein, Ans...
In this paper a method for extraction of mid-level semantics from sign language videos is proposed, by employing high level domain knowledge. The semantics concern labeling of the ...
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...