Age | Commit message (Collapse) | Author | |
---|---|---|---|
2019-09-15 | Update README, BSD license only. | Arnur Nigmetov | |
2018-06-21 | Bug in longest edge for negative persistence fixed | Arnur Nigmetov | |
2018-06-19 | Template bug fixed | Arnur Nigmetov | |
2018-06-19 | Longest edge for bottleneck, tests for bottleneck | Arnur Nigmetov | |
2018-06-03 | First tests added | Arnur Nigmetov | |
Preparation for longest edge computation. | |||
2018-05-19 | Points at infinity handled correctly. | Arnur Nigmetov | |
1. Reader copied from wasserstein code, can parse inf, moved to hera namespace. 2. addProjections removes points at infinity. 3. Points at infinity handled separately by getInfinityCost(). | |||
2018-01-20 | Major rewrite, templatized version | Arnur Nigmetov | |
2017-07-19 | Include cmath instead of math.h | Arnur Nigmetov | |
2017-04-26 | More debug output | Arnur Nigmetov | |
2017-04-26 | More debug output | Arnur Nigmetov | |
2017-04-24 | Some more debug output | Arnur Nigmetov | |
2017-04-24 | Lots of debug output for sampling heuristic | Arnur Nigmetov | |
To fix a problem on Mac OS. | |||
2017-04-24 | Verbose timing for bottleneck added | Arnur Nigmetov | |
Timing info is printed, if VERBOSE_BOTTLENECK is #defined in def_debug_bt.h. | |||
2017-04-24 | Debug output suppressed | Arnur Nigmetov | |
2017-04-24 | Empty diagram bug for Wasserstein fixed | Arnur Nigmetov | |
2017-04-06 | Minor changes | 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-04-04 | README edited: relative_error clarified | Arnur Nigmetov | |
2017-03-05 | Bug in exact version of bottleneck fixed" | Arnur Nigmetov | |
Allow for machine arithmetic errors when searching for candidates for distance (increase the width of the stripes slightly). | |||
2017-02-22 | Warning for zero persistence points | Arnur Nigmetov | |
2017-02-22 | temporary fix for exact version from files | Arnur Nigmetov | |
2016-11-09 | Ignore zero persistence in the input | 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-07-18 | Rename def_debug.h to def_debug_bt.h | Arnur Nigmetov | |
2016-06-16 | Add missing CMakeLists and licence.txt, edit .gitignore | Arnur Nigmetov | |
2016-06-06 | Add actual source from previous repos | Arnur Nigmetov | |