Untangling polygons and graphs

DOI10.1007/S00454-009-9150-XMaRDI QIDQ848672zbMATH OpenOpenAlexFDO

Authors 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

polygonsplanaritygraph drawingstraight-line drawinguntangling

Mathematics Subject Classification ID

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

Recommendations

• Untangling polygons and graphs
• A polynomial bound for untangling geometric planar graphs
• Untangling a planar graph
• Untangling a Planar Graph
• Upper Bound Constructions for Untangling Planar Geometric Graphs

Cites work

• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• A polynomial bound for untangling geometric planar graphs
• Bemerkungen zum Vierfarbenproblem
• Convex Maps
• On collinear sets in straight-line drawings
• On the obfuscation complexity of planar graphs
• Trees in Polyhedral Graphs
• Untangling a planar graph
• Untangling a polygon
• Untangling planar graphs from a specified vertex position-Hard cases

Cited in

(18)

• Untangling planar graphs from a specified vertex position-Hard cases
• Untangling a Planar Graph
• The utility of untangling
• Unravelling tangled graphs
• Drawing planar graphs with many collinear vertices
• A polynomial bound for untangling geometric planar graphs
• The utility of untangling
• On collinear sets in straight-line drawings
• Untangling a polygon
• Upper bound constructions for untangling planar geometric graphs
• Untangling a planar graph
• Untangling polygons and graphs
• Upper Bound Constructions for Untangling Planar Geometric Graphs
• scientific article; zbMATH DE number 2084274 (Why is no real title available?)
• Dual circumference and collinear sets
• Dual circumference and collinear sets
• Connecting polygonizations via stretches and twangs
• Untangling circular drawings: algorithms and complexity

This page was built for publication: Untangling polygons and graphs

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