The complexity of the normal surface solution space
From MaRDI portal
Publication:5405883
DOI10.1145/1810959.1810995zbMath1284.68586arXiv0911.5498OpenAlexW2006640074MaRDI QIDQ5405883
Publication date: 3 April 2014
Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.5498
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Triangulating manifolds (57Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Geometric constructions in real or complex geometry (51M15) Topological manifolds (57N99)
Related Items
Quadrilateral–Octagon Coordinates for Almost Normal Surfaces, The computational complexity of classical knot recognition, Maximal admissible faces and asymptotic bounds for the normal surface solution space, A tree traversal algorithm for decision problems in knot theory and 3-manifold topology, Tracing compressed curves in triangulated surfaces, The Weber-Seifert dodecahedral space is non-Haken