33 search results - page 4 / 7 » Geometric lower bounds for parametric matroid optimization |
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
VRCAI
2006
ACM
14 years 1 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
ICRA
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
ICCV
2009
IEEE
15 years 17 days ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...