21 search results - page 1 / 5 » The Euclidean Orienteering Problem Revisited |
SIAMCOMP
2008
13 years 4 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...
AFPAC
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. In this paper we investigate the Lie model of Lie sphere geometry using Clifford algebra. We employ it to Euclidean geometric problems involving oriented contact to simpl...
DCG
2007
13 years 4 months ago
2007
The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, ...
ICRA
2009
IEEE
13 years 11 months ago
2009
IEEE
— We propose a learning algorithm for estimating the 3-D orientation of objects. Orientation learning is a difficult problem because the space of orientations is non-Euclidean, ...
ICIP
2005
IEEE
13 years 10 months ago
2005
IEEE
Averaging, filtering and interpolation of 3-D object orientation data is important in both computer vision and computer graphics, for instance to smooth estimates of object orien...