Shortest Paths for Line Segments

Icking, Christian; Rote, Günter; Welzl, Emo; Yap, Chee

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 d₂, the average orbit length of the two endpoints. The problem of d₂ 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.

Vorschau

Zitieren

Zitierform:

Icking, Christian / Rote, Günter / Welzl, Emo / et al: Shortest Paths for Line Segments. Hagen 1992. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe