Precision-sensitive Euclidean shortest path in 3-space

SIAM Journal on Computing

Volumn 29, Issue 5, 2000, Pages 1577-1595

  Sellen, Jürgen ^a   Choi, Joonsoo ^b   Yap, Chee Keng ^c  

^a ESG ELEKTRONIKSYSTEM UND LOGISTIK GMBH   (Germany)

^b Kookmin University   (South Korea)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERROR ANALYSIS; OPTIMIZATION; POLYNOMIALS; SENSITIVITY ANALYSIS;

EUCLIDEAN SHORTEST PATH PROBLEM; PRECISION SENSITIVE ALGORITHMS;

ALGORITHMS;

EID: 0034538282     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798340205     Document Type: Article

References (16)

1. M. DE BERG, Efficient algorithms for ray shooting and hidden surface removal, Ph.D. thesis, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1992.
2. M. BERN, Hidden surface removal for rectangles, J. Comput. System Sci., 40 (1990), pp. 49-59.
3. J. BLÖMER, Computing sums of radicals in polynomial time, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1991, pp. 670-677.
4. J. BLÖMER, Simplifying Expressions Involving Radicals, Ph.D. thesis, Department of Mathematics, Free University, Berlin, Germany, 1992.
5. J.F. CANNY AND J. REIF, New lower bound techniques for robot motion planning problems, in Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1987, pp. 49-60.
6. J. CHOI, J. SELLEN, AND C.-K. YAP, Approximate Euclidean shortest path in 3-Space, in Proceedings of the 10th ACM Symposium on Computational Geometry, ACM, New York, 1994, pp. 41-48.
7. A.A. GOLDSTEIN, Constructive Real Analysis, Harper and Row, New York, 1967.
8. J. HERSHBERGER, S. SURI, Efficient computation of Euclidean shortest paths in the plane, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1993, pp. 508-517.
9. J. RENEGAR, On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Technical report, School of Operations Research Report, Cornell University, Ithaca, NY, 1989.
10. C.H. PAPADIMITRIOU, An algorithm for shortest-path motion in three dimensions, Inform. Process. Lett., 20 (1985), pp. 259-263.
11. C.H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
12. R.T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
13. M. SHARIR AND A. SCHORR, On shortest paths in polyhedral spaces, SIAM J. Comput., 15 (1986), pp. 193-215.
14. L.G. VALIANT AND V.V. VAZIRANI, NP is as easy as detecting unique solutions, Theoret. Comput. Sci., 47 (1986), pp. 85-93.
15. J.H. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, New York, 1965.
16. C.-K. YAP, Towards exact geometric computation, Comput. Geom., 7 (1997), pp. 3-23.