1728 search results - page 15 / 346 » The Accelerated Euclidean Algorithm |
111
click to vote
SIAMCOMP
2008
14 years 11 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
100
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
92
Voted
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
86
Voted
ICCV
1999
IEEE
16 years 1 months ago
1999
IEEE
The necessary and sufficient conditions for being able to estimate scene structure, motion and camera calibration from a sequence of images are very rarely satisfied in practice. ...
WADS
2007
Springer
15 years 5 months ago
2007
Springer
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...