FTMTreePP.h

Go to the documentation of this file.

 
// to the contour tree package.
 
#pragma once
 
#include "FTMTree.h"
 
namespace ttk {
  namespace ftm {
    class FTMTreePP : public FTMTree {
    private:
      std::vector<AtomicUF> nodesUF_;
 
      // Custom tree option
      ftm::FTMTree_MT *customTree;
      std::vector<idNode> customTreeLeaves;
      bool useCustomTree = false;
      bool isJt;
 
    public:
      FTMTreePP();
      ~FTMTreePP() override;
 
      template <typename scalarType>
      void computePersistencePairs(
        std::vector<std::tuple<SimplexId, SimplexId, scalarType>> &pairs,
        const bool jt);
 
      void setCustomTree(ftm::FTMTree_MT *cTree) {
        customTree = cTree;
        useCustomTree = true;
      }
 
    protected:
      template <typename scalarType>
      void computePairs(
        ftm::FTMTree_MT *tree,
        std::vector<std::tuple<SimplexId, SimplexId, scalarType>> &pairs);
 
      template <typename scalarType>
      void sortPairs(
        ftm::FTMTree_MT *tree,
        std::vector<std::tuple<SimplexId, SimplexId, scalarType>> &pairs);
 
      void addPendingNode(const idNode parentNode, const idNode toAdd) {
        // Trick, we use the arc list to maintaint nodes
        // coming to this UF.
        nodesUF_[parentNode].find()->addArcToClose(toAdd);
      }
 
      idNode countPendingNode(const idNode current) {
        return nodesUF_[current].find()->getOpenedArcs().size();
      }
 
      template <typename scalarType>
      SimplexId getMostPersistVert(const idNode current,
                                   ftm::FTMTree_MT *tree) {
        SimplexId minVert = tree->getNode(current)->getVertexId();
        scalarType minVal = tree->getValue<scalarType>(minVert);
        AtomicUF *uf = nodesUF_[current].find();
 
        for(const auto nodeid : uf->getOpenedArcs()) {
          const SimplexId vtmp = nodesUF_[nodeid].find()->getExtrema();
          const scalarType tmpVal = tree->getValue<scalarType>(vtmp);
          if((useCustomTree
              and ((!isJt and tmpVal > minVal) or (isJt and tmpVal < minVal)))
             or (not useCustomTree and tree->compLower(vtmp, minVert))) {
            minVal = tmpVal;
            minVert = vtmp;
          }
        }
 
        return minVert;
      }
 
      void clearPendingNodes(const idNode current) {
        nodesUF_[current].find()->clearOpenedArcs();
      }
 
      template <typename scalarType>
      void createPairs(
        const idNode current,
        std::vector<std::tuple<SimplexId, SimplexId, scalarType>> &pairs,
        ftm::FTMTree_MT *tree,
        const SimplexId mp) {
        AtomicUF *uf = nodesUF_[current].find();
        const SimplexId curVert = tree->getNode(current)->getVertexId();
        const scalarType curVal = (not useCustomTree)
                                    ? getValue<scalarType>(curVert)
                                    : tree->getValue<scalarType>(curVert);
 
        for(const auto nodeid : uf->getOpenedArcs()) {
          const SimplexId tmpVert = nodesUF_[nodeid].find()->getExtrema();
          AtomicUF::makeUnion(uf, &nodesUF_[nodeid]);
          if(tmpVert != mp) {
            const scalarType tmpVal = (not useCustomTree)
                                        ? getValue<scalarType>(tmpVert)
                                        : tree->getValue<scalarType>(tmpVert);
            if((useCustomTree and tmpVal < curVal)
               or (not useCustomTree and scalars_->isLower(tmpVert, curVert))) {
              pairs.emplace_back(tmpVert, curVert, curVal - tmpVal);
            } else {
              pairs.emplace_back(tmpVert, curVert, tmpVal - curVal);
            }
          }
        }
      }
    };
  } // namespace ftm
} // namespace ttk
 
template <typename scalarType>
void ttk::ftm::FTMTreePP::computePersistencePairs(
  std::vector<std::tuple<SimplexId, SimplexId, scalarType>> &pairs,
  const bool jt) {
  ftm::FTMTree_MT *tree;
  idNode nbLeaves;
 
  if(useCustomTree) {
    tree = customTree;
    tree->getLeavesFromTree(customTreeLeaves);
    nbLeaves = customTreeLeaves.size();
    isJt = jt;
  } else {
    tree = jt ? getJoinTree() : getSplitTree();
    nbLeaves = tree->getNumberOfLeaves();
  }
 
  pairs.clear();
  pairs.reserve(nbLeaves);
 
  const auto nbNodes = tree->getNumberOfNodes();
  nodesUF_.resize(nbNodes);
 
  for(idNode nid = 0; nid < nbNodes; ++nid) {
    nodesUF_[nid] = AtomicUF{tree->getNode(nid)->getVertexId()};
  }
 
  computePairs<scalarType>(tree, pairs);
  sortPairs<scalarType>(tree, pairs);
}
 
template <typename scalarType>
void ttk::ftm::FTMTreePP::computePairs(
  ftm::FTMTree_MT *tree,
  std::vector<std::tuple<SimplexId, SimplexId, scalarType>> &pairs) {
  auto getParentNode = [&](const idNode current) {
    const idSuperArc parentArc = tree->getNode(current)->getUpSuperArcId(0);
    return tree->getSuperArc(parentArc)->getUpNodeId();
  };
 
  ::std::queue<idNode> toSee;
 
  // start at the leaves
  auto &vectLeaves = (not useCustomTree) ? tree->getLeaves() : customTreeLeaves;
  for(auto nid : vectLeaves) {
    toSee.emplace(nid);
  }
 
  while(!toSee.empty()) {
    const idNode current = toSee.front();
    toSee.pop();
 
    if(!tree->getNode(current)->getNumberOfUpSuperArcs()) {
      createPairs<scalarType>(current, pairs, tree, ftm::nullVertex);
      clearPendingNodes(current);
      continue;
    } else {
      clearPendingNodes(current);
    }
 
    const idNode parentNode = getParentNode(current);
    addPendingNode(parentNode, current);
 
    if(countPendingNode(parentNode)
       == tree->getNode(parentNode)->getNumberOfDownSuperArcs()) {
      const SimplexId mostPersist
        = getMostPersistVert<scalarType>(parentNode, tree);
      createPairs<scalarType>(parentNode, pairs, tree, mostPersist);
      nodesUF_[parentNode].find()->setExtrema(mostPersist);
      toSee.push(parentNode);
    }
  }
}
 
template <typename scalarType>
void ttk::ftm::FTMTreePP::sortPairs(
  ftm::FTMTree_MT *ttkNotUsed(tree),
  std::vector<std::tuple<SimplexId, SimplexId, scalarType>> &pairs) {
  auto comp = [&](const std::tuple<SimplexId, SimplexId, scalarType> a,
                  const std::tuple<SimplexId, SimplexId, scalarType> b) {
    return std::get<2>(a) < std::get<2>(b);
  };
 
  sort(pairs.begin(), pairs.end(), comp);
}