The complexity of detecting taut angle structures on triangulations

DOI10.1137/1.9781611973105.13zbMath1421.68161arXiv1207.0904OpenAlexW2951845199MaRDI QIDQ5741721

Jonathan Spreer, Benjamin A. Burton

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (6)

Courcelle's theorem for triangulations ⋮ On the pathwidth of hyperbolic 3-manifolds ⋮ Some conditionally hard problems on links and 3-manifolds ⋮ Computing Heegaard Genus is NP-Hard ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: The complexity of detecting taut angle structures on triangulations