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...
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...
— 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...
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...
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...