]>
Commit | Line | Data |
---|---|---|
3e87ef69 | 1 | // @(#) $Id$ |
2 | ||
f0f02577 | 3 | // Author: Anders Vestbo <mailto:vestbo@fi.uib.no> |
3e87ef69 | 4 | //*-- Copyright © ALICE HLT Group |
f0f02577 | 5 | |
e06900d5 | 6 | #include "AliL3StandardIncludes.h" |
7 | ||
f0f02577 | 8 | #include "AliL3Logging.h" |
9 | #include "AliL3HoughIntMerger.h" | |
10 | #include "AliL3HoughTrack.h" | |
11 | #include "AliL3TrackSegmentData.h" | |
12 | #include "AliL3Transform.h" | |
13 | #include "AliL3TrackArray.h" | |
14 | ||
e06900d5 | 15 | #if GCCVERSION == 3 |
16 | using namespace std; | |
17 | #endif | |
18 | ||
f0f02577 | 19 | //_____________________________________________________________ |
20 | // Hough Inter merger | |
21 | // Merging of multiple reconstructed tracks | |
22 | ||
23 | ClassImp(AliL3HoughIntMerger) | |
24 | ||
25 | AliL3HoughIntMerger::AliL3HoughIntMerger() : AliL3Merger(1,"AliL3HoughTrack") | |
26 | { | |
27 | //Default constructor | |
28 | fRowMax = fRowMin = 0; | |
29 | SetParameters(0.001,0.05,10); | |
30 | Is2Global(kFALSE); | |
31 | } | |
32 | ||
33 | ||
34 | AliL3HoughIntMerger::~AliL3HoughIntMerger() | |
35 | { | |
36 | //Destructor | |
37 | ||
38 | } | |
39 | ||
40 | void AliL3HoughIntMerger::SetParameters(Double_t maxkappa, Double_t maxphi0, Double_t maxtgl) | |
41 | { | |
42 | fMaxKappa = maxkappa; | |
43 | fMaxPhi0 = maxphi0; | |
44 | fMaxTgl = maxtgl; | |
45 | } | |
46 | ||
47 | void AliL3HoughIntMerger::FillTracks(AliL3TrackArray *tracks) | |
48 | { | |
49 | if(tracks->GetNTracks()==0) | |
50 | LOG(AliL3Log::kWarning,"AliL3HoughIntMerger::FillTracks","Track Array") | |
51 | <<"Adding empty track array"<<ENDLOG; | |
52 | ||
53 | GetInTracks(0)->AddTracks(tracks,kFALSE);//Copy tracks | |
54 | printf("Filling %d tracks to intermerger\n",tracks->GetNTracks()); | |
55 | } | |
56 | ||
57 | Bool_t AliL3HoughIntMerger::IsTrack(AliL3Track *innertrack,AliL3Track *outertrack) | |
58 | { | |
59 | //Check if the tracks can be merged, called by the track merger | |
60 | ||
61 | AliL3HoughTrack *tr1 = (AliL3HoughTrack*)innertrack; | |
62 | AliL3HoughTrack *tr2 = (AliL3HoughTrack*)outertrack; | |
63 | ||
64 | if(abs(tr1->GetEtaIndex() - tr2->GetEtaIndex()) > 1) return kFALSE; | |
65 | if(tr1->GetCharge()!=tr2->GetCharge()) return kFALSE; | |
66 | if(fabs(tr1->GetKappa()-tr2->GetKappa()) >fMaxKappa) return kFALSE; | |
67 | if(fabs(tr1->GetPhi0()-tr2->GetPhi0()) > fMaxPhi0) return kFALSE; | |
68 | ||
69 | return kTRUE;//Tracks could be merged | |
70 | } | |
71 | ||
72 | AliL3Track *AliL3HoughIntMerger::MultiMerge(AliL3TrackArray *mergedtrack,AliL3Track **tracks, Int_t ntrack) | |
73 | { | |
74 | //Called by the track merger | |
75 | ||
76 | AliL3HoughTrack *newtrack = (AliL3HoughTrack*)mergedtrack->NextTrack(); | |
77 | AliL3HoughTrack **trs = (AliL3HoughTrack**)tracks; | |
78 | ||
79 | AliL3HoughTrack *tpt=trs[0];//this is the "best" track | |
80 | //AliL3HoughTrack *tpl=trs[ntrack-1]; | |
81 | newtrack->Set(tpt); | |
82 | return (AliL3Track*)newtrack; | |
83 | } | |
84 | ||
85 | ||
86 | ||
87 | void AliL3HoughIntMerger::MMerge() | |
88 | { | |
89 | GetInTracks(0)->QSort(); | |
90 | while(Merge()); | |
91 | GetOutTracks()->AddTracks(GetInTracks(0)); | |
92 | } | |
93 | ||
94 | Int_t AliL3HoughIntMerger::Merge() | |
95 | { | |
96 | ||
97 | AliL3TrackArray * tracks = GetInTracks(0); | |
98 | const Int_t kNIn =tracks->GetNTracks(); | |
99 | AliL3Track *tr[2]; | |
100 | ||
101 | for(Int_t out=0;out<kNIn;out++) | |
102 | { | |
103 | AliL3HoughTrack *outertrack=(AliL3HoughTrack*)tracks->GetCheckedTrack(out); | |
104 | if(!outertrack) continue; | |
105 | for(Int_t in=0;in<kNIn;in++) | |
106 | { | |
107 | if(in==out) continue; | |
108 | AliL3HoughTrack *innertrack=(AliL3HoughTrack*)tracks->GetCheckedTrack(in); | |
109 | if(!innertrack) continue; | |
110 | if(IsTrack(innertrack,outertrack)) | |
111 | { | |
112 | tr[0]=innertrack; | |
113 | tr[1]=outertrack; | |
114 | SortTracks(tr,2); | |
115 | Print(tr); | |
116 | MultiMerge(tracks,tr,2); | |
117 | tracks->Remove(out); | |
118 | tracks->Remove(in); | |
119 | break; | |
120 | } | |
121 | } | |
122 | } | |
123 | Int_t nmerged = tracks->GetNTracks()-kNIn; | |
124 | LOG(AliL3Log::kInformational,"AliL3HoughIntMerger::Merge","Result") | |
125 | <<AliL3Log::kDec<<"Merged Tracks: "<<nmerged<<ENDLOG; | |
126 | ||
127 | //add in tracks | |
128 | //GetOutTracks()->AddTracks(GetInTracks(0)); | |
129 | ||
130 | return nmerged; | |
131 | } | |
132 | ||
133 | void AliL3HoughIntMerger::Print(AliL3Track **tracks) | |
134 | { | |
135 | AliL3HoughTrack *tr1 = (AliL3HoughTrack*)tracks[0]; | |
136 | AliL3HoughTrack *tr2 = (AliL3HoughTrack*)tracks[1]; | |
137 | Double_t kappadiff = fabs(tr1->GetKappa()-tr2->GetKappa()); | |
138 | Double_t phi0diff = fabs(tr1->GetPhi0()-tr2->GetPhi0()); | |
139 | cout << "---------Difference in intermerged tracks---------"<<endl; | |
140 | cout << "Kappa: "<<kappadiff<<" Phi0 : "<<phi0diff<<endl; | |
141 | ||
142 | } | |
143 | ||
144 | void AliL3HoughIntMerger::SortTracks(AliL3Track **trs, Int_t ntrack) | |
145 | { | |
146 | //Sort the tracks according to their weight | |
147 | ||
148 | AliL3HoughTrack **tracks = (AliL3HoughTrack**)trs; | |
149 | AliL3HoughTrack **tmp = new AliL3HoughTrack*[ntrack]; | |
150 | for(Int_t i=0;i<ntrack;i++) tmp[i] = (AliL3HoughTrack*)tracks[i]; | |
151 | Int_t *t = new Int_t[ntrack]; | |
152 | for(Int_t i=0;i<ntrack;i++) t[i]=-1; | |
153 | ||
154 | for(Int_t j=0;j<ntrack;j++) | |
155 | { | |
156 | Double_t maxw=0; | |
157 | Int_t maxi=0; | |
158 | for(Int_t i=0;i<ntrack;i++) | |
159 | { | |
160 | if(!tracks[i]) continue; | |
161 | if(tracks[i]->GetWeight() > maxw) | |
162 | { | |
163 | maxw=tracks[i]->GetWeight(); | |
164 | maxi=i; | |
165 | } | |
166 | } | |
167 | t[j]=maxi; | |
168 | tracks[maxi]=0; | |
169 | } | |
170 | for(Int_t i=0;i<ntrack;i++) tracks[i] = tmp[t[i]]; | |
171 | delete[] t; | |
172 | delete[] tmp; | |
173 | } |