Moving Vertices to Make Drawings Plane

DOI10.1007/978-3-540-77537-9_13zbMath1137.68490OpenAlexW2132748995MaRDI QIDQ5452215

Xavier Goaoc, Jan Kratochvíl, Chan-Su Shin, 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

On the obfuscation complexity of planar graphs ⋮ Untangling planar graphs from a specified vertex position-Hard cases ⋮ A polynomial bound for untangling geometric planar graphs ⋮ Untangling a planar graph

This page was built for publication: Moving Vertices to Make Drawings Plane