PersistenceDiagramClustering.h

Go to the documentation of this file.

 
 
#pragma once
 
// base code includes
#include <PDClustering.h>
#include <PersistenceDiagramBarycenter.h>
 
namespace ttk {
 
  class PersistenceDiagramClustering : virtual public Debug {
 
  public:
    PersistenceDiagramClustering() {
      this->setDebugMsgPrefix("PersistenceDiagramClustering");
    }
 
    ~PersistenceDiagramClustering() override = default;
 
    std::vector<int> execute(
      std::vector<DiagramType> &intermediateDiagrams,
      std::vector<DiagramType> &centroids,
      std::vector<std::vector<std::vector<MatchingType>>> &all_matchings);
 
    std::array<double, 3> getDistances() const {
      return this->distances;
    }
 
  protected:
    // Critical pairs used for clustering
    // 0:min-saddles ; 1:saddles-saddles ; 2:sad-max ; else : all
 
    // distance results per pair type
    std::array<double, 3> distances{};
 
    int DistanceWritingOptions{0};
    int PairTypeClustering{-1};
    bool Deterministic{true};
    int WassersteinMetric{2};
 
    bool UseProgressive{true};
 
    bool ForceUseOfAlgorithm{false};
    bool UseInterruptible{true};
    double Alpha{1.0};
    bool UseAdditionalPrecision{false};
    double DeltaLim{0.01};
    double Lambda{1.0};
    double TimeLimit{999999};
    double NonMatchingWeight = 1.0;
 
    int NumberOfClusters{1};
    bool UseAccelerated{false};
    bool UseKmeansppInit{false};
 
    int points_added_;
    int points_deleted_;
  };
 
} // namespace ttk