Untangling polygons and graphs
From MaRDI portal
Publication:848672
DOI10.1007/S00454-009-9150-XzbMATH Open1213.05051OpenAlexW2014466831MaRDI QIDQ848672FDOQ848672
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Untangling a planar graph
- Trees in Polyhedral Graphs
- Bemerkungen zum Vierfarbenproblem
- Convex Maps
- A polynomial bound for untangling geometric planar graphs
- Untangling a polygon
- On collinear sets in straight-line drawings
- Untangling planar graphs from a specified vertex position-Hard cases
- On the obfuscation complexity of planar graphs
Cited In (18)
- Untangling a Planar Graph
- The utility of untangling
- Untangling planar graphs from a specified vertex position-Hard cases
- 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
- Upper bound constructions for untangling planar geometric graphs
- Untangling a polygon
- Untangling a planar graph
- Untangling polygons and graphs
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- Title not available (Why is that?)
- 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)
