Shortest path AMIDST disc obstacles is computable

• Main Authors: Chang, E.-C., Choi, S.W., Kwon, D.Y., Park, H., Yap, C.K.
• Other Authors: COMPUTATIONAL SCIENCE
• Published: 2013
• Subjects: Computability; Disc obstacles; Exact geometric computation; Exponential complexity; Guaranteed precision computation; Real RAM model; Robust numerical algorithms; Shortest path; Transcendental number theory
• Online Access: http://scholarbank.nus.edu.sg/handle/10635/41131
• Institution: National University of Singapore

International Journal of Computational Geometry and Applications