summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2018-03-16Minor changes (indentation, etc)HEADmasterArnur Nigmetov
2018-03-16Test cases for the DIPHA input reader.gspr/new-dipha-inputGard Spreemann
2018-03-15Support for reading persistence diagrams in the DIPHA format.Gard Spreemann
2018-03-06Points with 0 persistence ignored in the inputArnur Nigmetov
2018-01-25Fix for inf-only diagramsArnur Nigmetov
2018-01-20Major rewrite, templatized versionArnur Nigmetov
2017-07-19Include cmath instead of math.hArnur Nigmetov
2017-07-05Price adjustment; maxIterNum increasedArnur Nigmetov
For high Wasserstein powers price adjustment (subtract minimal price) is needed.
2017-04-26More debug outputArnur Nigmetov
2017-04-26More debug outputArnur Nigmetov
2017-04-24Some more debug outputArnur Nigmetov
2017-04-24Lots of debug output for sampling heuristicArnur Nigmetov
To fix a problem on Mac OS.
2017-04-24Verbose timing for bottleneck addedArnur Nigmetov
Timing info is printed, if VERBOSE_BOTTLENECK is #defined in def_debug_bt.h.
2017-04-24Debug output suppressedArnur Nigmetov
2017-04-24Empty diagram bug for Wasserstein fixedArnur Nigmetov
2017-04-14Bug in Wasserstein fixed: internal_p not passed to kd-treeArnur Nigmetov
2017-04-06Minor changesArnur Nigmetov
2017-04-06Heuristic for bottleneck: estimate on sampled diagramArnur 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-05Remove duplicate points for Wasserstein-1Arnur Nigmetov
2017-04-04Prepare to output real relative error.Arnur Nigmetov
In Wasserstein distance computation AuctionRunner class now has a field relativeError which contains the relative error which we can guarantee, so if the user asked for 0.1 accuracy, but the result is 0.03 accurate, this information can be retrieved.
2017-04-04README edited: relative_error clarifiedArnur Nigmetov
2017-03-05Bug 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-22Warning for zero persistence pointsArnur Nigmetov
2017-02-22temporary fix for exact version from filesArnur Nigmetov
2016-11-09Ignore zero persistence in the inputArnur Nigmetov
2016-09-05Technical changes for R integrationArnur 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-18Rename def_debug.h to def_debug_ws.hArnur Nigmetov
2016-07-18Rename def_debug.h to def_debug_bt.hArnur Nigmetov
2016-06-16Merge branch 'master' of bitbucket.org:grey_narn/heraArnur Nigmetov
2016-06-16Add missing CMakeLists and licence.txt, edit .gitignoreArnur Nigmetov
2016-06-06README.txt edited online with Bitbucketmkerber
2016-06-06README.txt edited online with BitbucketArnur Nigmetov
2016-06-06README.txt edited online with BitbucketArnur Nigmetov
2016-06-06Add actual source from previous reposArnur Nigmetov
2016-06-06Initial commit - READMEArnur Nigmetov
generated by cgit v1.2.3 (git 2.39.1) at 2024-05-02 22:51:26 +0000