Sciweavers

18 search results - page 3 / 4
» Chasing Convex Bodies and Functions
Sort
View
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
13 years 9 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
DCG
2006
163views more  DCG 2006»
13 years 5 months ago
Isometry-Invariant Valuations on Hyperbolic Space
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
Daniel A. Klain
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
13 years 10 months ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 3 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 5 months ago
Motion Planning of Legged Robots
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...