Complexity of plane and spherical curves

DOI10.1215/00127094-2009-022zbMATH Open1163.57014arXiv0802.3021OpenAlexW2074096977MaRDI QIDQ1018558FDOQ1018558

Authors: Tahl Nowik 

Publication date: 20 May 2009

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Abstract: We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves along the way having at most n+2 crossings.

Full work available at URL: https://arxiv.org/abs/0802.3021

Recommendations

• Untangling planar curves
• Untangling planar curves
• Making curves minimally crossing by Reidemeister moves
• scientific article; zbMATH DE number 6850316

zbMATH Keywords

immersionsWhitney number\(J\)-moves\(S\)-moves\(Z\)-moves

Mathematics Subject Classification ID

General low-dimensional topology (57M99) Immersions in differential topology (57R42)

Cites Work

• A Classification of Immersions of the Two-Sphere
• Immersions of Manifolds
• The classification of immersions of spheres in Euclidean spaces
• The number of Reidemeister moves needed for unknotting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Invariants of curves and fronts via Gauss diagrams
• Classifying Immersed Curves
• Vassiliev type invariants in Arnold's \(J^+\)-theory of plane curves without direct self-tangencies
• \(J\)-invariants of plane curves and framed chord diagrams
• Regular Curves on Riemannian Manifolds
• Title not available (Why is that?)
• Order one invariants of planar curves
• Vassiliev invariants classify plane curves and doodles
• Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves

Cited In (9)

• Complexity of geodesics on 2-dimensional ideal polyhedra and isotopies
• Order one invariants of spherical curves
• Title not available (Why is that?)
• A Lagrangian filling for every cluster seed
• Resolution of space curves complexity
• Efficiently hex-meshing things with topology
• A Markov Chain Sampler for Plane Curves
• Untangling planar curves
• Untangling planar curves

This page was built for publication: Complexity of plane and spherical curves

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