1523 search results - page 207 / 305 » The Computational Complexity of Linear Optics |
241
Voted
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper, we propose a novel type of explicit image filter - guided filter. Derived from a local linear model, the guided filter generates the filtering output b...
135
Voted
VISUALIZATION
2000
IEEE
15 years 8 months ago
2000
IEEE
We present two beneficial rendering extensions to the Projected Tetrahedra (PT) algorithm by Shirley and Tuchman. These extensions are compatible with any cell sorting technique,...
121
click to vote
SIGGRAPH
2010
ACM
15 years 7 months ago
2010
ACM
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
121
click to vote
CG
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
129
click to vote
DAM
2011
14 years 10 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...