Untangling a polygon

DOI10.1007/S00454-002-2889-YMaRDI QIDQ1864117zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2084274
• Untangling polygons and graphs
• Untangling polygons and graphs
• Pulling the straps of polygons
• Disentangling a triangle
• A Polygon Problem
• Untangling planar curves
• Untangling planar curves
• scientific article; zbMATH DE number 1424299
• Tresses of polygons

Cited in

(17)

• A Polynomial Bound for Untangling Geometric Planar Graphs
• Untangling planar graphs from a specified vertex position-Hard cases
• Drawing planar graphs with many collinear vertices
• Untangling polygons and graphs
• The problem of polygons with hidden vertices
• On the obfuscation complexity of planar graphs
• Any monotone function is realized by interlocked polygons
• A polynomial bound for untangling geometric planar graphs
• On collinear sets in straight-line drawings
• Untangling a planar graph
• Untangling polygons and graphs
• Upper Bound Constructions for Untangling Planar Geometric Graphs
• The Number of Flips Required to Obtain Non-crossing Convex Cycles
• scientific article; zbMATH DE number 2084274 (Why is no real title available?)
• Dual circumference and collinear sets
• Dual circumference and collinear sets
• Untangling circular drawings: algorithms and complexity

This page was built for publication: Untangling a polygon

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