Sciweavers

249 search results - page 46 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
14 years 1 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
COMPGEOM
2010
ACM
14 years 25 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
SIGGRAPH
1993
ACM
13 years 11 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
CORR
2011
Springer
223views Education» more  CORR 2011»
13 years 2 months ago
Decentralized Formation Control Part I: Geometric Aspects
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
Mohamed-Ali Belabbas
SCALESPACE
2009
Springer
14 years 2 months ago
A Multi-scale Feature Based Optic Flow Method for 3D Cardiac Motion Estimation
Abstract. The dynamic behavior of the cardiac muscle is strongly dependent on heart diseases. Optic flow techniques are essential tools to assess and quantify the contraction of t...
Alessandro Becciu, Hans C. van Assen, Luc Florack,...