Lower Bounds for Shortest Path and Related ProblemsJohn

@inproceedings{Canny1987LowerBF,
  title={Lower Bounds for Shortest Path and Related ProblemsJohn},
  author={John F. Canny and John Reif},
  year={1987}
}

• John F. Canny, John Reif
• Published 1987

We present the rst lower bounds for shortest path problems (including euclidean shortest path) in three dimensions, and for some constrained motion planning problems in two and three dimensions. Our proofs are based a technique called free path encoding and use homotopy equivalence classes of paths to encode state. We rst apply the method to the shortest path problem in three dimensions. The problem is to nd the shortest path under an L metric (e.g. a euclidean metric) between two points amid… CONTINUE READING

Save

Create Alert

Cite

View Paper