Name
Abstract | ||
|---|---|---|
Abstract We study the problem of shortest paths for a line segment in the plane. As a measure of the distance traversed by a path, we take the average curve length of the orbits of prescribed points on the line segment. This problem is nontrivial even in free space (i.e., in the absence of obstacles). We characterize all shortest paths of the line segment moving in free space under the measure d2, the average orbit length of the two endpoints. The problem of d2 optimal motion has been solved by Gurevich and also by Dubovitskij, who calls it Ulam’s problem. Unlike previous solutions, our basic tool is Cauchy’s surface-area formula. This new approach is relatively elementary, and yields new insights. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/BF01891839 | Algorithmica |
Keywords | Field | DocType |
Motion planning,Ulam's problem,Optimal motion,Cauchy's surface-area formula | Line segment,Average path length,Combinatorics,Shortest path problem,Arc length,Yen's algorithm,Distance from a point to a line,Line segment intersection,Mathematics,Euclidean shortest path | Journal |
Volume | Issue | ISSN |
10 | 2-4 | 0178-4617 |
Citations | PageRank | References |
5 | 0.84 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian Icking | 1 | 364 | 33.17 |
| Giinter Rote | 2 | 62 | 7.70 |
| E. Welzl | 3 | 3311 | 552.52 |
| Chee-keng Yap | 4 | 42 | 3.71 |