Greatly improved computational complexity of reduction and coreduction,
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).
Showing
- Geo/CellComplex.cpp 320 additions, 111 deletionsGeo/CellComplex.cpp
- Geo/CellComplex.h 137 additions, 49 deletionsGeo/CellComplex.h
- Geo/ChainComplex.cpp 2 additions, 2 deletionsGeo/ChainComplex.cpp
- Geo/Makefile 1 addition, 1 deletionGeo/Makefile
- utils/misc/celldriver.cpp 7 additions, 6 deletionsutils/misc/celldriver.cpp
Loading
Please register or sign in to comment