The random_discrete_morse client in polymake is a C++ (and therefore FAST) implementation of Bruno Benedetti and Frank Lutz’s algorithm. Read more about it here.
The bistellar_simplification client in polymake uses a simulated annealing technique to determine the PL type of a simplicial complex. Read more about it here.
dgCat: Discrete Geometric Category
Let [latex]K[/latex] be a simplicial complex and suppose that [latex]K[/latex] collapses onto [latex]L[/latex]. Define [latex]n[/latex] to be 1 less than the minimum number of collapsible sets it takes to cover [latex]L[/latex]. Then the discrete Lusternik-Schnirelmann category of [latex]K[/latex] is the smallest [latex]n[/latex] taken over all such [latex]L[/latex]. dgCat is an implementation of an algorithm which yields an upper bound for the discrete category. Read more about it here.
This project was joint work with Nicholas Scoville and Brian Green.