3946 search results - page 519 / 790 » The computational complexity of choice sets |
154
click to vote
COMPGEOM
2004
ACM
16 years 4 days ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
181
click to vote
PERCOM
2003
ACM
15 years 12 months ago
2003
ACM
The paper describes research that has been carried out in “extrovert-Gadgets”, a research project funded in the context of EU IST/FET proactive initiative “Disappearing Comp...
148
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
177
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
174
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
We show how to greatly accelerate self-collision detection (SCD) for reduced deformable models. Given a triangle mesh and a set of deformation modes, our method precomputes Subspa...