164 search results - page 16 / 33 » Adaptive Algorithms for Planar Convex Hull Problems |
SIAMCOMP
2008
13 years 7 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
MVA
2000
13 years 9 months ago
2000
Previous works on range image segmentation concentrate on surface patches that can be well represented by certain mathematical functions. In this paper we consider the more qualit...
CGF
2006
13 years 7 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
NIPS
2004
13 years 9 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we propose a new approach for computing force-closure grasps of two-dimensional and threedimensional objects. Assuming n hard-finger contact with Coulomb fricti...