7 citations · 13 across the 4 of their papers we have counts for
4 papers
2-manifold recognition is in logspace
Benjamin A. Burton, Murray Elder, Arkadius Kalka +1
We prove that the homeomorphism problem for 2-manifolds can be decided in logspace. The proof relies on Reingold's logspace solution to the undirected -connectivity problem in…
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto
Jonathan Spreer, Uli Wagner, Benjamin A. Burton +3
This workshop about triangulations of manifolds in computational geometry and topology was held at the 2014 CG-Week in Kyoto, Japan. It focussed on computational and combinatorial…
Projective geometry and the outer approximation algorithm for multiobjective linear programming
Benjamin A. Burton, Melih Ozlen
A key problem in multiobjective linear programming is to find the set of all efficient extreme points in objective space. In this paper we introduce oriented projective geometry as…
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…