Age | Commit message (Collapse) | Author | |
---|---|---|---|
2018-01-20 | Major rewrite, templatized version | Arnur Nigmetov | |
2017-04-06 | Heuristic for bottleneck: estimate on sampled diagram | Arnur Nigmetov | |
Sample input diagrams and use the distance between samples as initial guess in binary search. Relevant variables: bottleneck_dist.cpp:10 useSamplingHeur (if false, heuristic is never applied) bottleneck_dist.cpp:11 heurThreshold (heuristic is not applid to diagrams with fewer points) TODO: add command-line parameters instead Sampling strategy: sort points by multiplicity, set cutting value to be the multiplicity where the increase of the next one is maximal and only keep points whose multiplicity is less then the cutting value | |||
2017-02-22 | temporary fix for exact version from files | Arnur Nigmetov | |
2016-09-05 | Technical changes for R integration | Arnur Nigmetov | |
Avoid including iostream (R complains about that). All output protected by preprocessor directive (R checker should not see an instance of std::cout << in your code). Also added getWassersteinCost to be in line with the Dionysus implementation used in TDA. | |||
2016-06-06 | Add actual source from previous repos | Arnur Nigmetov | |