Untangling a polygon

DOI10.1007/s00454-002-2889-yzbMath1011.68148OpenAlexW2758789266MaRDI QIDQ1864117

János Pach, Gábor Tardos

Publication date: 17 March 2003

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

Full work available at URL: https://doi.org/10.1007/s00454-002-2889-y

zbMATH Keywords

untangled polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (15)

A Polynomial Bound for Untangling Geometric Planar Graphs ⋮ Untangling polygons and graphs ⋮ The Number of Flips Required to Obtain Non-crossing Convex Cycles ⋮ 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 ⋮ On the obfuscation complexity of planar graphs ⋮ Untangling planar graphs from a specified vertex position-Hard cases ⋮ Untangling polygons and graphs ⋮ Every collinear set in a planar graph is free ⋮ Unnamed Item ⋮ On Collinear Sets in Straight-Line Drawings ⋮ A polynomial bound for untangling geometric planar graphs ⋮ Untangling a planar graph

This page was built for publication: Untangling a polygon