论文信息 - Approximate Euclidean shortest path in 3-space

Approximate Euclidean shortest path in 3-space

Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. As this problem is NP-hard, his approach represents an important step towards practical algorithms. Unfortunately, there are non-trivial gaps in the original description. Besides giving a complete treatment, we also give an alternative to his subdivision method which has some nice properties. Among the tools needed are root-separation bounds and non-trivial applications of Brent's complexity bounds on evaluation of elementary functions using floating point numbers.

[1] Leonidas J. Guibas,et al. Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms , 1988, ICALP.

[2] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] V. Pan. Sequential and parallel complexity of approximate evaluation of polynomial zeros , 1987 .

[5] Subhash Suri,et al. Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[6] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7] Richard P. Brent,et al. Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[8] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.

[9] L. M. MILNE-THOMSON,et al. Vector and Tensor Analysis , 1949, Nature.