160 search results - page 9 / 32 » On Planar Supports for Hypergraphs |
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
ICRA
1994
IEEE
15 years 1 months ago
1994
IEEE
While most previous work in planning manipulation tasks relies on the assumption of quasi-static conditions, there can be situations where the quasi-static assumption may not hold...
66
Voted
IJRR
2002
14 years 9 months ago
2002
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...
68
Voted
CHI
2009
ACM
15 years 10 months ago
2009
ACM
Modern presentation software is still built around interaction metaphors adapted from traditional slide projectors. We provide an analysis of the problems in this application genr...