Abstract

An algorithm for computing canonical triangulations of cusped hyperbolic 3-manifolds provides an efficient way to determine whether two such manifolds are isometric. The canonical triangulation is defined via a convex hull construction in Minkowski space. The algorithm accepts as input an arbitrary triangulation (which typically corresponds to a nonconvex solid in Minkowski space) and locally modifies it until it arrives at the canonical triangulation (which corresponds to the convex hull). The practicality of the algorithm rests on a surprisingly simple theorem which detects where the local modifications must be made. The algorithm has found many applications; for example, it quickly determines whether two hyperbolic knots are equivalent.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.