summaryrefslogtreecommitdiff
path: root/geom_bottleneck/example
AgeCommit message (Collapse)Author
2018-01-20Major rewrite, templatized versionArnur Nigmetov
2017-04-24Some more debug outputArnur 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-02-22temporary fix for exact version from filesArnur Nigmetov
2016-06-16Add missing CMakeLists and licence.txt, edit .gitignoreArnur Nigmetov
2016-06-06Add actual source from previous reposArnur Nigmetov