Finding non-orientable surfaces in 3-manifolds
DOI10.1007/s00454-017-9900-0zbMath1387.68246arXiv1602.07907OpenAlexW2963498757MaRDI QIDQ1688857
Uli Wagner, Benjamin A. Burton, Arnaud de Mesmay
Publication date: 11 January 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07907
NP-completenessembeddability3-manifoldnormal surfacelow-dimensional topologycomputational topologynon-orientable surface
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General geometric structures on low-dimensional manifolds (57M50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm to determine the Heegaard genus of a 3-manifold
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- A new approach to crushing 3-manifold triangulations
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- An algorithm to decide if a 3-manifold is a Haken manifold
- Heegaard surfaces and measured laminations. I: the Waldhausen conjecture
- Non-orientable fundamental surfaces in Lens spaces
- Non-orientable surfaces in 3-manifolds
- Homotopy equivalences of 3-manifolds with boundaries
- 0-efficient triangulations of 3-manifolds
- Thin position and the recognition problem for \(S^ 3\)
- Geometric proof of Neuwirth's theorem on the construction of 3-manifolds from 2-dimensional polyhedra
- Incompressible surfaces in Seifert fibered spaces
- The efficient certification of knottedness and Thurston norm
- Nonorientable surfaces in homology cobordisms (with an appendix by Ira M. Gessel)
- Algorithmic homeomorphism of 3-manifolds as a corollary of geometrization
- Some conditionally hard problems on links and 3-manifolds
- Non-orientable surfaces in orientable 3-manifolds
- Affine structures in 3-manifolds. V: The triangulation theorem and Hauptvermutung
- What is an Almost Normal Surface
- The graph genus problem is NP-complete
- On 3-Manifolds That Have Finite Fundamental Group and Contain Klein Bottles
- The computational complexity of knot and link problems
- Embeddability in the 3-Sphere Is Decidable
- Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces
- Nonorientable Surfaces in Some Non-Haken 3-Manifolds
- Some 3-Manifolds which Admit Klein Bottles
- Computing Heegaard Genus is NP-Hard
- The complexity of satisfiability problems
- Minors in random and expanding hypergraphs
- The computational complexity of knot genus and spanning area
- Algorithmic topology and classification of 3-manifolds
This page was built for publication: Finding non-orientable surfaces in 3-manifolds