Title: o(n Log N) Algorithm for the Maximal Planar Subgraph Problem