]> git.uio.no Git - u/mrichter/AliRoot.git/blame - ITS/AliITSVertexer3D.cxx
git://git.uio.no / u / mrichter / AliRoot.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Updated DA from Brigitte. Steerable clock range for pedestal evaluation - default...
[u/mrichter/AliRoot.git] / ITS / AliITSVertexer3D.cxx
CommitLineData
70c95f95 1/**************************************************************************
2 * Copyright(c) 2006-2008, 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 **************************************************************************/
70c95f95 15#include <TTree.h>
b21c1af0 16#include "AliRunLoader.h"
6a0d56b8 17#include "AliESDVertex.h"
cd706e57 18#include "AliLog.h"
6a0d56b8 19#include "AliStrLine.h"
20#include "AliTracker.h"
70c95f95 21#include "AliITSDetTypeRec.h"
22#include "AliITSRecPoint.h"
b21c1af0 23#include "AliITSRecPointContainer.h"
32e63e47 24#include "AliITSgeomTGeo.h"
6a0d56b8 25#include "AliVertexerTracks.h"
26#include "AliITSVertexer3D.h"
0b7bac55 27#include "AliITSVertexerZ.h"
6b4d9537 28#include "AliITSSortTrkl.h"
70c95f95 29/////////////////////////////////////////////////////////////////
30// this class implements a method to determine
31// the 3 coordinates of the primary vertex
32// for p-p collisions
33// It can be used successfully with Pb-Pb collisions
34////////////////////////////////////////////////////////////////
35
36ClassImp(AliITSVertexer3D)
37
6a0d56b8 38/* $Id$ */
39
70c95f95 40//______________________________________________________________________
7d766abb 41AliITSVertexer3D::AliITSVertexer3D():
42 AliITSVertexer(),
43 fLines("AliStrLine",1000),
44 fVert3D(),
45 fCoarseDiffPhiCut(0.),
46 fFineDiffPhiCut(0.),
47 fCutOnPairs(0.),
48 fCoarseMaxRCut(0.),
49 fMaxRCut(0.),
87104b06 50 fMaxRCut2(0.),
7d766abb 51 fZCutDiamond(0.),
52 fMaxZCut(0.),
53 fDCAcut(0.),
54 fDiffPhiMax(0.),
55 fMeanPSelTrk(0.),
56 fMeanPtSelTrk(0.),
57 fUsedCluster(kMaxCluPerMod*kNSPDMod),
58 fZHisto(0),
59 fDCAforPileup(0.),
c238ba33 60 fDiffPhiforPileup(0.),
7d766abb 61 fBinSizeR(0.),
62 fBinSizeZ(0.),
63 fPileupAlgo(0)
6a0d56b8 64{
70c95f95 65 // Default constructor
66 SetCoarseDiffPhiCut();
6b4d9537 67 SetFineDiffPhiCut();
68 SetCutOnPairs();
05d1294c 69 SetCoarseMaxRCut();
70c95f95 70 SetMaxRCut();
87104b06 71 SetMaxRCutAlgo2();
70c95f95 72 SetZCutDiamond();
05d1294c 73 SetMaxZCut();
7203e11a 74 SetDCACut();
70c95f95 75 SetDiffPhiMax();
6a0d56b8 76 SetMeanPSelTracks();
77 SetMeanPtSelTracks();
cd1c2af1 78 SetMinDCAforPileup();
c238ba33 79 SetDeltaPhiforPileup();
cd1c2af1 80 SetPileupAlgo();
7d766abb 81 SetBinSizeR();
82 SetBinSizeZ();
242c8025 83 Double_t binsize=0.02; // default 200 micron
cd1c2af1 84 Int_t nbins=static_cast<Int_t>(1+2*fZCutDiamond/binsize);
85 fZHisto=new TH1F("hz","",nbins,-fZCutDiamond,-fZCutDiamond+binsize*nbins);
70c95f95 86}
87
70c95f95 88//______________________________________________________________________
89AliITSVertexer3D::~AliITSVertexer3D() {
90 // Destructor
f5f6da22 91 fLines.Clear("C");
cd1c2af1 92 if(fZHisto) delete fZHisto;
70c95f95 93}
94
27167524 95//______________________________________________________________________
96void AliITSVertexer3D::ResetVert3D(){
97 //
6b4d9537 98 ResetVertex();
27167524 99 fVert3D.SetXv(0.);
100 fVert3D.SetYv(0.);
101 fVert3D.SetZv(0.);
102 fVert3D.SetDispersion(0.);
103 fVert3D.SetNContributors(0);
cd1c2af1 104 fUsedCluster.ResetAllBits(0);
27167524 105}
70c95f95 106//______________________________________________________________________
308c2f7c 107AliESDVertex* AliITSVertexer3D::FindVertexForCurrentEvent(TTree *itsClusterTree){
70c95f95 108 // Defines the AliESDVertex for the current event
27167524 109 ResetVert3D();
308c2f7c 110 AliDebug(1,"FindVertexForCurrentEvent - 3D - PROCESSING NEXT EVENT");
6b4d9537 111 fLines.Clear("C");
112 fCurrentVertex = NULL;
70c95f95 113
308c2f7c 114 Int_t nolines = FindTracklets(itsClusterTree,0);
87104b06 115 Int_t rc;
0b7bac55 116 if(nolines>=2){
87104b06 117 rc=Prepare3DVertex(0);
118 if(fVert3D.GetNContributors()>0){
119 fLines.Clear("C");
46004624 120 nolines = FindTracklets(itsClusterTree,1);
87104b06 121 if(nolines>=2){
122 rc=Prepare3DVertex(1);
123 if(fPileupAlgo == 2 && rc == 0) FindVertex3DIterative();
124 else if(fPileupAlgo<2 && rc == 0) FindVertex3D(itsClusterTree);
125 if(rc!=0) fVert3D.SetNContributors(0); // exclude this vertex
126 }
127 }
0b7bac55 128 }
6b4d9537 129
0b7bac55 130 if(!fCurrentVertex){
131 AliITSVertexerZ vertz(GetNominalPos()[0],GetNominalPos()[1]);
b96ee725 132 vertz.SetDetTypeRec(GetDetTypeRec());
0b7bac55 133 AliDebug(1,"Call Vertexer Z\n");
cc282e54 134 vertz.SetLowLimit(-fZCutDiamond);
135 vertz.SetHighLimit(fZCutDiamond);
0b7bac55 136 AliESDVertex* vtxz = vertz.FindVertexForCurrentEvent(itsClusterTree);
137 if(vtxz){
138 Double_t position[3]={GetNominalPos()[0],GetNominalPos()[1],vtxz->GetZv()};
139 Double_t covmatrix[6];
140 vtxz->GetCovMatrix(covmatrix);
141 Double_t chi2=99999.;
142 Int_t nContr=vtxz->GetNContributors();
143 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
144 fCurrentVertex->SetTitle("vertexer: Z");
145 fCurrentVertex->SetName("SPDVertexZ");
146 delete vtxz;
0b7bac55 147 }
148
70c95f95 149 }
308c2f7c 150 FindMultiplicity(itsClusterTree);
70c95f95 151 return fCurrentVertex;
152}
153
6b4d9537 154//______________________________________________________________________
155void AliITSVertexer3D::FindVertex3D(TTree *itsClusterTree){
87104b06 156
0496a544 157 Double_t vRadius=TMath::Sqrt(fVert3D.GetXv()*fVert3D.GetXv()+fVert3D.GetYv()*fVert3D.GetYv());
6b4d9537 158 if(vRadius<GetPipeRadius() && fVert3D.GetNContributors()>0){
159 Double_t position[3]={fVert3D.GetXv(),fVert3D.GetYv(),fVert3D.GetZv()};
160 Double_t covmatrix[6];
161 fVert3D.GetCovMatrix(covmatrix);
162 Double_t chi2=99999.;
163 Int_t nContr=fVert3D.GetNContributors();
164 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
165 fCurrentVertex->SetTitle("vertexer: 3D");
166 fCurrentVertex->SetName("SPDVertex3D");
167 fCurrentVertex->SetDispersion(fVert3D.GetDispersion());
168 fNoVertices=1;
169
170 switch(fPileupAlgo){
171 case 0: PileupFromZ(); break;
172 case 1: FindOther3DVertices(itsClusterTree); break;
173 default: AliError("Wrong pileup algorithm"); break;
174 }
175 if(fNoVertices==1){
176 fVertArray = new AliESDVertex[1];
177 fVertArray[0]=(*fCurrentVertex);
178 }
179 }
180}
181
182//______________________________________________________________________
183void AliITSVertexer3D::FindVertex3DIterative(){
87104b06 184 //
185
186 Int_t nLines=fLines.GetEntriesFast();
187 Int_t maxPoints=nLines*(nLines-1)/2;
188 Double_t* xP=new Double_t[maxPoints];
189 Double_t* yP=new Double_t[maxPoints];
190 Double_t* zP=new Double_t[maxPoints];
191 Int_t* index1=new Int_t[maxPoints];
192 Int_t* index2=new Int_t[maxPoints];
193 Double_t xbeam=fVert3D.GetXv();
194 Double_t ybeam=fVert3D.GetYv();
195
196 Int_t iPoint=0;
197 for(Int_t ilin1=0; ilin1<nLines; ilin1++){
198 AliStrLine *l1 = (AliStrLine*)fLines.At(ilin1);
199 for(Int_t ilin2=ilin1+1; ilin2<nLines; ilin2++){
200 AliStrLine *l2 = (AliStrLine*)fLines.At(ilin2);
201 Double_t dca=l1->GetDCA(l2);
202 if(dca > fDCAcut || dca<0.00001) continue;
203 Double_t point[3];
204 Int_t retc = l1->Cross(l2,point);
205 if(retc<0)continue;
206 Double_t rad=TMath::Sqrt(point[0]*point[0]+point[1]*point[1]);
207 if(rad>fCoarseMaxRCut)continue;
208 Double_t distFromBeam=TMath::Sqrt((point[0]-xbeam)*(point[0]-xbeam)+(point[1]-ybeam)*(point[1]-ybeam));
209 if(distFromBeam>fMaxRCut2) continue;
210 xP[iPoint]=point[0];
211 yP[iPoint]=point[1];
212 zP[iPoint]=point[2];
213 index1[iPoint]=ilin1;
214 index2[iPoint]=ilin2;
215 iPoint++;
216 }
217 }
218 Int_t npoints=iPoint++;
219 Int_t index=0;
220 Short_t* mask=new Short_t[npoints];
221 for(Int_t ip=0;ip<npoints;ip++) mask[ip]=-1;
222
223 for(Int_t ip1=0;ip1<npoints;ip1++){
224 if(mask[ip1]==-1) mask[ip1]=index++;
225 for(Int_t ip2=ip1+1; ip2<npoints; ip2++){
226 if(mask[ip2]==mask[ip1] && mask[ip2]!=-1) continue;
227 Double_t dist2=(xP[ip1]-xP[ip2])*(xP[ip1]-xP[ip2]);
228 dist2+=(yP[ip1]-yP[ip2])*(yP[ip1]-yP[ip2]);
229 dist2+=(zP[ip1]-zP[ip2])*(zP[ip1]-zP[ip2]);
230 if(dist2<fCutOnPairs*fCutOnPairs){
231 if(mask[ip2]==-1) mask[ip2]=mask[ip1];
232 else{
233 for(Int_t ip=0; ip<npoints;ip++){
234 if(mask[ip]==mask[ip2]) mask[ip]=mask[ip1];
235 }
236 }
237 }
238 }
239 }
240
241
242 // Count multiplicity of trackelts in clusters
243 UInt_t* isIndUsed=new UInt_t[index+1];
244 for(Int_t ind=0;ind<index+1;ind++) isIndUsed[ind]=0;
245 for(Int_t ip=0; ip<npoints;ip++){
246 Int_t ind=mask[ip];
247 isIndUsed[ind]++;
248 }
249
250 // Count clusters/vertices and sort according to multiplicity
251 Int_t nClusters=0;
252 Int_t* sortedIndex=new Int_t[index+1];
253 for(Int_t ind1=0;ind1<index+1;ind1++){
254 if(isIndUsed[ind1]<=1) isIndUsed[ind1]=0;
255 else nClusters++;
256 UInt_t cap=9999999;
257 if(ind1>0) cap=isIndUsed[sortedIndex[ind1-1]];
258 UInt_t bigger=0;
259 Int_t biggerindex=-1;
260 for(Int_t ind2=0;ind2<index+1;ind2++){
261 Bool_t use=kTRUE;
262 for(Int_t ind3=0; ind3<ind1; ind3++)
263 if(ind2==sortedIndex[ind3]) use=kFALSE;
264 if(use && isIndUsed[ind2]>bigger && isIndUsed[ind2]<=cap){
265 bigger=isIndUsed[ind2];
266 biggerindex=ind2;
267 }
268 }
269 sortedIndex[ind1]=biggerindex;
270 }
271 AliDebug(3,Form("Number of clusters before merging = %d\n",nClusters));
272
273 // Assign lines to clusters/vertices and merge clusters which share 1 line
274 Int_t nClustersAfterMerge=nClusters;
275 Int_t* belongsTo=new Int_t[nLines];
276 for(Int_t ilin=0; ilin<nLines; ilin++) belongsTo[ilin]=-1;
277 for(Int_t iclu=0;iclu<nClusters;iclu++){
278 Int_t actualCluIndex=iclu;
279 for(Int_t ip=0; ip<npoints;ip++){
280 if(mask[ip]==sortedIndex[iclu]){
281 Int_t ind1=index1[ip];
282 if(belongsTo[ind1]==-1) belongsTo[ind1]=actualCluIndex;
283 else if(belongsTo[ind1]<actualCluIndex){
284 Int_t newCluIndex=belongsTo[ind1];
285 for(Int_t ilin=0; ilin<nLines; ilin++){
286 if(belongsTo[ilin]==actualCluIndex) belongsTo[ilin]=newCluIndex;
287 }
288 AliDebug(10,Form("Merged cluster %d with %d\n",actualCluIndex,newCluIndex));
289 actualCluIndex=newCluIndex;
290 nClustersAfterMerge--;
291 }
292 Int_t ind2=index2[ip];
293 if(belongsTo[ind2]==-1) belongsTo[ind2]=actualCluIndex;
294 else if(belongsTo[ind2]<actualCluIndex){
295 Int_t newCluIndex=belongsTo[ind2];
296 for(Int_t ilin=0; ilin<nLines; ilin++){
297 if(belongsTo[ilin]==actualCluIndex) belongsTo[ilin]=newCluIndex;
298 }
299 AliDebug(10,Form("Merged cluster %d with %d\n",actualCluIndex,newCluIndex));
300 actualCluIndex=newCluIndex;
301 nClustersAfterMerge--;
302 }
303 }
304 }
305 }
306 AliDebug(3,Form("Number of clusters after merging = %d\n",nClustersAfterMerge));
307
308 // Count lines associated to each cluster/vertex
309 UInt_t *cluSize=new UInt_t[nClusters];
310 for(Int_t iclu=0;iclu<nClusters;iclu++){
311 cluSize[iclu]=0;
312 for(Int_t ilin=0; ilin<nLines; ilin++){
313 if(belongsTo[ilin]==iclu) cluSize[iclu]++;
314 }
315 }
316
317 // Count good vertices (>1 associated tracklet)
318 UInt_t nGoodVert=0;
319 for(Int_t iclu=0;iclu<nClusters;iclu++){
320 AliDebug(3,Form("Vertex %d Size=%d\n",iclu,cluSize[iclu]));
321 if(cluSize[iclu]>1) nGoodVert++;
322 }
323
324 AliDebug(1,Form("Number of good vertices = %d\n",nGoodVert));
325 // Calculate vertex coordinates for each cluster
326 if(nGoodVert>0){
327 fVertArray = new AliESDVertex[nGoodVert];
328 Int_t iVert=0;
329 for(Int_t iclu=0;iclu<nClusters;iclu++){
330 Int_t size=cluSize[iclu];
331 if(size>1){
332 AliStrLine **arrlin = new AliStrLine*[size];
333 Int_t nFilled=0;
334 for(Int_t ilin=0; ilin<nLines; ilin++){
335 if(belongsTo[ilin]==iclu){
336 arrlin[nFilled++] = dynamic_cast<AliStrLine*>(fLines[ilin]);
337 }
338 }
339 AliDebug(3,Form("Vertex %d N associated tracklets = %d out of %d\n",iVert,size,nFilled));
340
341 fVertArray[iVert]=AliVertexerTracks::TrackletVertexFinder(arrlin,nFilled);
342 Double_t peak[3];
343 fVertArray[iVert].GetXYZ(peak);
344 AliStrLine **arrlin2 = new AliStrLine*[size];
345 Int_t nFilled2=0;
346 for(Int_t i=0; i<nFilled;i++){
347 AliStrLine *l1 = arrlin[i];
348 if(l1->GetDistFromPoint(peak)< fDCAcut)
349 arrlin2[nFilled2++] = dynamic_cast<AliStrLine*>(l1);
350 }
351 if(nFilled2>1){
352 AliDebug(3,Form("Vertex %d recalculated with %d tracklets\n",iVert,nFilled2));
353 fVertArray[iVert]=AliVertexerTracks::TrackletVertexFinder(arrlin2,nFilled2);
354 }
355 delete [] arrlin;
356 delete [] arrlin2;
357 ++iVert;
358 }
359 }
360
361 if(nGoodVert > 1){
362 fIsPileup = kTRUE;
363 fNTrpuv = fVertArray[1].GetNContributors();
364 fZpuv = fVertArray[1].GetZv();
365 }
366
367 Double_t vRadius=TMath::Sqrt(fVertArray[0].GetXv()*fVertArray[0].GetXv()+fVertArray[0].GetYv()*fVertArray[0].GetYv());
368 if(vRadius<GetPipeRadius() && fVertArray[0].GetNContributors()>0){
369 Double_t position[3]={fVertArray[0].GetXv(),fVertArray[0].GetYv(),fVertArray[0].GetZv()};
370 Double_t covmatrix[6];
371 fVertArray[0].GetCovMatrix(covmatrix);
372 Double_t chi2=99999.;
373 Int_t nContr=fVertArray[0].GetNContributors();
374 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
375 fCurrentVertex->SetTitle("vertexer: 3D");
376 fCurrentVertex->SetName("SPDVertex3D");
377 fCurrentVertex->SetDispersion(fVertArray[0].GetDispersion());
378 }
379 }
380
381 delete [] index1;
382 delete [] index2;
383 delete [] mask;
384 delete [] isIndUsed;
385 delete [] sortedIndex;
386 delete [] belongsTo;
387 delete [] cluSize;
388 delete [] xP;
389 delete [] yP;
390 delete [] zP;
391}
392//______________________________________________________________________
393void AliITSVertexer3D::FindVertex3DIterativeMM(){
6b4d9537 394 // Defines the AliESDVertex for the current event
395 Int_t numsor=fLines.GetEntriesFast()*(fLines.GetEntriesFast()-1)/2;
396 //cout<<"AliITSVertexer3D::FindVertexForCurentEvent: Number of tracklets selected for vertexing "<<fLines.GetEntriesFast()<<"; Number of pairs: "<<numsor<<endl;
397 AliITSSortTrkl srt(fLines,numsor,fCutOnPairs,fCoarseMaxRCut);
398 srt.FindClusters();
399 AliInfo(Form("Number of vertices: %d",srt.GetNumberOfClusters()));
400
401 fNoVertices = srt.GetNumberOfClusters();
402 //printf("fNoVertices = %d \n",fNoVertices);
403 if(fNoVertices>0){
404 fVertArray = new AliESDVertex[fNoVertices];
405 for(Int_t kk=0; kk<srt.GetNumberOfClusters(); kk++){
406 Int_t size = 0;
407 Int_t *labels = srt.GetTrackletsLab(kk,size);
408 /*
409 Int_t *pairs = srt.GetClusters(kk);
410 Int_t nopai = srt.GetSizeOfCluster(kk);
411 cout<<"***** Vertex number "<<kk<<". Pairs: \n";
412 for(Int_t jj=0;jj<nopai;jj++){
413 cout<<pairs[jj]<<" - ";
414 if(jj>0 & jj%8==0)cout<<endl;
415 }
416 cout<<endl;
417 cout<<"***** Vertex number "<<kk<<". Labels: \n";
418 */
419 AliStrLine **tclo = new AliStrLine* [size];
420 for(Int_t jj=0;jj<size;jj++){
421 // cout<<labels[jj]<<" - ";
422 // if(jj>0 & jj%8==0)cout<<endl;
423 tclo[jj] = dynamic_cast<AliStrLine*>(fLines[labels[jj]]);
424 }
425 // cout<<endl;
426 delete []labels;
427 fVertArray[kk]=AliVertexerTracks::TrackletVertexFinder(tclo,size);
428 delete [] tclo;
429 // fVertArray[kk].PrintStatus();
430 if(kk == 1){
431 // at least one second vertex is present
432 fIsPileup = kTRUE;
433 fNTrpuv = fVertArray[kk].GetNContributors();
434 fZpuv = fVertArray[kk].GetZv();
435 }
436 }
0496a544 437 Double_t vRadius=TMath::Sqrt(fVertArray[0].GetXv()*fVertArray[0].GetXv()+fVertArray[0].GetYv()*fVertArray[0].GetYv());
6b4d9537 438 if(vRadius<GetPipeRadius() && fVertArray[0].GetNContributors()>0){
439 Double_t position[3]={fVertArray[0].GetXv(),fVertArray[0].GetYv(),fVertArray[0].GetZv()};
440 Double_t covmatrix[6];
441 fVertArray[0].GetCovMatrix(covmatrix);
442 Double_t chi2=99999.;
443 Int_t nContr=fVertArray[0].GetNContributors();
444 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
445 fCurrentVertex->SetTitle("vertexer: 3D");
446 fCurrentVertex->SetName("SPDVertex3D");
447 fCurrentVertex->SetDispersion(fVertArray[0].GetDispersion());
448 }
449 }
450
451}
452
453//______________________________________________________________________
454Bool_t AliITSVertexer3D::DistBetweenVertices(AliESDVertex &a, AliESDVertex &b, Double_t test, Double_t &dist){
455 // method to compare the distance between vertices a and b with "test"
456 //it returns kTRUE is the distance is less or equal to test
457 dist = (a.GetX()-b.GetX()) * (a.GetX()-b.GetX());
458 dist += (a.GetY()-b.GetY()) * (a.GetY()-b.GetY());
459 dist += (a.GetZ()-b.GetZ()) * (a.GetZ()-b.GetZ());
460 dist = TMath::Sqrt(dist);
461 if(dist <= test)return kTRUE;
462 return kFALSE;
463}
464
465
70c95f95 466//______________________________________________________________________
308c2f7c 467Int_t AliITSVertexer3D::FindTracklets(TTree *itsClusterTree, Int_t optCuts){
70c95f95 468 // All the possible combinations between recpoints on layer 1and 2 are
469 // considered. Straight lines (=tracklets)are formed.
470 // The tracklets are processed in Prepare3DVertex
70c95f95 471
70c95f95 472 TClonesArray *itsRec = 0;
cd1c2af1 473 if(optCuts==0) fZHisto->Reset();
6b4d9537 474 // gc1 are local and global coordinates for layer 1
0496a544 475 Float_t gc1f[3]={0.,0.,0.};
476 Double_t gc1[3]={0.,0.,0.};
6b4d9537 477 // gc2 are local and global coordinates for layer 2
0496a544 478 Float_t gc2f[3]={0.,0.,0.};
479 Double_t gc2[3]={0.,0.,0.};
b21c1af0 480 AliITSRecPointContainer* rpcont=AliITSRecPointContainer::Instance();
481 itsRec=rpcont->FetchClusters(0,itsClusterTree);
482 if(!rpcont->IsSPDActive()){
483 AliWarning("No SPD rec points found, 3D vertex not calculated");
6b4d9537 484 return -1;
485 }
70c95f95 486
487 // Set values for cuts
0496a544 488 Double_t xbeam=GetNominalPos()[0];
489 Double_t ybeam=GetNominalPos()[1];
490 Double_t zvert=0.;
491 Double_t deltaPhi=fCoarseDiffPhiCut;
492 Double_t deltaR=fCoarseMaxRCut;
493 Double_t dZmax=fZCutDiamond;
87104b06 494 if(optCuts==1){
27167524 495 xbeam=fVert3D.GetXv();
496 ybeam=fVert3D.GetYv();
497 zvert=fVert3D.GetZv();
70c95f95 498 deltaPhi = fDiffPhiMax;
05d1294c 499 deltaR=fMaxRCut;
500 dZmax=fMaxZCut;
87104b06 501 if(fPileupAlgo == 2){
502 dZmax=fZCutDiamond;
503 deltaR=fMaxRCut2;
504 }
6b4d9537 505 } else if(optCuts==2){
cd1c2af1 506 xbeam=fVert3D.GetXv();
507 ybeam=fVert3D.GetYv();
c238ba33 508 deltaPhi = fDiffPhiforPileup;
cd1c2af1 509 deltaR=fMaxRCut;
70c95f95 510 }
cd1c2af1 511
70c95f95 512 Int_t nrpL1 = 0; // number of rec points on layer 1
513 Int_t nrpL2 = 0; // number of rec points on layer 2
514
515 // By default irstL1=0 and lastL1=79
6a0d56b8 516 Int_t firstL1 = AliITSgeomTGeo::GetModuleIndex(1,1,1);
32e63e47 517 Int_t lastL1 = AliITSgeomTGeo::GetModuleIndex(2,1,1)-1;
6a0d56b8 518 for(Int_t module= firstL1; module<=lastL1;module++){ // count number of recopints on layer 1
b21c1af0 519 itsRec=rpcont->UncheckedGetClusters(module);
70c95f95 520 nrpL1+= itsRec->GetEntries();
70c95f95 521 }
6a0d56b8 522 //By default firstL2=80 and lastL2=239
523 Int_t firstL2 = AliITSgeomTGeo::GetModuleIndex(2,1,1);
32e63e47 524 Int_t lastL2 = AliITSgeomTGeo::GetModuleIndex(3,1,1)-1;
6a0d56b8 525 for(Int_t module= firstL2; module<=lastL2;module++){ // count number of recopints on layer 2
b21c1af0 526 itsRec=rpcont->UncheckedGetClusters(module);
70c95f95 527 nrpL2+= itsRec->GetEntries();
70c95f95 528 }
529 if(nrpL1 == 0 || nrpL2 == 0){
fea0ad94 530 AliDebug(1,Form("No RecPoints in at least one SPD layer (%d %d)",nrpL1,nrpL2));
70c95f95 531 return -1;
532 }
cd706e57 533 AliDebug(1,Form("RecPoints on Layer 1,2 = %d, %d\n",nrpL1,nrpL2));
70c95f95 534
535 Double_t a[3]={xbeam,ybeam,0.};
536 Double_t b[3]={xbeam,ybeam,10.};
537 AliStrLine zeta(a,b,kTRUE);
322e007a 538 static Double_t bField=TMath::Abs(AliTracker::GetBz()/10.); //T
6a0d56b8 539 SetMeanPPtSelTracks(bField);
87104b06 540
70c95f95 541 Int_t nolines = 0;
542 // Loop on modules of layer 1
6a0d56b8 543 for(Int_t modul1= firstL1; modul1<=lastL1;modul1++){ // Loop on modules of layer 1
8c42830a 544 if(!fUseModule[modul1]) continue;
27167524 545 UShort_t ladder=int(modul1/4)+1; // ladders are numbered starting from 1
b21c1af0 546 TClonesArray *prpl1=rpcont->UncheckedGetClusters(modul1);
547 Int_t nrecp1 = prpl1->GetEntries();
70c95f95 548 for(Int_t j=0;j<nrecp1;j++){
cd1c2af1 549 if(j>kMaxCluPerMod) continue;
550 UShort_t idClu1=modul1*kMaxCluPerMod+j;
551 if(fUsedCluster.TestBitNumber(idClu1)) continue;
b21c1af0 552 AliITSRecPoint *recp1 = (AliITSRecPoint*)prpl1->At(j);
0496a544 553 recp1->GetGlobalXYZ(gc1f);
554 for(Int_t ico=0;ico<3;ico++)gc1[ico]=gc1f[ico];
555
6a0d56b8 556 Double_t phi1 = TMath::ATan2(gc1[1]-ybeam,gc1[0]-xbeam);
70c95f95 557 if(phi1<0)phi1=2*TMath::Pi()+phi1;
27167524 558 for(Int_t ladl2=0 ; ladl2<fLadOnLay2*2+1;ladl2++){
559 for(Int_t k=0;k<4;k++){
560 Int_t ladmod=fLadders[ladder-1]+ladl2;
32e63e47 561 if(ladmod>AliITSgeomTGeo::GetNLadders(2)) ladmod=ladmod-AliITSgeomTGeo::GetNLadders(2);
562 Int_t modul2=AliITSgeomTGeo::GetModuleIndex(2,ladmod,k+1);
8c42830a 563 if(!fUseModule[modul2]) continue;
b21c1af0 564 itsRec=rpcont->UncheckedGetClusters(modul2);
27167524 565 Int_t nrecp2 = itsRec->GetEntries();
566 for(Int_t j2=0;j2<nrecp2;j2++){
cd1c2af1 567 if(j2>kMaxCluPerMod) continue;
568 UShort_t idClu2=modul2*kMaxCluPerMod+j2;
569 if(fUsedCluster.TestBitNumber(idClu2)) continue;
6a0d56b8 570 AliITSRecPoint *recp2 = (AliITSRecPoint*)itsRec->At(j2);
0496a544 571 recp2->GetGlobalXYZ(gc2f);
572 for(Int_t ico=0;ico<3;ico++)gc2[ico]=gc2f[ico];
27167524 573 Double_t phi2 = TMath::ATan2(gc2[1]-ybeam,gc2[0]-xbeam);
574 if(phi2<0)phi2=2*TMath::Pi()+phi2;
575 Double_t diff = TMath::Abs(phi2-phi1);
576 if(diff>TMath::Pi())diff=2.*TMath::Pi()-diff;
54091147 577 if(optCuts==0 && diff<fDiffPhiforPileup){
0496a544 578 Double_t r1=TMath::Sqrt(gc1[0]*gc1[0]+gc1[1]*gc1[1]);
579 Double_t zc1=gc1[2];
580 Double_t r2=TMath::Sqrt(gc2[0]*gc2[0]+gc2[1]*gc2[1]);
581 Double_t zc2=gc2[2];
582 Double_t zr0=(r2*zc1-r1*zc2)/(r2-r1); //Z @ null radius
cd1c2af1 583 fZHisto->Fill(zr0);
584 }
27167524 585 if(diff>deltaPhi)continue;
6a0d56b8 586 AliStrLine line(gc1,gc2,kTRUE);
27167524 587 Double_t cp[3];
588 Int_t retcode = line.Cross(&zeta,cp);
589 if(retcode<0)continue;
590 Double_t dca = line.GetDCA(&zeta);
591 if(dca<0.) continue;
592 if(dca>deltaR)continue;
593 Double_t deltaZ=cp[2]-zvert;
594 if(TMath::Abs(deltaZ)>dZmax)continue;
6a0d56b8 595
6a0d56b8 596 if(nolines == 0){
f5f6da22 597 if(fLines.GetEntriesFast()>0)fLines.Clear("C");
6a0d56b8 598 }
599 Float_t cov[6];
600 recp2->GetGlobalCov(cov);
601
cd1c2af1 602
0496a544 603 Double_t rad1=TMath::Sqrt(gc1[0]*gc1[0]+gc1[1]*gc1[1]);
604 Double_t rad2=TMath::Sqrt(gc2[0]*gc2[0]+gc2[1]*gc2[1]);
605 Double_t factor=(rad1+rad2)/(rad2-rad1); //factor to account for error on tracklet direction
6a0d56b8 606
0496a544 607 Double_t curvErr=0;
6a0d56b8 608 if(bField>0.00001){
0496a544 609 Double_t curvRadius=fMeanPtSelTrk/(0.3*bField)*100; //cm
440198c1 610 Double_t dRad=TMath::Sqrt((gc1[0]-gc2[0])*(gc1[0]-gc2[0])+(gc1[1]-gc2[1])*(gc1[1]-gc2[1]));
0496a544 611 Double_t aux=dRad/2.+rad1;
6a0d56b8 612 curvErr=TMath::Sqrt(curvRadius*curvRadius-dRad*dRad/4.)-TMath::Sqrt(curvRadius*curvRadius-aux*aux); //cm
613 }
0496a544 614 Double_t sigmasq[3];
6a0d56b8 615 sigmasq[0]=(cov[0]+curvErr*curvErr/2.)*factor*factor;
616 sigmasq[1]=(cov[3]+curvErr*curvErr/2.)*factor*factor;
617 sigmasq[2]=cov[5]*factor*factor;
618
619 // Multiple scattering
0496a544 620 Double_t pOverMass=fMeanPSelTrk/0.140;
621 Double_t beta2=pOverMass*pOverMass/(1+pOverMass*pOverMass);
622 Double_t p2=fMeanPSelTrk*fMeanPSelTrk;
623 Double_t rBP=GetPipeRadius();
624 Double_t dBP=0.08/35.3; // 800 um of Be
625 Double_t dL1=0.01; //approx. 1% of radiation length
626 Double_t theta2BP=14.1*14.1/(beta2*p2*1e6)*dBP;
627 Double_t theta2L1=14.1*14.1/(beta2*p2*1e6)*dL1;
628 Double_t rtantheta1=(rad2-rad1)*TMath::Tan(TMath::Sqrt(theta2L1));
629 Double_t rtanthetaBP=(rad1-rBP)*TMath::Tan(TMath::Sqrt(theta2BP));
6a0d56b8 630 for(Int_t ico=0; ico<3;ico++){
5951029f 631 sigmasq[ico]+=rtantheta1*rtantheta1*factor*factor/3.;
632 sigmasq[ico]+=rtanthetaBP*rtanthetaBP*factor*factor/3.;
6a0d56b8 633 }
0496a544 634 Double_t wmat[9]={1.,0.,0.,0.,1.,0.,0.,0.,1.};
6a0d56b8 635 if(sigmasq[0]!=0.) wmat[0]=1./sigmasq[0];
636 if(sigmasq[1]!=0.) wmat[4]=1./sigmasq[1];
637 if(sigmasq[2]!=0.) wmat[8]=1./sigmasq[2];
cd1c2af1 638 new(fLines[nolines++])AliStrLine(gc1,sigmasq,wmat,gc2,kTRUE,idClu1,idClu2);
6a0d56b8 639
27167524 640 }
70c95f95 641 }
70c95f95 642 }
643 }
70c95f95 644 }
645 if(nolines == 0)return -2;
646 return nolines;
647}
648
70c95f95 649//______________________________________________________________________
05d1294c 650Int_t AliITSVertexer3D::Prepare3DVertex(Int_t optCuts){
70c95f95 651 // Finds the 3D vertex information using tracklets
652 Int_t retcode = -1;
653
0496a544 654 Double_t xbeam=GetNominalPos()[0];
655 Double_t ybeam=GetNominalPos()[1];
656 Double_t zvert=0.;
657 Double_t deltaR=fCoarseMaxRCut;
0496a544 658 Double_t dZmax=fZCutDiamond;
cd1c2af1 659 if(optCuts==1){
27167524 660 xbeam=fVert3D.GetXv();
661 ybeam=fVert3D.GetYv();
662 zvert=fVert3D.GetZv();
05d1294c 663 deltaR=fMaxRCut;
664 dZmax=fMaxZCut;
87104b06 665 if(fPileupAlgo == 2){
666 dZmax=fZCutDiamond;
667 deltaR=fMaxRCut2;
668 }
cd1c2af1 669 }else if(optCuts==2){
670 xbeam=fVert3D.GetXv();
671 ybeam=fVert3D.GetYv();
672 deltaR=fMaxRCut;
05d1294c 673 }
674
0496a544 675 Double_t rl=-fCoarseMaxRCut;
676 Double_t rh=fCoarseMaxRCut;
677 Double_t zl=-fZCutDiamond;
678 Double_t zh=fZCutDiamond;
7d766abb 679 Int_t nbr=(Int_t)((rh-rl)/fBinSizeR+0.0001);
680 Int_t nbz=(Int_t)((zh-zl)/fBinSizeZ+0.0001);
681 Int_t nbrcs=(Int_t)((rh-rl)/(fBinSizeR*2.)+0.0001);
682 Int_t nbzcs=(Int_t)((zh-zl)/(fBinSizeZ*2.)+0.0001);
683
87104b06 684 TH3F *h3d = new TH3F("h3d","xyz distribution",nbr,rl,rh,nbr,rl,rh,nbz,zl,zh);
685 TH3F *h3dcs = new TH3F("h3dcs","xyz distribution",nbrcs,rl,rh,nbrcs,rl,rh,nbzcs,zl,zh);
686
70c95f95 687 // cleanup of the TCLonesArray of tracklets (i.e. fakes are removed)
f5f6da22 688 Int_t *validate = new Int_t [fLines.GetEntriesFast()];
689 for(Int_t i=0; i<fLines.GetEntriesFast();i++)validate[i]=0;
690 for(Int_t i=0; i<fLines.GetEntriesFast()-1;i++){
f5f6da22 691 AliStrLine *l1 = (AliStrLine*)fLines.At(i);
692 for(Int_t j=i+1;j<fLines.GetEntriesFast();j++){
693 AliStrLine *l2 = (AliStrLine*)fLines.At(j);
0496a544 694 Double_t dca=l1->GetDCA(l2);
05d1294c 695 if(dca > fDCAcut || dca<0.00001) continue;
70c95f95 696 Double_t point[3];
697 Int_t retc = l1->Cross(l2,point);
698 if(retc<0)continue;
6a0d56b8 699 Double_t deltaZ=point[2]-zvert;
700 if(TMath::Abs(deltaZ)>dZmax)continue;
70c95f95 701 Double_t rad=TMath::Sqrt(point[0]*point[0]+point[1]*point[1]);
05d1294c 702 if(rad>fCoarseMaxRCut)continue;
703 Double_t deltaX=point[0]-xbeam;
704 Double_t deltaY=point[1]-ybeam;
05d1294c 705 Double_t raddist=TMath::Sqrt(deltaX*deltaX+deltaY*deltaY);
05d1294c 706 if(raddist>deltaR)continue;
27167524 707 validate[i]=1;
708 validate[j]=1;
87104b06 709 h3d->Fill(point[0],point[1],point[2]);
710 h3dcs->Fill(point[0],point[1],point[2]);
70c95f95 711 }
712 }
713
714
715
70c95f95 716 Int_t numbtracklets=0;
f5f6da22 717 for(Int_t i=0; i<fLines.GetEntriesFast();i++)if(validate[i]>=1)numbtracklets++;
6b4d9537 718 if(numbtracklets<2){
719 delete [] validate;
87104b06 720 delete h3d;
721 delete h3dcs;
6b4d9537 722 return retcode;
723 }
70c95f95 724
f5f6da22 725 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
726 if(validate[i]<1)fLines.RemoveAt(i);
70c95f95 727 }
f5f6da22 728 fLines.Compress();
729 AliDebug(1,Form("Number of tracklets (after compress)%d ",fLines.GetEntriesFast()));
70c95f95 730 delete [] validate;
731
87104b06 732 // Exit here if Pileup Algorithm 2 has been chosen during second loop
733 if(fPileupAlgo == 2 && optCuts==1){
734 delete h3d;
735 delete h3dcs;
736 return 0;
737 }
6b4d9537 738
7340864d 739 // Find peaks in histos
05d1294c 740
70c95f95 741 Double_t peak[3]={0.,0.,0.};
7340864d 742 Int_t ntrkl,ntimes;
743 FindPeaks(h3d,peak,ntrkl,ntimes);
70c95f95 744 delete h3d;
0496a544 745 Double_t binsizer=(rh-rl)/nbr;
746 Double_t binsizez=(zh-zl)/nbz;
7d766abb 747 if(optCuts==0 && (ntrkl<=2 || ntimes>1)){
7340864d 748 ntrkl=0;
749 ntimes=0;
750 FindPeaks(h3dcs,peak,ntrkl,ntimes);
751 binsizer=(rh-rl)/nbrcs;
752 binsizez=(zh-zl)/nbzcs;
753 if(ntrkl==1 || ntimes>1){delete h3dcs; return retcode;}
754 }
755 delete h3dcs;
756
70c95f95 757 // Second selection loop
7340864d 758
0496a544 759 Double_t bs=(binsizer+binsizez)/2.;
f5f6da22 760 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
761 AliStrLine *l1 = (AliStrLine*)fLines.At(i);
762 if(l1->GetDistFromPoint(peak)>2.5*bs)fLines.RemoveAt(i);
70c95f95 763 }
f5f6da22 764 fLines.Compress();
765 AliDebug(1,Form("Number of tracklets (after 2nd compression) %d",fLines.GetEntriesFast()));
70c95f95 766
f5f6da22 767 if(fLines.GetEntriesFast()>1){
2ecf7a6f 768 retcode=0;
27167524 769 // find a first candidate for the primary vertex
f5f6da22 770 fVert3D=AliVertexerTracks::TrackletVertexFinder(&fLines,0);
70c95f95 771 // make a further selection on tracklets based on this first candidate
27167524 772 fVert3D.GetXYZ(peak);
773 AliDebug(1,Form("FIRST V candidate: %f ; %f ; %f",peak[0],peak[1],peak[2]));
f5f6da22 774 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
775 AliStrLine *l1 = (AliStrLine*)fLines.At(i);
776 if(l1->GetDistFromPoint(peak)> fDCAcut)fLines.RemoveAt(i);
70c95f95 777 }
f5f6da22 778 fLines.Compress();
779 AliDebug(1,Form("Number of tracklets (after 3rd compression) %d",fLines.GetEntriesFast()));
2ecf7a6f 780 if(fLines.GetEntriesFast()>1){// this new tracklet selection is used
781 fVert3D=AliVertexerTracks::TrackletVertexFinder(&fLines,0);
782 }
70c95f95 783 }
784 return retcode;
785}
786
6a0d56b8 787//________________________________________________________
0496a544 788void AliITSVertexer3D::SetMeanPPtSelTracks(Double_t fieldTesla){
5951029f 789 // Sets mean values of Pt based on the field
790 // for P (used in multiple scattering) the most probable value is used
6a0d56b8 791 if(TMath::Abs(fieldTesla-0.5)<0.01){
5951029f 792 SetMeanPSelTracks(0.375);
6a0d56b8 793 SetMeanPtSelTracks(0.630);
794 }else if(TMath::Abs(fieldTesla-0.4)<0.01){
5951029f 795 SetMeanPSelTracks(0.375);
6a0d56b8 796 SetMeanPtSelTracks(0.580);
797 }else if(TMath::Abs(fieldTesla-0.2)<0.01){
5951029f 798 SetMeanPSelTracks(0.375);
6a0d56b8 799 SetMeanPtSelTracks(0.530);
800 }else if(fieldTesla<0.00001){
5951029f 801 SetMeanPSelTracks(0.375);
802 SetMeanPtSelTracks(0.230);
6a0d56b8 803 }else{
804 SetMeanPSelTracks();
805 SetMeanPtSelTracks();
70c95f95 806 }
70c95f95 807}
808
7340864d 809//________________________________________________________
810void AliITSVertexer3D::FindPeaks(TH3F* histo, Double_t *peak, Int_t &nOfTracklets, Int_t &nOfTimes){
811 // Finds bin with max contents in 3D histo of tracket intersections
812 TAxis *xax = histo->GetXaxis();
813 TAxis *yax = histo->GetYaxis();
814 TAxis *zax = histo->GetZaxis();
815 peak[0]=0.;
816 peak[1]=0.;
817 peak[2]=0.;
818 nOfTracklets = 0;
819 nOfTimes=0;
7d766abb 820 Int_t peakbin[3]={0,0,0};
821 Int_t peak2bin[3]={-1,-1,-1};
822 Int_t bc2=-1;
7340864d 823 for(Int_t i=xax->GetFirst();i<=xax->GetLast();i++){
242c8025 824 Double_t xval = xax->GetBinCenter(i);
7340864d 825 for(Int_t j=yax->GetFirst();j<=yax->GetLast();j++){
242c8025 826 Double_t yval = yax->GetBinCenter(j);
7340864d 827 for(Int_t k=zax->GetFirst();k<=zax->GetLast();k++){
242c8025 828 Double_t zval = zax->GetBinCenter(k);
7340864d 829 Int_t bc =(Int_t)histo->GetBinContent(i,j,k);
7d766abb 830 if(bc==0) continue;
7340864d 831 if(bc>nOfTracklets){
7d766abb 832 nOfTracklets=bc;
7340864d 833 peak[2] = zval;
834 peak[1] = yval;
835 peak[0] = xval;
7d766abb 836 peakbin[2] = k;
837 peakbin[1] = j;
838 peakbin[0] = i;
839 peak2bin[2] = -1;
840 peak2bin[1] = -1;
841 peak2bin[0] = -1;
842 bc2=-1;
7340864d 843 nOfTimes = 1;
06a7cbee 844 }else if(bc==nOfTracklets){
7d766abb 845 if(TMath::Abs(i-peakbin[0])<=1 && TMath::Abs(j-peakbin[1])<=1 && TMath::Abs(k-peakbin[2])<=1){
846 peak2bin[2] = k;
847 peak2bin[1] = j;
848 peak2bin[0] = i;
849 bc2=bc;
850 nOfTimes = 1;
851 }else{
852 nOfTimes++;
853 }
7340864d 854 }
855 }
856 }
857 }
7d766abb 858 if(peak2bin[0]>=-1 && bc2!=-1){ // two contiguous peak-cells with same contents
859 peak[0]=0.5*(xax->GetBinCenter(peakbin[0])+xax->GetBinCenter(peak2bin[0]));
860 peak[1]=0.5*(yax->GetBinCenter(peakbin[1])+yax->GetBinCenter(peak2bin[1]));
861 peak[2]=0.5*(zax->GetBinCenter(peakbin[2])+zax->GetBinCenter(peak2bin[2]));
862 nOfTracklets+=bc2;
863 nOfTimes=1;
864 }
7340864d 865}
cd1c2af1 866//________________________________________________________
867void AliITSVertexer3D::MarkUsedClusters(){
868 // Mark clusters of tracklets used in vertex claulation
869 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
870 AliStrLine *lin = (AliStrLine*)fLines.At(i);
871 Int_t idClu1=lin->GetIdPoint(0);
872 Int_t idClu2=lin->GetIdPoint(1);
873 fUsedCluster.SetBitNumber(idClu1);
874 fUsedCluster.SetBitNumber(idClu2);
875 }
876}
877//________________________________________________________
878Int_t AliITSVertexer3D::RemoveTracklets(){
879 // Remove trackelts close to first found vertex
880 Double_t vert[3]={fVert3D.GetXv(),fVert3D.GetYv(),fVert3D.GetZv()};
881 Int_t nRemoved=0;
882 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
883 AliStrLine *lin = (AliStrLine*)fLines.At(i);
884 if(lin->GetDistFromPoint(vert)<fDCAforPileup){
885 Int_t idClu1=lin->GetIdPoint(0);
886 Int_t idClu2=lin->GetIdPoint(1);
887 fUsedCluster.SetBitNumber(idClu1);
888 fUsedCluster.SetBitNumber(idClu2);
889 fLines.RemoveAt(i);
890 ++nRemoved;
891 }
892 }
893 fLines.Compress();
894 return nRemoved;
895}
896//________________________________________________________
897void AliITSVertexer3D::FindOther3DVertices(TTree *itsClusterTree){
898 // pileup identification based on 3D vertexing with not used clusters
899 MarkUsedClusters();
900 fLines.Clear("C");
901 Int_t nolines = FindTracklets(itsClusterTree,2);
902 if(nolines>=2){
903 Int_t nr=RemoveTracklets();
904 nolines-=nr;
905 if(nolines>=2){
906 Int_t rc=Prepare3DVertex(2);
907 if(rc==0){
908 fVert3D=AliVertexerTracks::TrackletVertexFinder(&fLines,0);
909 if(fVert3D.GetNContributors()>=fMinTrackletsForPilup){
910 fIsPileup=kTRUE;
6b4d9537 911 fNoVertices=2;
912 fVertArray = new AliESDVertex[2];
913 fVertArray[0]=(*fCurrentVertex);
914 fVertArray[1]=fVert3D;
cd1c2af1 915 fZpuv=fVert3D.GetZv();
916 fNTrpuv=fVert3D.GetNContributors();
917 }
918 }
919 }
920 }
921}
922//______________________________________________________________________
923void AliITSVertexer3D::PileupFromZ(){
924 // Calls the pileup algorithm of ALiITSVertexerZ
925 Int_t binmin, binmax;
926 Int_t nPeaks=AliITSVertexerZ::GetPeakRegion(fZHisto,binmin,binmax);
927 if(nPeaks==2)AliWarning("2 peaks found");
928 Int_t firstPeakCont=0;
242c8025 929 Double_t firstPeakPos=0.;
cd1c2af1 930 for(Int_t i=binmin-1;i<=binmax+1;i++){
6b4d9537 931 firstPeakCont+=static_cast<Int_t>(fZHisto->GetBinContent(i));
cd1c2af1 932 firstPeakPos+=fZHisto->GetBinContent(i)*fZHisto->GetBinCenter(i);
933 }
73315c4a 934 if(firstPeakCont>0){
935 firstPeakPos/=firstPeakCont;
936 Int_t ncontr2=0;
937 if(firstPeakCont>fMinTrackletsForPilup){
938 Float_t secPeakPos;
939 ncontr2=AliITSVertexerZ::FindSecondPeak(fZHisto,binmin,binmax,secPeakPos);
940 if(ncontr2>=fMinTrackletsForPilup){
941 fIsPileup=kTRUE;
6b4d9537 942 fNoVertices=2;
943 AliESDVertex secondVert(secPeakPos,0.1,ncontr2);
944 fVertArray = new AliESDVertex[2];
945 fVertArray[0]=(*fCurrentVertex);
946 fVertArray[1]=secondVert;
73315c4a 947 fZpuv=secPeakPos;
948 fNTrpuv=ncontr2;
949 }
cd1c2af1 950 }
951 }
952}
70c95f95 953//________________________________________________________
954void AliITSVertexer3D::PrintStatus() const {
955 // Print current status
87104b06 956 printf("========= First step selections =====================\n");
6a0d56b8 957 printf("Cut on diamond (Z) %f\n",fZCutDiamond);
87104b06 958 printf("Loose cut on Delta Phi %f\n",fCoarseDiffPhiCut);
959 printf("Loose cut on tracklet DCA to Z axis %f\n",fCoarseMaxRCut);
6a0d56b8 960 printf("Cut on DCA - tracklet to tracklet and to vertex %f\n",fDCAcut);
87104b06 961 printf("========= Second step selections ====================\n");
962 printf("Cut on tracklet-to-first-vertex Z distance %f\n",fMaxZCut);
cd1c2af1 963 printf("Max Phi difference: %f\n",fDiffPhiMax);
87104b06 964 printf("Cut on tracklet DCA to beam axis %f\n",fMaxRCut);
965 printf("Cut on tracklet DCA to beam axis (algo2) %f\n",fMaxRCut2);
966 printf("========= Pileup selections =========================\n");
cd1c2af1 967 printf("Pileup algo: %d\n",fPileupAlgo);
87104b06 968 printf("Min DCA to 1st vertex for pileup (algo 0 and 1): %f\n",fDCAforPileup);
969 printf("Cut on distance between pair-vertices (algo 2): %f\n",fCutOnPairs);
6a0d56b8 970 printf("=======================================================\n");
70c95f95 971}