TY - JOUR

T1 - A note on the papadimitriou-silverberg algorithm for planning optimal piecewise-linear motion of a ladder

AU - Sharir, Micha

N1 - Funding Information:
* Work on this paper has been supported by Office of Naval Research Grant NOOO14-87-K-0129, by National Science Foundation Grant DCR-83-20085. and by grants from the Digital Equipment Corporation, the IBM Corporation, the U.S.-Israeli Binational Science Foundation, the NCRD: the Israeli National Council for Research and Development, and the EMET Fund of the Israeli Academy’of Sciences.

PY - 1989/9/1

Y1 - 1989/9/1

N2 - We present an improvement of a recent algorithm by Papadimitriou and Silverberg for optimal motion planning for a ladder (1987). The improved algorithm runs in time O(n3α(n) log2n), where n is the number of obstacle edges and where α(n) is the extremely slowly growing inverse Ackermann function. This is an improvement by nearly θ(n) of the original algorithm of Papadimitriou and Silverberg.

AB - We present an improvement of a recent algorithm by Papadimitriou and Silverberg for optimal motion planning for a ladder (1987). The improved algorithm runs in time O(n3α(n) log2n), where n is the number of obstacle edges and where α(n) is the extremely slowly growing inverse Ackermann function. This is an improvement by nearly θ(n) of the original algorithm of Papadimitriou and Silverberg.

KW - Davenport-Schinzel sequences

KW - Motion planning

KW - arrangements of curves

KW - computational geometry

KW - faces and zones in arrangements

KW - shortest paths

UR - http://www.scopus.com/inward/record.url?scp=0024739121&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(89)90042-2

DO - 10.1016/0020-0190(89)90042-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0024739121

SN - 0020-0190

VL - 32

SP - 187

EP - 190

JO - Information Processing Letters

JF - Information Processing Letters

IS - 4

ER -