Moving Vertices to Make Drawings Plane
From MaRDI portal
Publication:5452215
DOI10.1007/978-3-540-77537-9_13zbMath1137.68490MaRDI QIDQ5452215
Jan Kratochvíl, Chan-Su Shin, Xavier Goaoc, Yoshio Okamoto, Alexander Wolff
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_13
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
On the obfuscation complexity of planar graphs, A polynomial bound for untangling geometric planar graphs, Untangling a planar graph