Before revision:  Note that since every planar graph has at most O(n) faces, any further improvement of this result, will imply an improvement upon Rao's long standing upper bound.
After revision:  Note that since every planar graph has at most O(n) faces, any further improvement of this result, will be a major breakthrough, directly improving upon Rao's long standing upper bound.