Shortest path amidst disc obstacles is computable

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 116-125

  Chang, Ee Chien ^a   Choi, Sung Woo ^b   Kwon, DoYong ^c   Park, Hyungju ^c   Yap, Chee K ^d,e,f  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Duksung Women's University   (South Korea)

^c Korea Institute for Advanced Study   (South Korea)

^d NEW YORK UNIVERSITY   (United States)

^e Seoul National University   (South Korea)

^f NEW YORK UNIVERSITY   (United States)

Author keywords

Disc obstacles; Exact geometric computation; Exponential complexity; Guaranteed precision computation; Real RAM model; Robust numerical algorithms; Shortest path

Indexed keywords

CALCULATIONS; COMBINATORIAL MATHEMATICS; NUMERICAL ANALYSIS; PROBLEM SOLVING;

DISC OBSTACLES; EXACT GEOMETRIC COMPUTATION; EXPONENTIAL COMPLEXITY; GUARANTEED PRECISION COMPUTATION; REAL RAM MODEL; ROBUST NUMERICAL ALGORITHMS; SHORTEST PATH;

COMPUTATIONAL GEOMETRY;

EID: 33244462625     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064112     Document Type: Conference Paper

References (22)

1. A. Baker. Transcendental Number Theory. Cambridge University Press, 1979.
2. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, New York, 1997.
3. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. Exact geometric computation made easy. In Proc. 15th ACM Symp. Comp. Geom., pages 341-450, New York, 1999. ACM Press.
4. J. H. Conway, C. Radin, and L. Sadun. On angles whose squared trigonometric functions are rational. Discrete and Computational Geometry, 22:321-332, 1999.
5. Z. Du, M. Eleftheriou, J. Moreira, and C. Yap. Hypergeometric functions in exact geometric computation. In V.Brattka, M.Schoeder, and K.Weihrauch, editors, Proc. 5th Workshop on Computability and Complexity in Analysis, pages 55-66, 2002. Malaga, Spain, July 12-13, 2002.
6. In Electronic Notes in Theoretical Computer Science, 66:1 (2002), www.elsevier.nl/locate/entcs/volume66.html.
7. Z. Du and C. Yap. Absolute approximation of the general hypergeometric function, Mar. 2005. Preprint: abs-approx.ps.gz from ftp://cs.nyu.edu/pub/local/ yap/exact/.
8. A. Fabri, E. Fogel, B. Gärtner, M. Hoffmann, L. Kettner, S. Pion, M. Teillaud, R. Veltkamp, and M. Yvinec. The CGAL manual. 2003. Release 3.0.
9. N. Fel'dman and Y. V. Nesterenko. Number Theory IV: Transcendental Numbers, volume 44 of Encycolpaedia of Mathematical Sciences. Springer-Verlag, Berlin, 1998. Translated from Russian by N. Koblitz.
10. J. Jahnel. When does the (co)sine of a rational angle give a rational number?, 2004. From wvw.uni-math.gwdg.de/jahnel/linkstopaperse.html.
11. V. Karamcheti, C. Li, I. Pechtchanski, and C. Yap. A Core library for robust numerical and geometric libraries. In 15th ACM Symp. Computational Geometry, pages 351-359, 1999.
12. D. Kincaid and W. Cheney. Numerical Analysis: Mathematics of Scientific Computing. Brooks/Cole, 3rd edition, 2002.
13. S. Lang. Introduction to Transcendental Numbers. Addison-Wesley, Reading, Massachusetts, 1996.
14. K. Mehlhorn and S. Schirra. Exact computation with leda_real - theory and geometric application. In G. Alefeld, J. Rohn, S. Rump, and T. Yamamoto, editors, Symbolic Algebraic Methods and Verification Methods, volume 379, pages 163-172, Vienna, 2001. Springer-Verlag.
15. D. Richardson. How to recognize zero. J. of Symbolic Computation, 24:627-645, 1997.
16. D. Richardson and A. El-Sonbaty. Counterexamples to the uniformity conjecture. Comput. Geometry: Theory and Appl., 2004. Special Issue on Robust Geometric Algorithms and its Implementations, Eds. C. Yap and S. Pion. To appear.
17. M. Waldschmidt. Transcendence measures for exponentials and logarithms. J. Austral. Math. Soc. Ser. A, 25(4):445-465, 1978.
18. M. Waldschmidt. A lower bound for linear forms in logarithms. Acta Arith., 37:257-283, 1980.
19. K. Weihrauch. Computable Analysis. Springer, Berlin, 2000.
20. C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, 2000.
21. C. K. Yap. On guaranteed accuracy computation. In F. Chen and D. Wang, editors, Geometric Computation, chapter 12, pages 322-373. World Scientific Publishing Co., Singapore, 2004.
22. C. K. Yap. Robust geometric computation. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 41, pages 927-952. Chapmen & Hall/CRC, Boca Raton, FL, 2nd edition, 2004. Expanded from 1997 version.