PandaRoot
PndHoughSegment.h
Go to the documentation of this file.
1 // PndHoughSegment
3 // Divides hits in tracklets depending on phi
5 
16 #ifndef PndHoughSegment_H_
17 #define PndHoughSegment_H_
18 
19 #include "PndTrackCand.h"
20 
21 #include "FairHit.h"
22 #include "TH1F.h"
23 #include "TClonesArray.h"
24 #include "PndHoughData.h"
25 
27 
28  public:
30  virtual ~PndHoughSegment();
31 
33  virtual void SetNBins(Int_t n) { fNBins = n; };
35  TClonesArray *CreateTrackCands(PndTrackCand &Cand);
36 
37  protected:
38  TH1F *CreateHisto(PndTrackCand &Cand);
39  std::vector<double> FindCuts2Zeros(TH1F &histo);
40  void FillSingleCand(TVector3 &myHit, std::vector<double> &cuts, FairLink &link, PndTrackCand fTrackCandMap[]);
41  TClonesArray *FillTrackCands(PndTrackCand &Cand, std::vector<double> &cuts);
42 
43  protected:
44  Int_t fNBins;
45  std::map<FairLink, FairHit *> fMapFairLinktoFairHit;
46  std::map<int, PndTrackCand> fTrackCandMap;
47 
49 };
50 
51 #endif /* PndHoughSegment_H_ */
virtual ~PndHoughSegment()
PndHoughSegment(PndHoughData *fData)
TH1F * CreateHisto(PndTrackCand &Cand)
void FillSingleCand(TVector3 &myHit, std::vector< double > &cuts, FairLink &link, PndTrackCand fTrackCandMap[])
std::vector< double > FindCuts2Zeros(TH1F &histo)
std::map< FairLink, FairHit * > fMapFairLinktoFairHit
virtual void SetNBins(Int_t n)
Sets the number of bins for a range from -180 to 180. The efficiency of the algorithm depends strongl...
ClassDef(PndHoughSegment, 2)
TClonesArray * CreateTrackCands(PndTrackCand &Cand)
Creates track candidates.
std::map< int, PndTrackCand > fTrackCandMap
TClonesArray * FillTrackCands(PndTrackCand &Cand, std::vector< double > &cuts)