Sciweavers

665 search results - page 8 / 133
» Algorithms for Triangulated Terrains
Sort
View
CCCG
2003
13 years 8 months ago
An algorithm for the MaxMin area triangulation of a convex polygon
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
J. Mark Keil, Tzvetalin S. Vassilev
TCS
2008
13 years 7 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...
IROS
2007
IEEE
121views Robotics» more  IROS 2007»
14 years 1 months ago
Quadrupedal running at high speed over uneven terrain
— High-speed legged locomotion is complicated by the challenge of uneven terrain because the system must respond to the fast-changing terrain elevation under each foot, and quick...
Luther R. Palmer, David E. Orin
ICRA
2002
IEEE
109views Robotics» more  ICRA 2002»
14 years 10 days ago
On-Line Terrain Parameter Estimation for Planetary Rovers
Future planetary exploration missions will require rovers to traverse very rough terrain with limited human supervision. Wheel-terrain interaction plays a critical role in rough-t...
Karl Iagnemma, Hassan Shibly, Steven Dubowsky
IPL
2008
111views more  IPL 2008»
13 years 6 months ago
Flying over a polyhedral terrain
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
Hamid Zarrabi-Zadeh