— 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...
Abstract—This work presents a method for the registration of threedimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it thr...
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...
Eric Berberich, Efi Fogel, Dan Halperin, Michael K...