81 citations · 403 across the 47 of their papers we have counts for
Showing 2010 · math.GTShow all
3 papers · 2 filters
math.GT2010★ 33 cited
The Pachner graph and the simplification of 3-sphere triangulations
Benjamin A. Burton
It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need…
math.GT2010★ 3 cited
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
Benjamin A. Burton, Melih Ozlen
In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly de…
math.GT2010★ 7 cited
Maximal admissible faces and asymptotic bounds for the normal surface solution space
Benjamin A. Burton
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dim…