Moving Vertices to Make Drawings Plane

DOI10.1007/978-3-540-77537-9_13MaRDI QIDQ5452215zbMATH OpenOpenAlexFDO

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

Recommendations

• Untangling a Planar Graph
• Untangling a planar graph
• On the obfuscation complexity of planar graphs
• scientific article; zbMATH DE number 1500681
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

Cited in

(7)

• A polynomial bound for untangling geometric planar graphs
• Untangling a Planar Graph
• Pushing vertices and orienting edges
• Untangling a planar graph
• Geometry and generation of a new graph planarity game
• On the obfuscation complexity of planar graphs
• Untangling planar graphs from a specified vertex position-Hard cases

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452215)