A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We present an O(n^1.5)-space distance oracle for directed planar graphs that answers distance queries in O( n) time. Our oracle both significantly simplifies and significantly improves the recent oracle of Cohen-Addad, Dahlgaard and Wulff-Nilsen [FOCS 2017], which uses O(n^5/3)-space and answers queries in O( n) time. We achieve this by designing an elegant and efficient point location data structure for Voronoi diagrams on planar graphs. We further show a smooth tradeoff between space andarXiv:1708.01386v1 fatcat:226uixbxvjd3zeofowwtraj5au