Untangling polygons and graphs

DOI10.1007/s00454-009-9150-xzbMath1213.05051OpenAlexW2014466831MaRDI QIDQ848672

Josef Cibulka

Publication date: 4 March 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9150-x

zbMATH Keywords

planaritygraph drawingpolygonsstraight-line drawinguntangling

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Upper Bound Constructions for Untangling Planar Geometric Graphs ⋮ Dual circumference and collinear sets ⋮ Untangling circular drawings: algorithms and complexity ⋮ Drawing Planar Graphs with Many Collinear Vertices ⋮ Untangling planar graphs from a specified vertex position-Hard cases ⋮ Every collinear set in a planar graph is free ⋮ Unnamed Item ⋮ On Collinear Sets in Straight-Line Drawings

Cites Work

• Unnamed Item
• Untangling planar graphs from a specified vertex position-Hard cases
• On the obfuscation complexity of planar graphs
• A polynomial bound for untangling geometric planar graphs
• Untangling a planar graph
• Untangling a polygon
• Bemerkungen zum Vierfarbenproblem
• On Collinear Sets in Straight-Line Drawings
• Trees in Polyhedral Graphs
• Convex Maps

This page was built for publication: Untangling polygons and graphs