Abstract
Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P2 3-manifold triangulations. In particular, new constraints are proven for face-pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P2 3-manifolds that can be formed from at most 10 tetrahedra.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Burton, B. Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find. Discrete Comput Geom 38, 527–571 (2007). https://doi.org/10.1007/s00454-007-1307-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-007-1307-x