Untangling planar curves
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5764874 (Why is no real title available?)
- scientific article; zbMATH DE number 53949 (Why is no real title available?)
- scientific article; zbMATH DE number 3509333 (Why is no real title available?)
- scientific article; zbMATH DE number 638756 (Why is no real title available?)
- scientific article; zbMATH DE number 732196 (Why is no real title available?)
- scientific article; zbMATH DE number 732197 (Why is no real title available?)
- scientific article; zbMATH DE number 1462935 (Why is no real title available?)
- scientific article; zbMATH DE number 3241109 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3321941 (Why is no real title available?)
- (1, 2) AND WEAK (1, 3) HOMOTOPIES ON KNOT PROJECTIONS
- A combinatorial algorithm for immersed loops in surfaces
- A fast planar partition algorithm. I
- A new approach to solving three combinatorial enumeration problems on planar graphs
- A polynomial upper bound on Reidemeister moves
- An optimal algorithm for intersecting line segments in the plane
- An upper bound on Reidemeister moves
- Applications of random sampling in computational geometry. II
- Complexity of plane and spherical curves
- Computational geometry. Algorithms and applications.
- Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
- Doodle groups
- Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
- Graph minors. X: Obstructions to tree-decomposition
- Incremental Voronoi diagrams
- Intersections of curves on surfaces
- Introduction to Vassiliev knot invariants
- Invariants of curves and fronts via Gauss diagrams
- Invariants of random knots and links
- Making curves minimally crossing by Reidemeister moves
- Minimal sequences of Reidemeister moves on diagrams of torus knots
- Minimal unknotting sequences of Reidemeister moves containing unmatched RII moves
- On minimal-node-cost planar embeddings
- On the delta-wye reduction for planar graphs
- Parabolic equations for curves on surfaces. II: Intersections, blow-up and generalized solutions
- Planar electric networks. II
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Quickly excluding a planar graph
- Shortening curves on surfaces
- Shortening embedded curves
- The Folded Ribbon Theorem. A Contribution to the Study of Immersed Circles
- The Use of Wye-Delta Transformations in Network Simplification
- Universality considerations in VLSI circuits
- Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
- Unknotting number and number of Reidemeister moves needed for unlinking
- Untangling planar curves
- Wye-Delta Transformation in Probablilistic Networks
Cited in
(27)- Complexity of geodesics on 2-dimensional ideal polyhedra and isotopies
- Closing curves by rearranging arcs
- From curves to words and back again: geometric computation of minimum-area homotopy
- A combinatorial algorithm for immersed loops in surfaces
- Coaxing a planar curve to comply
- A Lagrangian filling for every cluster seed
- scientific article; zbMATH DE number 7015040 (Why is no real title available?)
- scientific article; zbMATH DE number 4079447 (Why is no real title available?)
- Bringing closed polygonal curves in the plane to normal form via local moves
- Untangling a polygon
- Characterizing homotopy of systems of curves on a compact surface by crossing numbers
- On the necessity of Reidemeister move 2 for simplifying immersed planar curves
- Lower bounds for electrical reduction on surfaces
- Winding indexes of max. and min. Hamiltonians in \(N\)-gons
- The unbearable hardness of unknotting
- Combinatorial properties of self-overlapping curves and interior boundaries
- scientific article; zbMATH DE number 7559249 (Why is no real title available?)
- Converting homotopies to isotopies and dividing homotopies in half in an effective way
- Complexity of plane and spherical curves
- Tightening Curves on Surfaces Monotonically with Applications
- Measuring complexity of curves on surfaces
- Determining the orientation of closed planar curves
- Making curves minimally crossing by Reidemeister moves
- A Markov Chain Sampler for Plane Curves
- An algorithm for delta-wye reduction of almost-planar graphs
- Structure and enumeration of \(K_4\)-minor-free links and link-diagrams
- Untangling planar curves
This page was built for publication: Untangling planar curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688858)
