Forked from
gmsh / gmsh
Source project has a limited visibility.
-
Matti Pellika authored
about O(n^2) -> O(n*log(n)). The bottleneck is now in the Smith normal form computation of the reduced cell complexes, O(n^3).
Matti Pellika authoredabout O(n^2) -> O(n*log(n)). The bottleneck is now in the Smith normal form computation of the reduced cell complexes, O(n^3).
