Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
— This paper proposes a new tracking algorithm within a 3D-SLAM framework that takes segmented range images as observations. The framework has two layers: the local layer tracks ...
Peter Kohlhepp, Georg Bretthauer, Marcus Walther, ...
In this paper we analyze an algorithm which solves the point projection and the "inversion" problems for parametric curves and surfaces. It consists of a geometric secon...
This paper presents a novel approach for estimating the shortest
Euclidean distance from a given point to the corresponding
implicit quadric fitting surface. It first estimates t...