Tietze transformations with weighted substring search
Journal of Symbolic Computation
Computational complexity of combinatorial surfaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Computing homology groups of simplicial complexes in R3
Journal of the ACM (JACM)
Transforming curves on surfaces
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Computing a canonical polygonal schema of an orientable triangulated surface
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Computational topology: ambient isotopic approximation of 2-manifolds
Theoretical Computer Science - Topology in computer science
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Computational topology for isotopic surface reconstruction
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Computing shortest cycles using universal covering space
The Visual Computer: International Journal of Computer Graphics
On Computing Handle and Tunnel Loops
CW '07 Proceedings of the 2007 International Conference on Cyberworlds
Hi-index | 0.01 |
Fundamental group is one of the most important topological invariants for general manifolds, which can be directly used as manifolds classification. In this work, we provide a series of practical and efficient algorithms to compute fundamental groups for general 3-manifolds based on CW cell decomposition. The input is a tetrahedral mesh, while the output is symbolic representation of its first fundamental group. We further simplify the fundamental group representation using computational algebraic method. We present the theoretical arguments of our algorithms, elaborate the algorithms with a number of examples, and give the analysis of their computational complexity.