Sciweavers

665 search results - page 17 / 133
» Algorithms for Triangulated Terrains
Sort
View
CPHYSICS
2004
93views more  CPHYSICS 2004»
13 years 7 months ago
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
Gernot Schaller, Michael Meyer-Hermann
ICRA
2006
IEEE
87views Robotics» more  ICRA 2006»
14 years 1 months ago
Learning to Predict Slip for Ground Robots
— In this paper we predict the amount of slip an exploration rover would experience using stereo imagery by learning from previous examples of traversing similar terrain. To do t...
Anelia Angelova, Larry Matthies, Daniel M. Helmick...
IROS
2006
IEEE
112views Robotics» more  IROS 2006»
14 years 1 months ago
Pose and Motion from Omnidirectional Optical Flow and a Digital Terrain Map
— An algorithm for pose and motion estimation using corresponding features in omnidirectional images and a digital terrain map is proposed. In previous paper, such algorithm for ...
Ronen Lerner, Oleg Kupervasser, Ehud Rivlin
IROS
2007
IEEE
99views Robotics» more  IROS 2007»
14 years 1 months ago
Robot coverage of terrain with non-uniform traversability
— In this paper, we study how multiple robots can cover known terrain quickly. We extend Multi-Robot Forest Coverage, a state-of-the-art multi-robot coverage algorithm, from terr...
Xiaoming Zheng, Sven Koenig
CCCG
2006
13 years 8 months ago
Shortest Descending Paths through Given Faces
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw