108 search results - page 4 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
ALENEX
2003
13 years 9 months ago
2003
SLS
2009
Springer
14 years 2 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...