The following pages link to Untangling a polygon (Q1864117):
Displaying 17 items.
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Any monotone function is realized by interlocked polygons (Q1736502) (← links)
- The problem of polygons with hidden vertices (Q1875916) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- Dual circumference and collinear sets (Q2679595) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
- On Collinear Sets in Straight-Line Drawings (Q3104785) (← links)
- Upper Bound Constructions for Untangling Planar Geometric Graphs (Q3223962) (← links)
- (Q5088959) (← links)
- Untangling polygons and graphs (Q5301008) (← links)
- A Polynomial Bound for Untangling Geometric Planar Graphs (Q5301009) (← links)
- The Number of Flips Required to Obtain Non-crossing Convex Cycles (Q5302750) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)