Title: An O(n log n) algorithm for the maximal planar subgraph problem