Before revision: We present a deterministic algorithm that computes\tilde \tilde  the diameter of a directed planar graph with real arc lengths in O(n^{5/3}) time.
After revision: We present a deterministic algorithm that computes\tilde \tilde O(b) time. We use this construction to compute the diameter of a directed planar graph with real arc lengths in O(n^{5/3}) time.