Skip to Main content Skip to Navigation
Journal articles

Untangling a Planar Graph

Abstract : A straight-line drawing δ of a planar graph G need not be plane but can be made so by untangling it, that is, by moving some of the vertices of G. Let shift(G,δ) denote the minimum number of vertices that need to be moved to untangle δ. We show that shift(G,δ) is NP-hard to compute and to approximate. Our hardness results extend to a version of 1BendPointSetEmbeddability, a well-known graph-drawing problem. Further we define fix(G,δ)=n−shift(G,δ) to be the maximum number of vertices of a planar n-vertex graph G that can be fixed when untangling δ. We give an algorithm that fixes at least $\sqrt{((\log n)-1)/\log\log n}$ vertices when untangling a drawing of an n-vertex graph G. If G is outerplanar, the same algorithm fixes at least $\sqrt{n/2}$ vertices. On the other hand, we construct, for arbitrarily large n, an n-vertex planar graph G and a drawing δ G of G with $\ensuremath {\mathrm {fix}}(G,\delta_{G})\leq \sqrt{n-2}+1$ and an n-vertex outerplanar graph H and a drawing δ H of H with $\ensuremath {\mathrm {fix}}(H,\delta_{H})\leq2\sqrt{n-1}+1$ . Thus our algorithm is asymptotically worst-case optimal for outerplanar graphs.
Document type :
Journal articles
Complete list of metadata
Contributor : Xavier Goaoc Connect in order to contact the contributor
Submitted on : Thursday, November 12, 2009 - 11:16:05 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

Links full text




Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, et al.. Untangling a Planar Graph. Discrete and Computational Geometry, Springer Verlag, 2009, 42 (4), pp.542-569. ⟨10.1007/s00454-008-9130-6⟩. ⟨inria-00431408⟩



Record views