Computational topology with Regina: algorithms, heuristics and implementations
From MaRDI portal
(Redirected from Publication:2867792)
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.
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
Cited in
(24)- On the hardness of finding normal surfaces
- Combinatorial Seifert fibred spaces with transitive cyclic automorphism group
- Computing Triangulations of Mapping Tori of Surface Homeomorphisms
- Courcelle's theorem for triangulations
- Optimizing the double description method for normal surface enumeration
- Implementation of the Topological \varepsilon -Algorithm
- A census of exceptional Dehn fillings
- 3-manifold triangulations with small treewidth
- Simplicial blowups and discrete normal surfaces in \textsf{simpcomp}
- Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations
- Introducing Regina, The 3-Manifold Topology Software
- On the pathwidth of hyperbolic 3-manifolds
- Computing a link diagram from its exterior
- The computational complexity of classical knot recognition
- Crushing surfaces of positive genus
- On the width of complicated JSJ decompositions
- Practical software for triangulating and simplifying 4-manifolds
- Computing closed essential surfaces in 3-manifolds
- The Thurston norm via spun-normal immersions
- Connecting 3-manifold triangulations with unimodal sequences of elementary moves
- On the complexity of 2-bridge link complements
- On the twin-width of smooth manifolds
- A practical algorithm for knot factorisation
- A new approach to crushing 3-manifold triangulations
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)
