23 citations · 199 across the 45 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.GT2012
Computational topology and normal surfaces: Theoretical and experimental complexity bounds
Benjamin A. Burton, João Paixão, Jonathan Spreer
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to expone…
math.GT2012★ 9 cited
The complexity of detecting taut angle structures on triangulations
Benjamin A. Burton, Jonathan Spreer
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manif…