Lower bounds on moving a ladder in two and three dimensions
暂无分享,去创建一个
[1] Yan Ke,et al. Moving a ladder in three dimensions: upper and lower bounds , 1987, SCG '87.
[2] Micha Sharir,et al. A new efficient motion-planning algorithm for a rod in polygonal space , 1986, SCG '86.
[3] Raimund Seidel,et al. Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..
[4] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[5] Micha Sharir,et al. An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.
[6] John Canny,et al. The complexity of robot motion planning , 1988 .
[7] Micha Sharir,et al. Retraction: A new approach to motion-planning , 1983, STOC.
[8] Raimund Seidel,et al. Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[9] J. Schwartz,et al. On the Piano Movers''Problem V: The Case of a Rod Moving in Three-Dimensional Space amidst Polyhedra , 1984 .