Triangulations into Groups
classification
🧮 math.GT
math.CO
keywords
algorithmgroupstriangulationadmitscuspeddimensionefficientfundamental
read the original abstract
If a (cusped) surface S admits an ideal triangulation T with no shears, we show an efficient algorithm to give S as a quotient of hypebolic plane by a subgroup of PSL(2, Z). The algorithm runs in time O(n log n), where n is the number of triangles in the triangulation T. The algorithm generalizes to producing fundamental groups of general surfaces and geometric manifolds of higher dimension.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.