11 search results - page 1 / 3 » Constructing Approximate Shortest Path Maps in Three Dimensi... |
COMPGEOM
1998
ACM
13 years 8 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
COMPGEOM
1996
ACM
13 years 8 months ago
1996
ACM
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
ICRA
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper presents a new globally convergent rangesensor based navigation algorithm in three-dimensions, called 3DBug. The 3DBug algorithm navigates a point robot in a three-dime...