Shortest path amidst disc obstacles is computable

Shortest path amidst disc obstacles is computable

Proceedings of the Annual Symposium on Computational Geometry

Saved in:
Bibliographic Details
Main Authors: Chang, E.-C., Choi, S.W., Kwon, D., Park, H., Yap, C.K.
Other Authors: COMPUTATIONAL SCIENCE
Published: 2013
Subjects:
Disc obstacles
Exact geometric computation
Exponential complexity
Guaranteed precision computation
Real RAM model
Robust numerical algorithms
Shortest path
Online Access:http://scholarbank.nus.edu.sg/handle/10635/40282
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore

Internet

http://scholarbank.nus.edu.sg/handle/10635/40282

Similar Items