Assume that we have two perspective images with known intrinsic parameters except for an unknown common focal length. It is a minimally constrained problem to find the relative or...
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
— Motion planning for robots with many degrees of freedom (DoF) is a generally unsolved problem in the robotics context. In this work an approach for trajectory planning is prese...
Niko Vahrenkamp, Christian Scheurer, Tamim Asfour,...
Making virtual modeling as easy and intuitive as realclay manipulation is still an unsolved problem. This paper takes a step in this direction: in addition to offering standard fe...