The following pages link to Untangling planar curves (Q1688858):
Displaying 21 items.
- Converting homotopies to isotopies and dividing homotopies in half in an effective way (Q484085) (← links)
- Bringing closed polygonal curves in the plane to normal form via local moves (Q722156) (← links)
- Determining the orientation of closed planar curves (Q920550) (← links)
- Making curves minimally crossing by Reidemeister moves (Q1369656) (← links)
- Coaxing a planar curve to comply (Q1602800) (← links)
- A combinatorial algorithm for immersed loops in surfaces (Q1851391) (← links)
- Untangling a polygon (Q1864117) (← links)
- Characterizing homotopy of systems of curves on a compact surface by crossing numbers (Q1899430) (← links)
- An algorithm for delta-wye reduction of almost-planar graphs (Q2197481) (← links)
- Structure and enumeration of \(K_4\)-minor-free links and link-diagrams (Q2198981) (← links)
- Measuring complexity of curves on surfaces (Q2290842) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- The unbearable hardness of unknotting (Q2656151) (← links)
- Combinatorial properties of self-overlapping curves and interior boundaries (Q2679598) (← links)
- Untangling Planar Curves (Q3132863) (← links)
- Complexity of geodesics on 2-dimensional ideal polyhedra and isotopies (Q4351113) (← links)
- Winding indexes of Max. and Min. Hamiltonians in N-Gons (Q4595250) (← links)
- Lower bounds for electrical reduction on surfaces (Q5088953) (← links)
- (Q5088981) (← links)
- A Markov Chain Sampler for Plane Curves (Q5094488) (← links)
- A Lagrangian filling for every cluster seed (Q6579147) (← links)
