We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
— This paper presents a new Path Planning method based in the inverse of the Logarithm of the Distance Transform and in the Fast Marching Method. The Distance Transform of an ima...
Santiago Garrido, Luis Moreno, Dolores Blanco, Fer...
— This paper describes decentralized control laws for the coordination of multiple vehicles performing spatially distributed tasks. The control laws are based on a gradient desce...
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...
We present an algorithm to identify the flat and tubular regions of a three dimensional shape from its point sample. We consider the distance function to the input point cloud an...