A tight lower bound for the complexity of path-planning for a disc

This publication has 5 references indexed in Scilit:

• Constructing the visibility graph for n-line segments in O(n2) time
  Information Processing Letters, 1985
• A “retraction” method for planning the motion of a disc
  Journal of Algorithms, 1985
• Movement Problems for 2-Dimensional Linkages
  SIAM Journal on Computing, 1984
• Strong np-hardness of moving many discs
  Information Processing Letters, 1984
• On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
  Advances in Applied Mathematics, 1983