Sciweavers

215 search results - page 34 / 43
» Farthest-Polygon Voronoi Diagrams
Sort
View
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 7 months ago
Sublinear geometric algorithms
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...
Bernard Chazelle, Ding Liu, Avner Magen
IROS
2006
IEEE
185views Robotics» more  IROS 2006»
14 years 1 months ago
Log of the inverse of the Distance Transform and Fast Marching applied to Path Planning
— 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...
ICRA
2002
IEEE
176views Robotics» more  ICRA 2002»
14 years 15 days ago
Coverage Control for Mobile Sensing Networks
— 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...
Jorge Cortés, Sonia Martínez, Timur ...
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
14 years 1 days ago
Splitting a Delaunay Triangulation in Linear Time
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...
SMA
2006
ACM
120views Solid Modeling» more  SMA 2006»
14 years 1 months ago
Identifying flat and tubular regions of a shape by unstable manifolds
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...
Samrat Goswami, Tamal K. Dey, Chandrajit L. Bajaj