]>
Commit | Line | Data |
---|---|---|
1 | /************************************************************************** | |
2 | * Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. * | |
3 | * * | |
4 | * Author: The ALICE Off-line Project. * | |
5 | * Contributors are mentioned in the code where appropriate. * | |
6 | * * | |
7 | * Permission to use, copy, modify and distribute this software and its * | |
8 | * documentation strictly for non-commercial purposes is hereby granted * | |
9 | * without fee, provided that the above copyright notice appears in all * | |
10 | * copies and that both the copyright notice and this permission notice * | |
11 | * appear in the supporting documentation. The authors make no claims * | |
12 | * about the suitability of this software for any purpose. It is * | |
13 | * provided "as is" without express or implied warranty. * | |
14 | **************************************************************************/ | |
15 | #include <AliITSVertexerPPZ.h> | |
16 | #include <TArrayF.h> | |
17 | #include <TH1F.h> | |
18 | #include <TObjArray.h> | |
19 | #include <TTree.h> | |
20 | #include <TClonesArray.h> | |
21 | #include "AliITSDetTypeRec.h" | |
22 | #include "AliITSgeom.h" | |
23 | #include "AliITSLoader.h" | |
24 | #include "AliITSRecPoint.h" | |
25 | ///////////////////////////////////////////////////////////////////////// | |
26 | // // | |
27 | // This class is intended to compute the Z coordinate of the // | |
28 | // primary vertex for p-p interactions, or in general when the // | |
29 | // number of secondaries is too slow to use the class // | |
30 | // AliITSVertexerIons, which in turn is optimized for A-A collsions // | |
31 | // Origin: masera@to.infn.it 9/12/2002 // | |
32 | // // | |
33 | ///////////////////////////////////////////////////////////////////////// | |
34 | ClassImp(AliITSVertexerPPZ) | |
35 | ||
36 | ||
37 | ||
38 | //______________________________________________________________________ | |
39 | AliITSVertexerPPZ::AliITSVertexerPPZ():AliITSVertexer() { | |
40 | // Default Constructor | |
41 | ||
42 | SetDiffPhiMax(0); | |
43 | fX0 = 0.; | |
44 | fY0 = 0.; | |
45 | SetFirstLayerModules(0); | |
46 | SetSecondLayerModules(0); | |
47 | fZFound = 0; | |
48 | fZsig = 0.; | |
49 | //fITS = 0; | |
50 | SetWindow(0); | |
51 | } | |
52 | ||
53 | AliITSVertexerPPZ::AliITSVertexerPPZ(TString fn, Float_t x0, Float_t y0):AliITSVertexer(fn) { | |
54 | // Standard constructor | |
55 | SetDiffPhiMax(); | |
56 | fX0 = x0; | |
57 | fY0 = y0; | |
58 | SetFirstLayerModules(); | |
59 | SetSecondLayerModules(); | |
60 | fZFound = 0; | |
61 | fZsig = 0.; | |
62 | //fITS = 0; | |
63 | SetWindow(); | |
64 | } | |
65 | ||
66 | //______________________________________________________________________ | |
67 | AliITSVertexerPPZ::~AliITSVertexerPPZ() { | |
68 | // Default Destructor | |
69 | //fITS = 0; | |
70 | } | |
71 | ||
72 | //________________________________________________________ | |
73 | void AliITSVertexerPPZ::EvalZ(TH1F *hist,Int_t sepa, Int_t ncoinc, TArrayF *zval) { | |
74 | ||
75 | //Evaluation of Z | |
76 | Float_t deltaVal = hist->GetBinWidth(1)*fWindow; // max window in Z for searching | |
77 | fZFound=0; | |
78 | fZsig=0; | |
79 | Int_t nN=0; | |
80 | Int_t nbinNotZero=0; | |
81 | Float_t totst = 0.; | |
82 | Float_t totst2 = 0.; | |
83 | Float_t curz = 0.; | |
84 | for(Int_t i=1;i<=sepa;i++){ | |
85 | Float_t cont=hist->GetBinContent(i); | |
86 | if(cont!=0)curz = hist->GetBinLowEdge(i)+0.5*hist->GetBinWidth(i); | |
87 | totst+=cont; | |
88 | totst2+=cont*cont; | |
89 | nN++; | |
90 | if(cont!=0)nbinNotZero++; | |
91 | } | |
92 | if(nbinNotZero==0){fZFound=-100; fZsig=-100; return;} | |
93 | if(nbinNotZero==1){ | |
94 | fZFound = curz; | |
95 | fZsig=0; | |
96 | fCurrentVertex = new AliESDVertex(fZFound,fZsig,nbinNotZero); | |
97 | return; | |
98 | } | |
99 | Float_t errsq = totst2/(nN-1)-totst*totst/nN/(nN-1); | |
100 | if(errsq>=0){ | |
101 | totst2=TMath::Sqrt(errsq); | |
102 | } | |
103 | else { | |
104 | Error("EvalZ","Negative variance: %d - %12.7f - %12.7f",nN,totst2,totst); | |
105 | fZFound=-100; | |
106 | fZsig=-100; | |
107 | return; | |
108 | } | |
109 | totst /= nN; | |
110 | Float_t cut = totst+totst2*2.; | |
111 | if(fDebug>1)cout<<"totst, totst2, cut: "<<totst<<", "<<totst2<<", "<<cut<<endl; | |
112 | Float_t val1=hist->GetBinLowEdge(sepa); | |
113 | Float_t val2=hist->GetBinLowEdge(1); | |
114 | Float_t valm = 0.; | |
115 | Float_t zmax = 0.; | |
116 | for(Int_t i=1;i<=sepa;i++){ | |
117 | Float_t cont=hist->GetBinContent(i); | |
118 | if(cont>valm){ | |
119 | valm = cont; | |
120 | zmax = hist->GetBinLowEdge(i)+0.5*hist->GetBinWidth(1); | |
121 | } | |
122 | if(cont>cut){ | |
123 | curz=hist->GetBinLowEdge(i); | |
124 | if(curz<val1)val1=curz; | |
125 | if(curz>val2)val2=curz; | |
126 | } | |
127 | } | |
128 | val2+=hist->GetBinWidth(1); | |
129 | if((val2-val1)>deltaVal){ | |
130 | val1 = zmax-deltaVal/2.; | |
131 | val2 = zmax+deltaVal/2.; | |
132 | if(fDebug>0)cout<<"val1 and val2 recomputed\n"; | |
133 | } | |
134 | if(fDebug>0)cout<<"Values for Z finding: "<<val1<<" "<<val2<<" "<<val2-val1<<endl; | |
135 | fZFound=0; | |
136 | fZsig=0; | |
137 | nN=0; | |
138 | for(Int_t i=0; i<ncoinc; i++){ | |
139 | Float_t z=zval->At(i); | |
140 | if(z<val1)continue; | |
141 | if(z>val2)continue; | |
142 | ||
143 | fZFound+=z; | |
144 | fZsig+=z*z; | |
145 | /* weights defined by the curvature | |
146 | Float_t wei = 1./curv->At(i); | |
147 | fZFound+=z*wei; | |
148 | fZsig+=wei; | |
149 | */ | |
150 | nN++; | |
151 | } | |
152 | if(nN<1){fZFound=-110; fZsig=-110; return;} | |
153 | if(nN==1){ | |
154 | fZsig = 0; | |
155 | fCurrentVertex = new AliESDVertex(fZFound,fZsig,nN); | |
156 | return; | |
157 | } | |
158 | errsq = (fZsig/(nN-1)-fZFound*fZFound/nN/(nN-1))/nN; | |
159 | if(errsq>=0.){ | |
160 | fZsig=TMath::Sqrt(errsq); | |
161 | } | |
162 | else { | |
163 | Error("evalZ","Negative variance: %d - %12.7f %12.7f",nN,fZsig,fZFound); | |
164 | fZsig=0; | |
165 | } | |
166 | fZFound=fZFound/nN; | |
167 | /* weights defined by the curvature | |
168 | fZsig=1./fZsig; | |
169 | fZFound*=fZsig; | |
170 | fZsig = TMath::Sqrt(fZsig); | |
171 | */ | |
172 | fCurrentVertex = new AliESDVertex(fZFound,fZsig,nN); | |
173 | } | |
174 | ||
175 | //______________________________________________________________________ | |
176 | AliESDVertex* AliITSVertexerPPZ::FindVertexForCurrentEvent(Int_t evnumber){ | |
177 | // Defines the AliESDVertex for the current event | |
178 | fCurrentVertex = 0; | |
179 | fZFound = -999; | |
180 | fZsig = -999; | |
181 | AliRunLoader *rl =AliRunLoader::GetRunLoader(); | |
182 | AliITSLoader* iTSloader = (AliITSLoader*)rl->GetLoader("ITSLoader"); | |
183 | TDirectory * olddir = gDirectory; | |
184 | rl->CdGAFile(); | |
185 | AliITSgeom* geom = (AliITSgeom*)gDirectory->Get("AliITSgeom"); | |
186 | olddir->cd(); | |
187 | ||
188 | AliITSDetTypeRec detTypeRec; | |
189 | ||
190 | if(!geom) { | |
191 | Error("FindVertexForCurrentEvent","ITS geometry is not defined"); | |
192 | return fCurrentVertex; | |
193 | } | |
194 | TTree *tR=0; | |
195 | TClonesArray *itsRec = 0; | |
196 | Float_t lc[3]; for(Int_t ii=0; ii<3; ii++) lc[ii]=0.; | |
197 | Float_t gc[3]; for(Int_t ii=0; ii<3; ii++) gc[ii]=0.; | |
198 | Float_t lc2[3]; for(Int_t ii=0; ii<3; ii++) lc2[ii]=0.; | |
199 | Float_t gc2[3]; for(Int_t ii=0; ii<3; ii++) gc2[ii]=0.; | |
200 | ||
201 | tR = iTSloader->TreeR(); | |
202 | if(!tR){ | |
203 | Error("FindVertexForCurrentEvent","TreeR not found"); | |
204 | return fCurrentVertex; | |
205 | } | |
206 | detTypeRec.SetTreeAddressR(tR); | |
207 | itsRec = detTypeRec.RecPoints(); | |
208 | // missing | |
209 | TClonesArray dummy("AliITSclusterV2",10000), *clusters=&dummy; | |
210 | TBranch *branch; | |
211 | if(fUseV2Clusters){ | |
212 | branch = tR->GetBranch("Clusters"); | |
213 | branch->SetAddress(&clusters); | |
214 | } | |
215 | else { | |
216 | branch = tR->GetBranch("ITSRecPoints"); | |
217 | if(!branch){ | |
218 | branch = tR->GetBranch("ITSRecPointsF"); | |
219 | } | |
220 | } | |
221 | if(!branch){ | |
222 | Error("FindVertexForCurrentEvent","branch for ITS rec points not found"); | |
223 | return fCurrentVertex; | |
224 | } | |
225 | Float_t zave=0; | |
226 | Float_t rmszav=0; | |
227 | Float_t zave2=0; | |
228 | Int_t firipixe=0; | |
229 | for(Int_t module= fFirstL1; module<=fLastL1;module++){ | |
230 | branch->GetEvent(module); | |
231 | if(fUseV2Clusters){ | |
232 | Clusters2RecPoints(clusters,module,itsRec); | |
233 | } | |
234 | Int_t nrecp1 = itsRec->GetEntries(); | |
235 | for(Int_t i=0; i<nrecp1;i++){ | |
236 | AliITSRecPoint *current = (AliITSRecPoint*)itsRec->At(i); | |
237 | lc[0]=current->GetX(); | |
238 | lc[2]=current->GetZ(); | |
239 | geom->LtoG(module,lc,gc); | |
240 | zave+=gc[2]; | |
241 | zave2+=gc[2]*gc[2]; | |
242 | firipixe++; | |
243 | } | |
244 | //fITS->ResetRecPoints(); | |
245 | detTypeRec.ResetRecPoints(); | |
246 | } | |
247 | if(firipixe>1){ | |
248 | rmszav=TMath::Sqrt(zave2/(firipixe-1)-zave*zave/firipixe/(firipixe-1)); | |
249 | zave=zave/firipixe; | |
250 | if(fDebug>1)cout<<"++++++++++++++++++++++++++++++++++++++++++++++++++++++\n Number of firing pixels: "<<firipixe<<endl; | |
251 | } | |
252 | else { | |
253 | fZFound = -200; | |
254 | fZsig = -200; | |
255 | Warning("FindVertexForCurrentEvent","No rec points on first layer for this event"); | |
256 | return fCurrentVertex; | |
257 | } | |
258 | Float_t zlim1=zave-rmszav; | |
259 | Float_t zlim2=zave+rmszav; | |
260 | Int_t sepa=(Int_t)((zlim2-zlim1)*10.+1.); | |
261 | zlim2=zlim1 + sepa/10.; | |
262 | TH1F *zvdis = new TH1F("z_ev","zv distr",sepa,zlim1,zlim2); | |
263 | if(fDebug>0){ | |
264 | cout<<"Z limits: "<<zlim1<<" "<<zlim2<<"; Bins= "<<sepa<<endl; | |
265 | cout<<"Bin width: "<<zvdis->GetBinWidth(1)*10000.<<" micron\n"; | |
266 | } | |
267 | Int_t sizarr=100; | |
268 | TArrayF *zval = new TArrayF(sizarr); | |
269 | // TArrayF *curv = new TArrayF(sizarr); | |
270 | Int_t ncoinc=0; | |
271 | for(Int_t module= fFirstL1; module<=fLastL1;module++){ | |
272 | if(fDebug>0)cout<<"processing module "<<module<<" \r"; | |
273 | branch->GetEvent(module); | |
274 | if(fUseV2Clusters){ | |
275 | Clusters2RecPoints(clusters,module,itsRec); | |
276 | } | |
277 | Int_t nrecp1 = itsRec->GetEntries(); | |
278 | TObjArray *poiL1 = new TObjArray(nrecp1); | |
279 | for(Int_t i=0; i<nrecp1;i++)poiL1->AddAt(itsRec->At(i),i); | |
280 | //fITS->ResetRecPoints(); | |
281 | detTypeRec.ResetRecPoints(); | |
282 | for(Int_t i=0; i<nrecp1;i++){ | |
283 | AliITSRecPoint *current = (AliITSRecPoint*)poiL1->At(i); | |
284 | lc[0]=current->GetX(); | |
285 | lc[2]=current->GetZ(); | |
286 | geom->LtoG(module,lc,gc); | |
287 | gc[0]-=fX0; | |
288 | gc[1]-=fY0; | |
289 | Float_t r1=TMath::Sqrt(gc[0]*gc[0]+gc[1]*gc[1]); | |
290 | Float_t phi1 = TMath::ATan2(gc[1],gc[0]); | |
291 | if(phi1<0)phi1=2*TMath::Pi()+phi1; | |
292 | if(fDebug>1)cout<<"module "<<module<<" "<<gc[0]<<" "<<gc[1]<<" "<<gc[2]<<" "<<phi1<<" \n"; | |
293 | for(Int_t modul2=fFirstL2; modul2<=fLastL2; modul2++){ | |
294 | branch->GetEvent(modul2); | |
295 | if(fUseV2Clusters){ | |
296 | Clusters2RecPoints(clusters,modul2,itsRec); | |
297 | } | |
298 | Int_t nrecp2 = itsRec->GetEntries(); | |
299 | for(Int_t j=0; j<nrecp2;j++){ | |
300 | AliITSRecPoint *recp = (AliITSRecPoint*)itsRec->At(j); | |
301 | lc2[0]=recp->GetX(); | |
302 | lc2[2]=recp->GetZ(); | |
303 | geom->LtoG(modul2,lc2,gc2); | |
304 | gc2[0]-=fX0; | |
305 | gc2[1]-=fY0; | |
306 | Float_t r2=TMath::Sqrt(gc2[0]*gc2[0]+gc2[1]*gc2[1]); | |
307 | Float_t zr0=(r2*gc[2]-r1*gc2[2])/(r2-r1); | |
308 | Float_t phi2 = TMath::ATan2(gc2[1],gc2[0]); | |
309 | if(phi2<0)phi2=2.*TMath::Pi()+phi2; | |
310 | Float_t diff = TMath::Abs(phi2-phi1); | |
311 | if(diff>TMath::Pi())diff=2.*TMath::Pi()-diff; | |
312 | if(zr0>zlim1 && zr0<zlim2){ | |
313 | if(diff<fDiffPhiMax ){ | |
314 | zvdis->Fill(zr0); | |
315 | zval->AddAt(zr0,ncoinc); | |
316 | /* uncomment these lines to use curvature as a weight | |
317 | Float_t cu = Curv(0.,0.,gc[0],gc[1],gc2[0],gc[1]); | |
318 | curv->AddAt(cu,ncoinc); | |
319 | */ | |
320 | ncoinc++; | |
321 | if(ncoinc==(sizarr-1)){ | |
322 | sizarr+=100; | |
323 | zval->Set(sizarr); | |
324 | //uncomment next line to use curvature as weight | |
325 | // curv->Set(sizarr); | |
326 | } | |
327 | } | |
328 | } | |
329 | } | |
330 | //fITS->ResetRecPoints(); | |
331 | detTypeRec.ResetRecPoints(); | |
332 | } | |
333 | } | |
334 | delete poiL1; | |
335 | } // loop on modules | |
336 | if(fDebug>0){ | |
337 | cout<<endl<<"Number of coincidences = "<<ncoinc<<endl; | |
338 | } | |
339 | // EvalZ(zvdis,sepa,ncoinc,zval,curv); | |
340 | EvalZ(zvdis,sepa,ncoinc,zval); | |
341 | delete zvdis; | |
342 | delete zval; | |
343 | // delete curv; | |
344 | if(fCurrentVertex){ | |
345 | char name[30]; | |
346 | sprintf(name,"Vertex_%d",evnumber); | |
347 | // fCurrentVertex->SetName(name); | |
348 | fCurrentVertex->SetTitle("vertexer: PPZ"); | |
349 | } | |
350 | ||
351 | return fCurrentVertex; | |
352 | } | |
353 | ||
354 | //______________________________________________________________________ | |
355 | void AliITSVertexerPPZ::FindVertices(){ | |
356 | // computes the vertices of the events in the range FirstEvent - LastEvent | |
357 | AliRunLoader *rl = AliRunLoader::GetRunLoader(); | |
358 | AliITSLoader* iTSloader = (AliITSLoader*) rl->GetLoader("ITSLoader"); | |
359 | iTSloader->ReloadRecPoints(); | |
360 | for(Int_t i=fFirstEvent;i<=fLastEvent;i++){ | |
361 | cout<<"Processing event "<<i<<endl; | |
362 | rl->GetEvent(i); | |
363 | FindVertexForCurrentEvent(i); | |
364 | if(fCurrentVertex){ | |
365 | WriteCurrentVertex(); | |
366 | } | |
367 | else { | |
368 | if(fDebug>0){ | |
369 | cout<<"Vertex not found for event "<<i<<endl; | |
370 | cout<<"fZFound = "<<fZFound<<", fZsig= "<<fZsig<<endl; | |
371 | } | |
372 | } | |
373 | } | |
374 | } | |
375 | ||
376 | //________________________________________________________ | |
377 | void AliITSVertexerPPZ::PrintStatus() const { | |
378 | // Print current status | |
379 | cout <<"=======================================================\n"; | |
380 | cout <<" First layer first and last modules: "<<fFirstL1<<", "; | |
381 | cout <<fLastL1<<endl; | |
382 | cout <<" Second layer first and last modules: "<<fFirstL2<<", "; | |
383 | cout <<fLastL2<<endl; | |
384 | cout <<" Max Phi difference: "<<fDiffPhiMax<<endl; | |
385 | cout <<" Window for Z search: "<<fWindow<<endl; | |
386 | cout <<" Current Z "<<fZFound<<"; Z sig "<<fZsig<<endl; | |
387 | cout <<" Debug flag: "<<fDebug<<endl; | |
388 | cout<<"First event to be processed "<<fFirstEvent; | |
389 | cout<<"\n Last event to be processed "<<fLastEvent<<endl; | |
390 | } | |
391 | ||
392 | //________________________________________________________ | |
393 | Float_t AliITSVertexerPPZ::Curv(Double_t x1,Double_t y1, | |
394 | Double_t x2,Double_t y2, | |
395 | Double_t x3,Double_t y3) | |
396 | { | |
397 | //----------------------------------------------------------------- | |
398 | // Initial approximation of the track curvature (Y. Belikov) squared | |
399 | //----------------------------------------------------------------- | |
400 | Double_t d=(x2-x1)*(y3-y2)-(x3-x2)*(y2-y1); | |
401 | Double_t a=0.5*((y3-y2)*(y2*y2-y1*y1+x2*x2-x1*x1)- | |
402 | (y2-y1)*(y3*y3-y2*y2+x3*x3-x2*x2)); | |
403 | Double_t b=0.5*((x2-x1)*(y3*y3-y2*y2+x3*x3-x2*x2)- | |
404 | (x3-x2)*(y2*y2-y1*y1+x2*x2-x1*x1)); | |
405 | ||
406 | Double_t xr=TMath::Abs(d/(d*x1-a)), yr=d/(d*y1-b); | |
407 | ||
408 | Float_t val = (Float_t)(( -xr*yr/TMath::Sqrt(xr*xr+yr*yr)) | |
409 | *( -xr*yr/TMath::Sqrt(xr*xr+yr*yr))); | |
410 | return val; | |
411 | } |