Triangulations into Groups
Geometric Topology
2007-05-23 v1 Combinatorics
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.
Cite
@article{arxiv.math/0510613,
title = {Triangulations into Groups},
author = {Igor Rivin},
journal= {arXiv preprint arXiv:math/0510613},
year = {2007}
}
Comments
6 pages, 2 figures