We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
We define strong r-similarity and the morphing distance to bound geometric distortions between shapes of equal topology. We then derive a necessary and sufficient condition for a ...
This paper describes the geometrical limitations of algorithms for 3D reconstruction which use corresponding line tokens. In addition to announcing a description of the general cri...
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...