KDTreeLinkerTrackEcal.cc

Go to the documentation of this file.

#include "DataFormats/ParticleFlowReco/interface/PFCluster.h"
#include "RecoParticleFlow/PFProducer/interface/KDTreeLinkerBase.h"
#include "CommonTools/RecoAlgos/interface/KDTreeLinkerAlgo.h"
 
#include "TMath.h"
 
// This class is used to find all links between Tracks and ECAL clusters
// using a KDTree algorithm.
// It is used in PFBlockAlgo.cc in the function links().
class KDTreeLinkerTrackEcal : public KDTreeLinkerBase {
public:
  KDTreeLinkerTrackEcal(const edm::ParameterSet &conf);
  ~KDTreeLinkerTrackEcal() override;
 
  // With this method, we create the list of psCluster that we want to link.
  void insertTargetElt(reco::PFBlockElement *track) override;
 
  // Here, we create the list of ecalCluster that we want to link. From ecalCluster
  // and fraction, we will create a second list of rechits that will be used to
  // build the KDTree.
  void insertFieldClusterElt(reco::PFBlockElement *ecalCluster) override;
 
  // The KDTree building from rechits list.
  void buildTree() override;
 
  // Here we will iterate over all tracks. For each track intersection point with ECAL,
  // we will search the closest rechits in the KDTree, from rechits we will find the
  // ecalClusters and after that we will check the links between the track and
  // all closest ecalClusters.
  void searchLinks() override;
 
  // Here, we will store all PS/ECAL founded links in the PFBlockElement class
  // of each psCluster in the PFmultilinks field.
  void updatePFBlockEltWithLinks() override;
 
  // Here we free all allocated structures.
  void clear() override;
 
private:
  // Data used by the KDTree algorithm : sets of Tracks and ECAL clusters.
  BlockEltSet targetSet_;
  BlockEltSet fieldClusterSet_;
 
  // Sets of rechits that compose the ECAL clusters.
  RecHitSet rechitsSet_;
 
  // Map of linked Track/ECAL clusters.
  BlockElt2BlockEltMap target2ClusterLinks_;
 
  // Map of the ECAL clusters associated to a rechit.
  RecHit2BlockEltMap rechit2ClusterLinks_;
 
  // KD trees
  KDTreeLinkerAlgo<reco::PFRecHit const *> tree_;
};
 
// the text name is different so that we can easily
// construct it when calling the factory
DEFINE_EDM_PLUGIN(KDTreeLinkerFactory, KDTreeLinkerTrackEcal, "KDTreeTrackAndECALLinker");
 
KDTreeLinkerTrackEcal::KDTreeLinkerTrackEcal(const edm::ParameterSet &conf) : KDTreeLinkerBase(conf) {}
 
KDTreeLinkerTrackEcal::~KDTreeLinkerTrackEcal() { clear(); }
 
void KDTreeLinkerTrackEcal::insertTargetElt(reco::PFBlockElement *track) {
  if (track->trackRefPF()->extrapolatedPoint(reco::PFTrajectoryPoint::ECALShowerMax).isValid()) {
    targetSet_.insert(track);
  }
}
 
void KDTreeLinkerTrackEcal::insertFieldClusterElt(reco::PFBlockElement *ecalCluster) {
  const reco::PFClusterRef &clusterref = ecalCluster->clusterRef();
 
  // This test is more or less done in PFBlockAlgo.h. In others cases, it should be switch on.
  //   if (!((clusterref->layer() == PFLayer::ECAL_ENDCAP) ||
  //    (clusterref->layer() == PFLayer::ECAL_BARREL)))
  //     return;
 
  const std::vector<reco::PFRecHitFraction> &fraction = clusterref->recHitFractions();
 
  // We create a list of ecalCluster
  fieldClusterSet_.insert(ecalCluster);
  for (size_t rhit = 0; rhit < fraction.size(); ++rhit) {
    const reco::PFRecHitRef &rh = fraction[rhit].recHitRef();
    double fract = fraction[rhit].fraction();
 
    if ((rh.isNull()) || (fract < cutOffFrac))
      continue;
 
    const reco::PFRecHit &rechit = *rh;
 
    // We save the links rechit to EcalClusters
    rechit2ClusterLinks_[&rechit].insert(ecalCluster);
 
    // We create a liste of rechits
    rechitsSet_.insert(&rechit);
  }
}
 
void KDTreeLinkerTrackEcal::buildTree() {
  // List of pseudo-rechits that will be used to create the KDTree
  std::vector<KDTreeNodeInfo<reco::PFRecHit const *, 2>> eltList;
 
  // Filling of this list
  for (RecHitSet::const_iterator it = rechitsSet_.begin(); it != rechitsSet_.end(); it++) {
    const reco::PFRecHit::REPPoint &posrep = (*it)->positionREP();
 
    KDTreeNodeInfo<reco::PFRecHit const *, 2> rh1(*it, posrep.eta(), posrep.phi());
    eltList.push_back(rh1);
 
    // Here we solve the problem of phi circular set by duplicating some rechits
    // too close to -Pi (or to Pi) and adding (substracting) to them 2 * Pi.
    if (rh1.dims[1] > (M_PI - phiOffset_)) {
      float phi = rh1.dims[1] - 2 * M_PI;
      KDTreeNodeInfo<reco::PFRecHit const *, 2> rh2(*it, float(posrep.eta()), phi);
      eltList.push_back(rh2);
    }
 
    if (rh1.dims[1] < (M_PI * -1.0 + phiOffset_)) {
      float phi = rh1.dims[1] + 2 * M_PI;
      KDTreeNodeInfo<reco::PFRecHit const *, 2> rh3(*it, float(posrep.eta()), phi);
      eltList.push_back(rh3);
    }
  }
 
  // Here we define the upper/lower bounds of the 2D space (eta/phi).
  float phimin = -1.0 * M_PI - phiOffset_;
  float phimax = M_PI + phiOffset_;
 
  // etamin-etamax, phimin-phimax
  KDTreeBox region(-3.0f, 3.0f, phimin, phimax);
 
  // We may now build the KDTree
  tree_.build(eltList, region);
}
 
void KDTreeLinkerTrackEcal::searchLinks() {
  // Most of the code has been taken from LinkByRecHit.cc
 
  // We iterate over the tracks.
  for (BlockEltSet::iterator it = targetSet_.begin(); it != targetSet_.end(); it++) {
    reco::PFRecTrackRef trackref = (*it)->trackRefPF();
 
    // We set the multilinks flag of the track to true. It will allow us to
    // use in an optimized way our algo results in the recursive linking algo.
    (*it)->setIsValidMultilinks(true);
 
    const reco::PFTrajectoryPoint &atECAL = trackref->extrapolatedPoint(reco::PFTrajectoryPoint::ECALShowerMax);
 
    // The track didn't reach ecal
    if (!atECAL.isValid())
      continue;
 
    const reco::PFTrajectoryPoint &atVertex = trackref->extrapolatedPoint(reco::PFTrajectoryPoint::ClosestApproach);
 
    double trackPt = sqrt(atVertex.momentum().Vect().Perp2());
    float tracketa = atECAL.positionREP().eta();
    float trackphi = atECAL.positionREP().phi();
    double trackx = atECAL.position().X();
    double tracky = atECAL.position().Y();
    double trackz = atECAL.position().Z();
 
    // Estimate the maximal envelope in phi/eta that will be used to find rechit candidates.
    // Same envelope for cap et barrel rechits.
    float range = cristalPhiEtaMaxSize_ * (2.0 + 1.0 / std::min(1., trackPt / 2.));
 
    // We search for all candidate recHits, ie all recHits contained in the maximal size envelope.
    std::vector<reco::PFRecHit const *> recHits;
    KDTreeBox trackBox(tracketa - range, tracketa + range, trackphi - range, trackphi + range);
    tree_.search(trackBox, recHits);
 
    // Here we check all rechit candidates using the non-approximated method.
    for (auto const &recHit : recHits) {
      const auto &cornersxyz = recHit->getCornersXYZ();
      const auto &posxyz = recHit->position();
      const auto &rhrep = recHit->positionREP();
      const auto &corners = recHit->getCornersREP();
 
      double rhsizeeta = fabs(corners[3].eta() - corners[1].eta());
      double rhsizephi = fabs(corners[3].phi() - corners[1].phi());
      if (rhsizephi > M_PI)
        rhsizephi = 2. * M_PI - rhsizephi;
 
      double deta = fabs(rhrep.eta() - tracketa);
      double dphi = fabs(rhrep.phi() - trackphi);
      if (dphi > M_PI)
        dphi = 2. * M_PI - dphi;
 
      // Find all clusters associated to given rechit
      RecHit2BlockEltMap::iterator ret = rechit2ClusterLinks_.find(recHit);
 
      for (BlockEltSet::const_iterator clusterIt = ret->second.begin(); clusterIt != ret->second.end(); clusterIt++) {
        reco::PFClusterRef clusterref = (*clusterIt)->clusterRef();
        double clusterz = clusterref->position().z();
        int fracsNbr = clusterref->recHitFractions().size();
 
        if (clusterref->layer() == PFLayer::ECAL_BARREL) {  // BARREL
          // Check if the track is in the barrel
          if (fabs(trackz) > 300.)
            continue;
 
          double _rhsizeeta = rhsizeeta * (2.00 + 1.0 / (fracsNbr * std::min(1., trackPt / 2.)));
          double _rhsizephi = rhsizephi * (2.00 + 1.0 / (fracsNbr * std::min(1., trackPt / 2.)));
 
          // Check if the track and the cluster are linked
          if (deta < (_rhsizeeta / 2.) && dphi < (_rhsizephi / 2.))
            target2ClusterLinks_[*it].insert(*clusterIt);
 
        } else {  // ENDCAP
 
          // Check if the track is in the cap
          if (fabs(trackz) < 300.)
            continue;
          if (trackz * clusterz < 0.)
            continue;
 
          double x[5];
          double y[5];
          for (unsigned jc = 0; jc < 4; ++jc) {
            auto cornerposxyz = cornersxyz[jc];
            x[3 - jc] = cornerposxyz.x() +
                        (cornerposxyz.x() - posxyz.x()) * (1.00 + 0.50 / fracsNbr / std::min(1., trackPt / 2.));
            y[3 - jc] = cornerposxyz.y() +
                        (cornerposxyz.y() - posxyz.y()) * (1.00 + 0.50 / fracsNbr / std::min(1., trackPt / 2.));
          }
 
          x[4] = x[0];
          y[4] = y[0];
 
          bool isinside = TMath::IsInside(trackx, tracky, 5, x, y);
 
          // Check if the track and the cluster are linked
          if (isinside)
            target2ClusterLinks_[*it].insert(*clusterIt);
        }
      }
    }
  }
}
 
void KDTreeLinkerTrackEcal::updatePFBlockEltWithLinks() {
  //TODO YG : Check if cluster positionREP() is valid ?
 
  // Here we save in each track the list of phi/eta values of linked clusters.
  for (BlockElt2BlockEltMap::iterator it = target2ClusterLinks_.begin(); it != target2ClusterLinks_.end(); ++it) {
    reco::PFMultiLinksTC multitracks(true);
 
    for (BlockEltSet::iterator jt = it->second.begin(); jt != it->second.end(); ++jt) {
      double clusterphi = (*jt)->clusterRef()->positionREP().phi();
      double clustereta = (*jt)->clusterRef()->positionREP().eta();
 
      multitracks.linkedClusters.push_back(std::make_pair(clusterphi, clustereta));
    }
 
    it->first->setMultilinks(multitracks);
  }
}
 
void KDTreeLinkerTrackEcal::clear() {
  targetSet_.clear();
  fieldClusterSet_.clear();
 
  rechitsSet_.clear();
 
  rechit2ClusterLinks_.clear();
  target2ClusterLinks_.clear();
 
  tree_.clear();
}