895 search results - page 138 / 179 » Approximate convex decomposition |
101
click to vote
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
82
Voted
LCN
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper, we describe a novel localization method for ad hoc wireless sensor networks. Accurate selforganization and localization is an essential characteristic of high pe...
120
Voted
PAMI
2002
14 years 9 months ago
2002
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
SIAMJO
2002
14 years 9 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...