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...
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...
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, ...
— 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, ...
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...
Anders Brun, Carl-Fredrik Westin, Steven Haker, Ha...