메뉴 건너뛰기




Volumn 3, Issue 1, 1988, Pages 197-217

Lower bounds on moving a ladder in two and three dimensions

Author keywords

[No Author keywords available]

Indexed keywords


EID: 34250092947     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/BF02187908     Document Type: Article
Times cited : (10)

References (12)
  • 1
    • 84936537617 scopus 로고    scopus 로고
    • J. Canny, The complexity of robot motion planning, Ph.D. Thesis, MIT, May 1987.
  • 3
    • 84936537616 scopus 로고    scopus 로고
    • Y. Ke and J. O'Rourke, Moving a ladder in three dimensions: upper and lower bounds, Proceedings of the Third Symposium on Computational Geometry, pp. 136–145, 1987.
  • 4
    • 84936537620 scopus 로고    scopus 로고
    • Y. Ke and J. O'Rourke, An algorithm for moving a ladder in three dimensions, Johns Hopkins Technical Report JHU/87-17, Sept. 1987.
  • 5
    • 84936537645 scopus 로고    scopus 로고
    • D. Leven and M. Sharir, An efficient and simple motion-planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers, Proceedings of the First Symposium on Computational Geometry, pp. 221–227, 1985.
  • 6
    • 84936537648 scopus 로고    scopus 로고
    • C. Ó'Dúnlaing, M. Sharir, and C. Yap, Retraction—a new approach to motion planning, Proceedings of the 15th ACM Symposium on Theory of Computing, pp. 207–220, 1983.
  • 8
    • 84936537642 scopus 로고    scopus 로고
    • J. O'Rourke, A lower bound on moving a ladder, Johns Hopkins Technical Report JHU/85-20, Nov. 1985.
  • 11
    • 84936537644 scopus 로고    scopus 로고
    • M. Sharir, Presentation at the First Symposium on Computational Geometry, Baltimore, June 1985.
  • 12
    • 84936537634 scopus 로고    scopus 로고
    • S. Sifrony and M. Sharir, A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space, Proceedings of the Second Symposium on Computational Geometry, pp. 178–186, 1986.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.