1245 search results - page 64 / 249 » Triangulation for Points on Lines |
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
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...
129
click to vote
JODL
2006
14 years 9 months ago
2006
Recent advances in technology have made tremendous amount of multimedia information available to the general population. An efficient way of dealing with this new development is t...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...