Finding non-orientable surfaces in 3-manifolds

DOI10.4230/LIPICS.SOCG.2016.24MaRDI QIDQ3132858zbMATH OpenFDO

Authors Arnaud de Mesmay, Benjamin A. Burton, Uli Wagner

Publication date 30 January 2018

zbMATH Keywords

embedding3-manifoldlow-dimensional topologynormal surfacesnon-orientability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General geometric structures on low-dimensional manifolds (57M50)

Recommendations

• Finding non-orientable surfaces in 3-manifolds
• Embeddability in \(R^3\) is NP-hard
• Embeddability in \(\mathbb R^3\) is NP-hard
• Computing Heegaard genus is NP-hard
• The computational complexity of basic decision problems in 3-dimensional topology

Cited in

(7)

• Computing Heegaard genus is NP-hard
• Some conditionally hard problems on links and 3-manifolds
• On the complexity of immersed normal surfaces
• Finding non-orientable surfaces in 3-manifolds
• Finding disjoint surfaces in 3-manifolds
• Finding Irreducible Submanifolds of 3-Manifolds
• FINDING PLANAR SURFACES IN KNOT- AND LINK-MANIFOLDS

This page was built for publication: Finding non-orientable surfaces in 3-manifolds

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