Shortest Path in a Polygon using Sublinear Space [article]

Sariel Har-Peled
2015 arXiv   pre-print
]#1(#2) We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time. Specifically, given a simple polygon with n vertices in a read only memory, and additional working memory of size , the new algorithm computes the shortest path (in ) in O( n^2 / ) expected time. This requires several new tools, which we believe to be of independent interest.
arXiv:1412.0779v2 fatcat:3mlsshmuybbzhiypk2unsjbnou