Computational topology with Regina: algorithms, heuristics and implementations
From MaRDI portal
Publication:2867792
zbMATH Open1279.57004arXiv1208.2504MaRDI QIDQ2867792FDOQ2867792
Authors: Benjamin A. Burton 
Publication date: 20 December 2013
Abstract: Regina is a software package for studying 3-manifold triangulations and normal surfaces. It includes a graphical user interface and Python bindings, and also supports angle structures, census enumeration, combinatorial recognition of triangulations, and high-level functions such as 3-sphere recognition, unknot recognition and connected sum decomposition. This paper brings 3-manifold topologists up-to-date with Regina as it appears today, and documents for the first time in the literature some of the key algorithms, heuristics and implementations that are central to Regina's performance. These include the all-important simplification heuristics, key choices of data structures and algorithms to alleviate bottlenecks in normal surface enumeration, modern implementations of 3-sphere recognition and connected sum decomposition, and more. We also give some historical background for the project, including the key role played by Rubinstein in its genesis 15 years ago, and discuss current directions for future development.
Full work available at URL: https://arxiv.org/abs/1208.2504
Recommendations
- Introducing Regina, The 3-Manifold Topology Software
- The Pachner graph and the simplification of 3-sphere triangulations
- Optimizing the double description method for normal surface enumeration
- Algorithmic topology and classification of 3-manifolds
- Computing Triangulations of Mapping Tori of Surface Homeomorphisms
Nonnumerical algorithms (68W05) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Triangulating manifolds (57Q15)
Cited In (15)
- Title not available (Why is that?)
- Computing a link diagram from its exterior
- Optimizing the double description method for normal surface enumeration
- Combinatorial Seifert fibred spaces with transitive cyclic automorphism group
- A census of exceptional Dehn fillings
- Introducing Regina, The 3-Manifold Topology Software
- A new approach to crushing 3-manifold triangulations
- Implementation of the Topological $\varepsilon $-Algorithm
- On the hardness of finding normal surfaces
- Courcelle's theorem for triangulations
- On the pathwidth of hyperbolic 3-manifolds
- The computational complexity of classical knot recognition
- Simplicial blowups and discrete normal surfaces in \textsf{simpcomp}
- Detecting genus in vertex links for the fast enumeration of \(3\)-manifold triangulations
- Computing Triangulations of Mapping Tori of Surface Homeomorphisms
Uses Software
This page was built for publication: Computational topology with Regina: algorithms, heuristics and implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867792)
