Untangling planar curves
From MaRDI portal
Publication:1688858
DOI10.1007/s00454-017-9907-6zbMath1387.57039OpenAlexW2741773415MaRDI QIDQ1688858
Jeff Erickson, Hsien-Chih Chang
Publication date: 11 January 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5921/
Embeddings and immersions in topological manifolds (57N35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (8)
The unbearable hardness of unknotting ⋮ A Markov Chain Sampler for Plane Curves ⋮ Winding indexes of Max. and Min. Hamiltonians in N-Gons ⋮ From curves to words and back again: geometric computation of minimum-area homotopy ⋮ An algorithm for delta-wye reduction of almost-planar graphs ⋮ Structure and enumeration of \(K_4\)-minor-free links and link-diagrams ⋮ Unnamed Item ⋮ Lower bounds for electrical reduction on surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invariants of random knots and links
- A polynomial upper bound on Reidemeister moves
- Unknotting number and number of Reidemeister moves needed for unlinking
- Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle
- Complexity of plane and spherical curves
- Intersections of curves on surfaces
- Parabolic equations for curves on surfaces. II: Intersections, blow-up and generalized solutions
- Graph minors. X: Obstructions to tree-decomposition
- Shortening embedded curves
- Invariants of curves and fronts via Gauss diagrams
- Shortening curves on surfaces
- Quickly excluding a planar graph
- Making curves minimally crossing by Reidemeister moves
- Applications of random sampling in computational geometry. II
- A combinatorial algorithm for immersed loops in surfaces
- A new approach to solving three combinatorial enumeration problems on planar graphs
- Planar electric networks. II
- A fast planar partition algorithm. I
- An upper bound on Reidemeister moves
- Introduction to Vassiliev Knot Invariants
- MINIMAL UNKNOTTING SEQUENCES OF REIDEMEISTER MOVES CONTAINING UNMATCHED RII MOVES
- Incremental Voronoi diagrams
- Untangling Planar Curves
- The Use of Wye-Delta Transformations in Network Simplification
- On minimal-node-cost planar embeddings
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- On the delta-wye reduction for planar graphs
- Universality considerations in VLSI circuits
- Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
- An optimal algorithm for intersecting line segments in the plane
- Doodle groups
- Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
- Minimal sequences of Reidemeister moves on diagrams of torus knots
- Wye-Delta Transformation in Probablilistic Networks
- (1, 2) AND WEAK (1, 3) HOMOTOPIES ON KNOT PROJECTIONS
- The Folded Ribbon Theorem. A Contribution to the Study of Immersed Circles
This page was built for publication: Untangling planar curves
