3 // Author: Uli Frankenfeld <mailto:franken@fi.uib.no>
4 //*-- Copyright © ALICE HLT Group
6 #include "AliL3StandardIncludes.h"
8 #include "AliL3Logging.h"
9 #include "AliL3GlobalMerger.h"
10 #include "AliL3Track.h"
11 #include "AliL3Transform.h"
12 #include "AliL3TrackArray.h"
14 /** \class AliL3GlobalMerger
16 //_____________________________________________________________
19 // The L3 Slice merger
28 ClassImp(AliL3GlobalMerger)
30 AliL3GlobalMerger::AliL3GlobalMerger()
32 //Default constructor. Use Setup to specify and setup the necessary parameters and arrays.
34 SetParameter(0,0,0,0,0);
41 AliL3GlobalMerger::~AliL3GlobalMerger()
46 void AliL3GlobalMerger::Setup(Int_t first,Int_t last)
48 //Used to setup the arrays and everything
50 fNSlices = last-first+1;
53 InitMerger(last-first+1);
56 void AliL3GlobalMerger::InitSlice(Int_t slice)
59 // Select Sector The following FillTracks call will
63 fCurrentTracks = fSlice - fFirst;
66 Double_t AliL3GlobalMerger::CheckTracks(AliL3Track *innertrack,AliL3Track *outertrack,Int_t slice)
68 //Compare the tracks by propagating the outermost track to the last and first point plane
69 //of the innermost track. This plane is defined by the padrow plane where these points
72 if(innertrack->GetCharge()!=outertrack->GetCharge()) return -1;
74 Float_t angle = 0;//perpendicular to the padrowplane (in local system)
75 AliL3Transform::Local2GlobalAngle(&angle,slice);
76 Double_t dx[2],dy[2],dz[2];
78 AliL3Track *tracks[2];
79 tracks[0] = innertrack;
80 tracks[1] = outertrack;
81 SortGlobalTracks(tracks,2);
82 innertrack = tracks[0];
83 outertrack = tracks[1];
87 point[0]=innertrack->GetLastPointX();
88 point[1]=innertrack->GetLastPointY();
89 point[2]=innertrack->GetLastPointZ();
90 AliL3Transform::Global2LocHLT(point,slice);
92 outertrack->CalculateReferencePoint(angle,point[0]);//local x = global distance to padrowplane
93 if(!outertrack->IsPoint()) return diff;
94 dx[0] = fabs(outertrack->GetPointX()-innertrack->GetLastPointX());
95 dy[0] = fabs(outertrack->GetPointY()-innertrack->GetLastPointY());
96 dz[0] = fabs(outertrack->GetPointZ()-innertrack->GetLastPointZ());
98 point[0]=innertrack->GetFirstPointX();
99 point[1]=innertrack->GetFirstPointY();
100 point[2]=innertrack->GetFirstPointZ();
101 AliL3Transform::Global2LocHLT(point,slice);
103 outertrack->CalculateReferencePoint(angle,point[0]);//local x = global distance to padrowplane
104 if(!outertrack->IsPoint()) return diff;
105 dx[1] = fabs(outertrack->GetPointX()-innertrack->GetFirstPointX());
106 dy[1] = fabs(outertrack->GetPointY()-innertrack->GetFirstPointY());
107 dz[1] = fabs(outertrack->GetPointZ()-innertrack->GetFirstPointZ());
109 diff=0;//This was a tough bug to find....
110 for(Int_t i=0; i<2; i++)
111 diff += sqrt(dx[i]*dx[i] + dy[i]*dy[i] + dz[i]*dz[i]);
115 void AliL3GlobalMerger::SlowMerge(Char_t *path)
117 //Tuning of parameters. This matches _all_ tracks between two neighbouring
118 //slices, and merges the ones which are closest in space. The difference
119 //is written to a ntuppel, which can be used as a input for the SetParameters
120 //when using normal Merge function.
123 void* ntuple=GetNtuple();
124 AliL3Track *track[2];
125 AliL3TrackArray *tout = GetOutTracks();
128 LOG(AliL3Log::kWarning,"AliL3GlobalMerger::SlowMerge","Slice Number")
129 <<"Need more than one Slice!"<<ENDLOG;
133 for(Int_t i=0; i<fNSlices; i++)
135 //if(fNSlices!=18 && i+1 == fNSlices) continue;
136 Int_t slice = fFirst + i;
137 AliL3TrackArray *ttt0=GetInTracks(i);
139 //if(slice2==fNSlices) slice2 =0;
141 //Make sure slices are on the same side of the TPC
142 if(slice2 == 18) slice2=0;
143 else if(slice2 == 36) slice2=18;
144 AliL3TrackArray *ttt1=GetInTracks(slice2);
145 //10 degrees -> the border of the slices in local coordinates
146 Float_t angle = AliL3Transform::Pi()/18;
147 AliL3Transform::Local2GlobalAngle(&angle,slice);
149 //In the two following cases, the angle is 2*pi, so set it back to 0 in order for
150 //the calculation of crossing points to be correct.
151 if(slice==17 || slice==35)
156 for(Int_t s0=0;s0<ttt0->GetNTracks();s0++)
158 AliL3Track *track0=ttt0->GetCheckedTrack(s0);
159 if(!track0) continue;
160 track0->CalculateHelix();
161 track0->CalculateEdgePoint(angle);
162 // if(track0->IsPoint()) AddTrack(tout,track0);
164 for(Int_t s1=0;s1<ttt1->GetNTracks();s1++)
166 AliL3Track *track1=ttt1->GetCheckedTrack(s1);
167 if(!track1) continue;
168 track1->CalculateHelix();
169 track1->CalculateEdgePoint(angle);
170 // if(track1->IsPoint()) AddTrack(tout,track1);
172 Bool_t merge = kTRUE;
175 Int_t min0=-1,min1=-1;
177 Int_t n0=ttt0->GetNTracks(),n1=ttt1->GetNTracks();
178 for(Int_t s0=0;s0<n0;s0++)
180 AliL3Track *track0=ttt0->GetCheckedTrack(s0);
181 if(!track0) continue;
182 if(!track0->IsPoint()) continue;
183 for(Int_t s1=0;s1<n1;s1++)
185 AliL3Track *track1=ttt1->GetCheckedTrack(s1);
186 if(!track1) continue;
187 if(!track1->IsPoint()) continue;
189 //Double_t diff = TrackDiff(track0,track1,angle);
190 Double_t diff = CheckTracks(track0,track1,slice);
191 //PrintDiff(track0,track1);
192 if(diff>=0&&diff<min)
202 AliL3Track *track0=ttt0->GetTrack(min0);
203 AliL3Track *track1=ttt1->GetTrack(min1);
206 SortGlobalTracks(track,2);
207 track1->CalculateEdgePoint((angle+AliL3Transform::Pi()/9));
208 if(track1->IsPoint())//Check if the track will cross the boundary of yet another slice.
209 MultiMerge(ttt1,track,2);
211 MultiMerge(tout,track,2);
212 track0->CalculateReferencePoint(angle);
213 track1->CalculateReferencePoint(angle);
214 //PrintDiff(track0,track1);
215 FillNtuple(ntuple,track0,track1);
224 LOG(AliL3Log::kInformational,"AliL3GlobalMerger::SlowMerge","Result")
225 <<AliL3Log::kDec<<"Merged Tracks: "<<tout->GetNTracks()<<" at:"
229 sprintf(fname,"%s/merge_parameters.root",path);
230 WriteNtuple(fname,ntuple);
233 void AliL3GlobalMerger::Merge()
235 //Normal merging procedure. Matches tracks which are within limits
236 //set by SetParameters. Parameters can be tuned by SlowMerge.
238 AliL3Track *track[2];
239 AliL3TrackArray *tout = GetOutTracks();
242 LOG(AliL3Log::kWarning,"AliL3GlobalMerger::Merge","Slice Number")
243 <<"Need more than one Slice!"<<ENDLOG;
246 for(Int_t i=0; i<fNSlices; i++)
248 //if(fNSlices!=18 && i+1 == fNSlices) continue;
249 Int_t slice = fFirst + i;
250 AliL3TrackArray *ttt0=GetInTracks(i);
252 //if(slice2==fNSlices) slice2 =0;
254 //Make sure slices are on the same side of the TPC
255 if(slice2 == 18) slice2=0;
256 else if(slice2 == 36) slice2=18;
257 AliL3TrackArray *ttt1=GetInTracks(slice2);
258 //10 degrees -> the border of the slices in local coordinates
259 Float_t angle = AliL3Transform::Pi()/18;
260 AliL3Transform::Local2GlobalAngle(&angle,slice);
262 //In the two following cases, the angle is 2*pi, so set it back to 0 in order for
263 //the calculation of crossing points to be correct.
264 if(slice==17 || slice==35)
269 Bool_t *ismatched0 = new Bool_t[ttt0->GetNTracks()];
270 Bool_t *ismatched1 = new Bool_t[ttt1->GetNTracks()];
272 for(Int_t s0=0;s0<ttt0->GetNTracks();s0++)
274 ismatched0[s0]=kFALSE;
275 AliL3Track *track0=ttt0->GetCheckedTrack(s0);
276 if(!track0) continue;
277 track0->CalculateHelix();
278 track0->CalculateEdgePoint(angle);
279 if(track0->IsPoint())
282 track0->CalculateReferencePoint(angle);
285 for(Int_t s1=0;s1<ttt1->GetNTracks();s1++)
287 ismatched1[s1]=kFALSE;
288 AliL3Track *track1=ttt1->GetCheckedTrack(s1);
289 if(!track1) continue;
290 track1->CalculateHelix();
291 track1->CalculateEdgePoint(angle);
292 if(track1->IsPoint())
295 track1->CalculateReferencePoint(angle);
298 for(Int_t s0=0;s0<ttt0->GetNTracks();s0++)
300 if(ismatched0[s0]) continue;
301 AliL3Track *track0=ttt0->GetCheckedTrack(s0);
302 if(!track0) continue;
303 if(!track0->IsPoint()) continue;
304 for(Int_t s1=0;s1<ttt1->GetNTracks();s1++)
306 if(ismatched1[s1]) continue;
307 AliL3Track *track1=ttt1->GetCheckedTrack(s1);
308 if(!track1) continue;
309 if(!track1->IsPoint()) continue;
310 if(IsRTrack(track0,track1))
314 SortGlobalTracks(track,2);
315 Double_t r0 = pow(track[0]->GetLastPointX(),2)+
316 pow(track[0]->GetLastPointY(),2);
317 Double_t r1 = pow(track[1]->GetFirstPointX(),2)+
318 pow(track[1]->GetFirstPointY(),2);
321 MultiMerge(tout,track,2);
322 ismatched0[s0]=kTRUE;
323 ismatched1[s1]=kTRUE;
328 The track is merged, so we will _not_ look for more matches.
329 Because there could easily be more matches, if a track is being
330 split within the sector....
336 LOG(AliL3Log::kInformational,"AliL3GlobalMerger::Merge","Result")
337 <<AliL3Log::kDec<<"slice0: "<<n0<<" slice1: "<<n1
338 <<" Merged Tracks: "<<tout->GetNTracks()<<ENDLOG;
339 delete [] ismatched0;
340 delete [] ismatched1;