235 search results - page 16 / 47 » The Complexity of Separating Points in the Plane |
80
Voted
CGF
2005
14 years 9 months ago
2005
We present a novel algorithm for rendering physically-based soft shadows in complex scenes. Instead of casting shadow rays, we place both the points to be shaded and the samples o...
78
Voted
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
SIGGRAPH
2010
ACM
15 years 2 months ago
2010
ACM
We present an efficient technique to render single scattering in large scenes with reflective and refractive objects and homogeneous participating media. Efficiency is obtained...
CAIP
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we studied the geometry of a three-dimensional tableau from a single realist painting – Scott Fraser’s Three way vanitas (2006). The tableau contains a carefully ...
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...