1 /**************************************************************************
2 * Copyright(c) 2006-2008, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
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 **************************************************************************/
16 #include "AliRunLoader.h"
17 #include "AliESDVertex.h"
19 #include "AliStrLine.h"
20 #include "AliTracker.h"
21 #include "AliITSDetTypeRec.h"
22 #include "AliITSRecPoint.h"
23 #include "AliITSRecPointContainer.h"
24 #include "AliITSgeomTGeo.h"
25 #include "AliVertexerTracks.h"
26 #include "AliITSVertexer3D.h"
27 #include "AliITSVertexerZ.h"
28 #include "AliITSSortTrkl.h"
29 /////////////////////////////////////////////////////////////////
30 // this class implements a method to determine
31 // the 3 coordinates of the primary vertex
34 ////////////////////////////////////////////////////////////////
36 const Int_t AliITSVertexer3D::fgkMaxNumOfClDefault = 500;
38 ClassImp(AliITSVertexer3D)
42 //______________________________________________________________________
43 AliITSVertexer3D::AliITSVertexer3D():
45 fLines("AliStrLine",1000),
47 fCoarseDiffPhiCut(0.),
59 fUsedCluster(kMaxCluPerMod*kNSPDMod),
62 fDiffPhiforPileup(0.),
66 fMaxNumOfCl(fgkMaxNumOfClDefault)
68 // Default constructor
69 SetCoarseDiffPhiCut();
82 SetDeltaPhiforPileup();
86 Double_t binsize=0.02; // default 200 micron
87 Int_t nbins=static_cast<Int_t>(1+2*fZCutDiamond/binsize);
88 fZHisto=new TH1F("hz","",nbins,-fZCutDiamond,-fZCutDiamond+binsize*nbins);
91 //______________________________________________________________________
92 AliITSVertexer3D::~AliITSVertexer3D() {
95 if(fZHisto) delete fZHisto;
98 //______________________________________________________________________
99 void AliITSVertexer3D::ResetVert3D(){
105 fVert3D.SetDispersion(0.);
106 fVert3D.SetNContributors(0);
107 fUsedCluster.ResetAllBits(0);
109 //______________________________________________________________________
110 AliESDVertex* AliITSVertexer3D::FindVertexForCurrentEvent(TTree *itsClusterTree){
111 // Defines the AliESDVertex for the current event
113 AliDebug(1,"FindVertexForCurrentEvent - 3D - PROCESSING NEXT EVENT");
115 fCurrentVertex = NULL;
117 Int_t nolines = FindTracklets(itsClusterTree,0);
120 rc=Prepare3DVertex(0);
121 if(fVert3D.GetNContributors()>0){
123 nolines = FindTracklets(itsClusterTree,1);
125 rc=Prepare3DVertex(1);
126 if(fPileupAlgo == 2 && rc == 0) FindVertex3DIterative();
127 else if(fPileupAlgo<2 && rc == 0) FindVertex3D(itsClusterTree);
128 if(rc!=0) fVert3D.SetNContributors(0); // exclude this vertex
134 AliITSVertexerZ vertz(GetNominalPos()[0],GetNominalPos()[1]);
135 vertz.SetDetTypeRec(GetDetTypeRec());
136 AliDebug(1,"Call Vertexer Z\n");
137 vertz.SetLowLimit(-fZCutDiamond);
138 vertz.SetHighLimit(fZCutDiamond);
139 AliESDVertex* vtxz = vertz.FindVertexForCurrentEvent(itsClusterTree);
141 Double_t position[3]={GetNominalPos()[0],GetNominalPos()[1],vtxz->GetZv()};
142 Double_t covmatrix[6];
143 vtxz->GetCovMatrix(covmatrix);
144 Double_t chi2=99999.;
145 Int_t nContr=vtxz->GetNContributors();
146 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
147 fCurrentVertex->SetDispersion(vtxz->GetDispersion());
148 fCurrentVertex->SetTitle("vertexer: Z");
149 fCurrentVertex->SetName("SPDVertexZ");
154 FindMultiplicity(itsClusterTree);
155 return fCurrentVertex;
158 //______________________________________________________________________
159 void AliITSVertexer3D::FindVertex3D(TTree *itsClusterTree){
161 Double_t vRadius=TMath::Sqrt(fVert3D.GetXv()*fVert3D.GetXv()+fVert3D.GetYv()*fVert3D.GetYv());
162 if(vRadius<GetPipeRadius() && fVert3D.GetNContributors()>0){
163 Double_t position[3]={fVert3D.GetXv(),fVert3D.GetYv(),fVert3D.GetZv()};
164 Double_t covmatrix[6];
165 fVert3D.GetCovMatrix(covmatrix);
166 Double_t chi2=99999.;
167 Int_t nContr=fVert3D.GetNContributors();
168 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
169 fCurrentVertex->SetTitle("vertexer: 3D");
170 fCurrentVertex->SetName("SPDVertex3D");
171 fCurrentVertex->SetDispersion(fVert3D.GetDispersion());
175 case 0: PileupFromZ(); break;
176 case 1: FindOther3DVertices(itsClusterTree); break;
177 default: AliError("Wrong pileup algorithm"); break;
180 fVertArray = new AliESDVertex[1];
181 fVertArray[0]=(*fCurrentVertex);
186 //______________________________________________________________________
187 void AliITSVertexer3D::FindVertex3DIterative(){
190 Int_t nLines=fLines.GetEntriesFast();
191 Int_t maxPoints=nLines*(nLines-1)/2;
192 Double_t* xP=new Double_t[maxPoints];
193 Double_t* yP=new Double_t[maxPoints];
194 Double_t* zP=new Double_t[maxPoints];
195 Int_t* index1=new Int_t[maxPoints];
196 Int_t* index2=new Int_t[maxPoints];
197 Double_t xbeam=fVert3D.GetXv();
198 Double_t ybeam=fVert3D.GetYv();
201 for(Int_t ilin1=0; ilin1<nLines; ilin1++){
202 AliStrLine *l1 = (AliStrLine*)fLines.At(ilin1);
203 for(Int_t ilin2=ilin1+1; ilin2<nLines; ilin2++){
204 AliStrLine *l2 = (AliStrLine*)fLines.At(ilin2);
205 Double_t dca=l1->GetDCA(l2);
206 if(dca > fDCAcut || dca<0.00001) continue;
208 Int_t retc = l1->Cross(l2,point);
210 Double_t rad=TMath::Sqrt(point[0]*point[0]+point[1]*point[1]);
211 if(rad>fCoarseMaxRCut)continue;
212 Double_t distFromBeam=TMath::Sqrt((point[0]-xbeam)*(point[0]-xbeam)+(point[1]-ybeam)*(point[1]-ybeam));
213 if(distFromBeam>fMaxRCut2) continue;
217 index1[iPoint]=ilin1;
218 index2[iPoint]=ilin2;
222 Int_t npoints=iPoint++;
224 Short_t* mask=new Short_t[npoints];
225 for(Int_t ip=0;ip<npoints;ip++) mask[ip]=-1;
227 for(Int_t ip1=0;ip1<npoints;ip1++){
228 if(mask[ip1]==-1) mask[ip1]=index++;
229 for(Int_t ip2=ip1+1; ip2<npoints; ip2++){
230 if(mask[ip2]==mask[ip1] && mask[ip2]!=-1) continue;
231 Double_t dist2=(xP[ip1]-xP[ip2])*(xP[ip1]-xP[ip2]);
232 dist2+=(yP[ip1]-yP[ip2])*(yP[ip1]-yP[ip2]);
233 dist2+=(zP[ip1]-zP[ip2])*(zP[ip1]-zP[ip2]);
234 if(dist2<fCutOnPairs*fCutOnPairs){
235 if(mask[ip2]==-1) mask[ip2]=mask[ip1];
237 for(Int_t ip=0; ip<npoints;ip++){
238 if(mask[ip]==mask[ip2]) mask[ip]=mask[ip1];
246 // Count multiplicity of trackelts in clusters
247 UInt_t* isIndUsed=new UInt_t[index+1];
248 for(Int_t ind=0;ind<index+1;ind++) isIndUsed[ind]=0;
249 for(Int_t ip=0; ip<npoints;ip++){
254 // Count clusters/vertices and sort according to multiplicity
256 Int_t* sortedIndex=new Int_t[index+1];
257 for(Int_t ind1=0;ind1<index+1;ind1++){
258 if(isIndUsed[ind1]<=1) isIndUsed[ind1]=0;
261 if(ind1>0) cap=isIndUsed[sortedIndex[ind1-1]];
263 Int_t biggerindex=-1;
264 for(Int_t ind2=0;ind2<index+1;ind2++){
266 for(Int_t ind3=0; ind3<ind1; ind3++)
267 if(ind2==sortedIndex[ind3]) use=kFALSE;
268 if(use && isIndUsed[ind2]>bigger && isIndUsed[ind2]<=cap){
269 bigger=isIndUsed[ind2];
273 sortedIndex[ind1]=biggerindex;
275 AliDebug(3,Form("Number of clusters before merging = %d\n",nClusters));
277 // Assign lines to clusters/vertices and merge clusters which share 1 line
278 Int_t nClustersAfterMerge=nClusters;
279 Int_t* belongsTo=new Int_t[nLines];
280 for(Int_t ilin=0; ilin<nLines; ilin++) belongsTo[ilin]=-1;
281 for(Int_t iclu=0;iclu<nClusters;iclu++){
282 Int_t actualCluIndex=iclu;
283 for(Int_t ip=0; ip<npoints;ip++){
284 if(mask[ip]==sortedIndex[iclu]){
285 Int_t ind1=index1[ip];
286 if(belongsTo[ind1]==-1) belongsTo[ind1]=actualCluIndex;
287 else if(belongsTo[ind1]<actualCluIndex){
288 Int_t newCluIndex=belongsTo[ind1];
289 for(Int_t ilin=0; ilin<nLines; ilin++){
290 if(belongsTo[ilin]==actualCluIndex) belongsTo[ilin]=newCluIndex;
292 AliDebug(10,Form("Merged cluster %d with %d\n",actualCluIndex,newCluIndex));
293 actualCluIndex=newCluIndex;
294 nClustersAfterMerge--;
296 Int_t ind2=index2[ip];
297 if(belongsTo[ind2]==-1) belongsTo[ind2]=actualCluIndex;
298 else if(belongsTo[ind2]<actualCluIndex){
299 Int_t newCluIndex=belongsTo[ind2];
300 for(Int_t ilin=0; ilin<nLines; ilin++){
301 if(belongsTo[ilin]==actualCluIndex) belongsTo[ilin]=newCluIndex;
303 AliDebug(10,Form("Merged cluster %d with %d\n",actualCluIndex,newCluIndex));
304 actualCluIndex=newCluIndex;
305 nClustersAfterMerge--;
310 AliDebug(3,Form("Number of clusters after merging = %d\n",nClustersAfterMerge));
312 // Count lines associated to each cluster/vertex
313 UInt_t *cluSize=new UInt_t[nClusters];
314 for(Int_t iclu=0;iclu<nClusters;iclu++){
316 for(Int_t ilin=0; ilin<nLines; ilin++){
317 if(belongsTo[ilin]==iclu) cluSize[iclu]++;
321 // Count good vertices (>1 associated tracklet)
323 for(Int_t iclu=0;iclu<nClusters;iclu++){
324 AliDebug(3,Form("Vertex %d Size=%d\n",iclu,cluSize[iclu]));
325 if(cluSize[iclu]>1) nGoodVert++;
328 AliDebug(1,Form("Number of good vertices = %d\n",nGoodVert));
329 // Calculate vertex coordinates for each cluster
331 fVertArray = new AliESDVertex[nGoodVert];
333 for(Int_t iclu=0;iclu<nClusters;iclu++){
334 Int_t size=cluSize[iclu];
336 AliStrLine **arrlin = new AliStrLine*[size];
338 for(Int_t ilin=0; ilin<nLines; ilin++){
339 if(belongsTo[ilin]==iclu){
340 arrlin[nFilled++] = dynamic_cast<AliStrLine*>(fLines[ilin]);
343 AliDebug(3,Form("Vertex %d N associated tracklets = %d out of %d\n",iVert,size,nFilled));
345 fVertArray[iVert]=AliVertexerTracks::TrackletVertexFinder(arrlin,nFilled);
347 fVertArray[iVert].GetXYZ(peak);
348 AliStrLine **arrlin2 = new AliStrLine*[size];
350 for(Int_t i=0; i<nFilled;i++){
351 AliStrLine *l1 = arrlin[i];
352 if(l1->GetDistFromPoint(peak)< fDCAcut)
353 arrlin2[nFilled2++] = dynamic_cast<AliStrLine*>(l1);
356 AliDebug(3,Form("Vertex %d recalculated with %d tracklets\n",iVert,nFilled2));
357 fVertArray[iVert]=AliVertexerTracks::TrackletVertexFinder(arrlin2,nFilled2);
367 fNTrpuv = fVertArray[1].GetNContributors();
368 fZpuv = fVertArray[1].GetZv();
371 Double_t vRadius=TMath::Sqrt(fVertArray[0].GetXv()*fVertArray[0].GetXv()+fVertArray[0].GetYv()*fVertArray[0].GetYv());
372 if(vRadius<GetPipeRadius() && fVertArray[0].GetNContributors()>0){
373 Double_t position[3]={fVertArray[0].GetXv(),fVertArray[0].GetYv(),fVertArray[0].GetZv()};
374 Double_t covmatrix[6];
375 fVertArray[0].GetCovMatrix(covmatrix);
376 Double_t chi2=99999.;
377 Int_t nContr=fVertArray[0].GetNContributors();
378 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
379 fCurrentVertex->SetTitle("vertexer: 3D");
380 fCurrentVertex->SetName("SPDVertex3D");
381 fCurrentVertex->SetDispersion(fVertArray[0].GetDispersion());
389 delete [] sortedIndex;
396 //______________________________________________________________________
397 void AliITSVertexer3D::FindVertex3DIterativeMM(){
398 // Defines the AliESDVertex for the current event
399 Int_t numsor=fLines.GetEntriesFast()*(fLines.GetEntriesFast()-1)/2;
400 //cout<<"AliITSVertexer3D::FindVertexForCurentEvent: Number of tracklets selected for vertexing "<<fLines.GetEntriesFast()<<"; Number of pairs: "<<numsor<<endl;
401 AliITSSortTrkl srt(fLines,numsor,fCutOnPairs,fCoarseMaxRCut);
403 AliInfo(Form("Number of vertices: %d",srt.GetNumberOfClusters()));
405 fNoVertices = srt.GetNumberOfClusters();
406 //printf("fNoVertices = %d \n",fNoVertices);
408 fVertArray = new AliESDVertex[fNoVertices];
409 for(Int_t kk=0; kk<srt.GetNumberOfClusters(); kk++){
411 Int_t *labels = srt.GetTrackletsLab(kk,size);
413 Int_t *pairs = srt.GetClusters(kk);
414 Int_t nopai = srt.GetSizeOfCluster(kk);
415 cout<<"***** Vertex number "<<kk<<". Pairs: \n";
416 for(Int_t jj=0;jj<nopai;jj++){
417 cout<<pairs[jj]<<" - ";
418 if(jj>0 & jj%8==0)cout<<endl;
421 cout<<"***** Vertex number "<<kk<<". Labels: \n";
423 AliStrLine **tclo = new AliStrLine* [size];
424 for(Int_t jj=0;jj<size;jj++){
425 // cout<<labels[jj]<<" - ";
426 // if(jj>0 & jj%8==0)cout<<endl;
427 tclo[jj] = dynamic_cast<AliStrLine*>(fLines[labels[jj]]);
431 fVertArray[kk]=AliVertexerTracks::TrackletVertexFinder(tclo,size);
433 // fVertArray[kk].PrintStatus();
435 // at least one second vertex is present
437 fNTrpuv = fVertArray[kk].GetNContributors();
438 fZpuv = fVertArray[kk].GetZv();
441 Double_t vRadius=TMath::Sqrt(fVertArray[0].GetXv()*fVertArray[0].GetXv()+fVertArray[0].GetYv()*fVertArray[0].GetYv());
442 if(vRadius<GetPipeRadius() && fVertArray[0].GetNContributors()>0){
443 Double_t position[3]={fVertArray[0].GetXv(),fVertArray[0].GetYv(),fVertArray[0].GetZv()};
444 Double_t covmatrix[6];
445 fVertArray[0].GetCovMatrix(covmatrix);
446 Double_t chi2=99999.;
447 Int_t nContr=fVertArray[0].GetNContributors();
448 fCurrentVertex = new AliESDVertex(position,covmatrix,chi2,nContr);
449 fCurrentVertex->SetTitle("vertexer: 3D");
450 fCurrentVertex->SetName("SPDVertex3D");
451 fCurrentVertex->SetDispersion(fVertArray[0].GetDispersion());
457 //______________________________________________________________________
458 Bool_t AliITSVertexer3D::DistBetweenVertices(AliESDVertex &a, AliESDVertex &b, Double_t test, Double_t &dist){
459 // method to compare the distance between vertices a and b with "test"
460 //it returns kTRUE is the distance is less or equal to test
461 dist = (a.GetX()-b.GetX()) * (a.GetX()-b.GetX());
462 dist += (a.GetY()-b.GetY()) * (a.GetY()-b.GetY());
463 dist += (a.GetZ()-b.GetZ()) * (a.GetZ()-b.GetZ());
464 dist = TMath::Sqrt(dist);
465 if(dist <= test)return kTRUE;
470 //______________________________________________________________________
471 Int_t AliITSVertexer3D::FindTracklets(TTree *itsClusterTree, Int_t optCuts){
472 // All the possible combinations between recpoints on layer 1and 2 are
473 // considered. Straight lines (=tracklets)are formed.
474 // The tracklets are processed in Prepare3DVertex
476 TClonesArray *itsRec = 0;
477 if(optCuts==0) fZHisto->Reset();
478 // gc1 are local and global coordinates for layer 1
479 Float_t gc1f[3]={0.,0.,0.};
480 Double_t gc1[3]={0.,0.,0.};
481 // gc2 are local and global coordinates for layer 2
482 Float_t gc2f[3]={0.,0.,0.};
483 Double_t gc2[3]={0.,0.,0.};
484 AliITSRecPointContainer* rpcont=AliITSRecPointContainer::Instance();
485 itsRec=rpcont->FetchClusters(0,itsClusterTree);
486 if(!rpcont->IsSPDActive()){
487 AliWarning("No SPD rec points found, 3D vertex not calculated");
491 // Set values for cuts
492 Double_t xbeam=GetNominalPos()[0];
493 Double_t ybeam=GetNominalPos()[1];
495 Double_t deltaPhi=fCoarseDiffPhiCut;
496 Double_t deltaR=fCoarseMaxRCut;
497 Double_t dZmax=fZCutDiamond;
499 xbeam=fVert3D.GetXv();
500 ybeam=fVert3D.GetYv();
501 zvert=fVert3D.GetZv();
502 deltaPhi = fDiffPhiMax;
505 if(fPileupAlgo == 2){
509 } else if(optCuts==2){
510 xbeam=fVert3D.GetXv();
511 ybeam=fVert3D.GetYv();
512 deltaPhi = fDiffPhiforPileup;
516 Int_t nrpL1 = 0; // number of rec points on layer 1
517 Int_t nrpL2 = 0; // number of rec points on layer 2
518 nrpL1=rpcont->GetNClustersInLayerFast(1);
519 nrpL2=rpcont->GetNClustersInLayerFast(2);
520 if(nrpL1 == 0 || nrpL2 == 0){
521 AliDebug(1,Form("No RecPoints in at least one SPD layer (%d %d)",nrpL1,nrpL2));
524 AliDebug(1,Form("RecPoints on Layer 1,2 = %d, %d\n",nrpL1,nrpL2));
525 if(nrpL1>fMaxNumOfCl || nrpL2>fMaxNumOfCl){
526 AliWarning(Form("Too many recpoints on SPD(%d %d ), call vertexerZ",nrpL1,nrpL2));
530 Double_t a[3]={xbeam,ybeam,0.};
531 Double_t b[3]={xbeam,ybeam,10.};
532 AliStrLine zeta(a,b,kTRUE);
533 static Double_t bField=TMath::Abs(AliTracker::GetBz()/10.); //T
534 SetMeanPPtSelTracks(bField);
537 // Loop on modules of layer 1
538 Int_t firstL1 = AliITSgeomTGeo::GetModuleIndex(1,1,1);
539 Int_t lastL1 = AliITSgeomTGeo::GetModuleIndex(2,1,1)-1;
540 for(Int_t modul1= firstL1; modul1<=lastL1;modul1++){ // Loop on modules of layer 1
541 if(!fUseModule[modul1]) continue;
542 UShort_t ladder=modul1/4+1; // ladders are numbered starting from 1
543 TClonesArray *prpl1=rpcont->UncheckedGetClusters(modul1);
544 Int_t nrecp1 = prpl1->GetEntries();
545 for(Int_t j=0;j<nrecp1;j++){
546 if(j>kMaxCluPerMod) continue;
547 UShort_t idClu1=modul1*kMaxCluPerMod+j;
548 if(fUsedCluster.TestBitNumber(idClu1)) continue;
549 AliITSRecPoint *recp1 = (AliITSRecPoint*)prpl1->At(j);
550 recp1->GetGlobalXYZ(gc1f);
551 for(Int_t ico=0;ico<3;ico++)gc1[ico]=gc1f[ico];
553 Double_t phi1 = TMath::ATan2(gc1[1]-ybeam,gc1[0]-xbeam);
554 if(phi1<0)phi1=2*TMath::Pi()+phi1;
555 for(Int_t ladl2=0 ; ladl2<fLadOnLay2*2+1;ladl2++){
556 for(Int_t k=0;k<4;k++){
557 Int_t ladmod=fLadders[ladder-1]+ladl2;
558 if(ladmod>AliITSgeomTGeo::GetNLadders(2)) ladmod=ladmod-AliITSgeomTGeo::GetNLadders(2);
559 Int_t modul2=AliITSgeomTGeo::GetModuleIndex(2,ladmod,k+1);
560 if(!fUseModule[modul2]) continue;
561 itsRec=rpcont->UncheckedGetClusters(modul2);
562 Int_t nrecp2 = itsRec->GetEntries();
563 for(Int_t j2=0;j2<nrecp2;j2++){
564 if(j2>kMaxCluPerMod) continue;
565 UShort_t idClu2=modul2*kMaxCluPerMod+j2;
566 if(fUsedCluster.TestBitNumber(idClu2)) continue;
567 AliITSRecPoint *recp2 = (AliITSRecPoint*)itsRec->At(j2);
568 recp2->GetGlobalXYZ(gc2f);
569 for(Int_t ico=0;ico<3;ico++)gc2[ico]=gc2f[ico];
570 Double_t phi2 = TMath::ATan2(gc2[1]-ybeam,gc2[0]-xbeam);
571 if(phi2<0)phi2=2*TMath::Pi()+phi2;
572 Double_t diff = TMath::Abs(phi2-phi1);
573 if(diff>TMath::Pi())diff=2.*TMath::Pi()-diff;
574 if(optCuts==0 && diff<fDiffPhiforPileup){
575 Double_t r1=TMath::Sqrt(gc1[0]*gc1[0]+gc1[1]*gc1[1]);
577 Double_t r2=TMath::Sqrt(gc2[0]*gc2[0]+gc2[1]*gc2[1]);
579 Double_t zr0=(r2*zc1-r1*zc2)/(r2-r1); //Z @ null radius
582 if(diff>deltaPhi)continue;
583 AliStrLine line(gc1,gc2,kTRUE);
585 Int_t retcode = line.Cross(&zeta,cp);
586 if(retcode<0)continue;
587 Double_t dca = line.GetDCA(&zeta);
589 if(dca>deltaR)continue;
590 Double_t deltaZ=cp[2]-zvert;
591 if(TMath::Abs(deltaZ)>dZmax)continue;
594 if(fLines.GetEntriesFast()>0)fLines.Clear("C");
597 recp2->GetGlobalCov(cov);
600 Double_t rad1=TMath::Sqrt(gc1[0]*gc1[0]+gc1[1]*gc1[1]);
601 Double_t rad2=TMath::Sqrt(gc2[0]*gc2[0]+gc2[1]*gc2[1]);
602 Double_t factor=(rad1+rad2)/(rad2-rad1); //factor to account for error on tracklet direction
606 Double_t curvRadius=fMeanPtSelTrk/(0.3*bField)*100; //cm
607 Double_t dRad=TMath::Sqrt((gc1[0]-gc2[0])*(gc1[0]-gc2[0])+(gc1[1]-gc2[1])*(gc1[1]-gc2[1]));
608 Double_t aux=dRad/2.+rad1;
609 curvErr=TMath::Sqrt(curvRadius*curvRadius-dRad*dRad/4.)-TMath::Sqrt(curvRadius*curvRadius-aux*aux); //cm
612 sigmasq[0]=(cov[0]+curvErr*curvErr/2.)*factor*factor;
613 sigmasq[1]=(cov[3]+curvErr*curvErr/2.)*factor*factor;
614 sigmasq[2]=cov[5]*factor*factor;
616 // Multiple scattering
617 Double_t pOverMass=fMeanPSelTrk/0.140;
618 Double_t beta2=pOverMass*pOverMass/(1+pOverMass*pOverMass);
619 Double_t p2=fMeanPSelTrk*fMeanPSelTrk;
620 Double_t rBP=GetPipeRadius();
621 Double_t dBP=0.08/35.3; // 800 um of Be
622 Double_t dL1=0.01; //approx. 1% of radiation length
623 Double_t theta2BP=14.1*14.1/(beta2*p2*1e6)*dBP;
624 Double_t theta2L1=14.1*14.1/(beta2*p2*1e6)*dL1;
625 Double_t rtantheta1=(rad2-rad1)*TMath::Tan(TMath::Sqrt(theta2L1));
626 Double_t rtanthetaBP=(rad1-rBP)*TMath::Tan(TMath::Sqrt(theta2BP));
627 for(Int_t ico=0; ico<3;ico++){
628 sigmasq[ico]+=rtantheta1*rtantheta1*factor*factor/3.;
629 sigmasq[ico]+=rtanthetaBP*rtanthetaBP*factor*factor/3.;
631 Double_t wmat[9]={1.,0.,0.,0.,1.,0.,0.,0.,1.};
632 if(sigmasq[0]!=0.) wmat[0]=1./sigmasq[0];
633 if(sigmasq[1]!=0.) wmat[4]=1./sigmasq[1];
634 if(sigmasq[2]!=0.) wmat[8]=1./sigmasq[2];
635 new(fLines[nolines++])AliStrLine(gc1,sigmasq,wmat,gc2,kTRUE,idClu1,idClu2);
642 if(nolines == 0)return -2;
646 //______________________________________________________________________
647 Int_t AliITSVertexer3D::Prepare3DVertex(Int_t optCuts){
648 // Finds the 3D vertex information using tracklets
651 Double_t xbeam=GetNominalPos()[0];
652 Double_t ybeam=GetNominalPos()[1];
654 Double_t deltaR=fCoarseMaxRCut;
655 Double_t dZmax=fZCutDiamond;
657 xbeam=fVert3D.GetXv();
658 ybeam=fVert3D.GetYv();
659 zvert=fVert3D.GetZv();
662 if(fPileupAlgo == 2){
666 }else if(optCuts==2){
667 xbeam=fVert3D.GetXv();
668 ybeam=fVert3D.GetYv();
672 Double_t rl=-fCoarseMaxRCut;
673 Double_t rh=fCoarseMaxRCut;
674 Double_t zl=-fZCutDiamond;
675 Double_t zh=fZCutDiamond;
676 Int_t nbr=(Int_t)((rh-rl)/fBinSizeR+0.0001);
677 Int_t nbz=(Int_t)((zh-zl)/fBinSizeZ+0.0001);
678 Int_t nbrcs=(Int_t)((rh-rl)/(fBinSizeR*2.)+0.0001);
679 Int_t nbzcs=(Int_t)((zh-zl)/(fBinSizeZ*2.)+0.0001);
681 TH3F *h3d = new TH3F("h3d","xyz distribution",nbr,rl,rh,nbr,rl,rh,nbz,zl,zh);
682 TH3F *h3dcs = new TH3F("h3dcs","xyz distribution",nbrcs,rl,rh,nbrcs,rl,rh,nbzcs,zl,zh);
684 // cleanup of the TCLonesArray of tracklets (i.e. fakes are removed)
685 Int_t *validate = new Int_t [fLines.GetEntriesFast()];
686 for(Int_t i=0; i<fLines.GetEntriesFast();i++)validate[i]=0;
687 for(Int_t i=0; i<fLines.GetEntriesFast()-1;i++){
688 AliStrLine *l1 = (AliStrLine*)fLines.At(i);
689 for(Int_t j=i+1;j<fLines.GetEntriesFast();j++){
690 AliStrLine *l2 = (AliStrLine*)fLines.At(j);
691 Double_t dca=l1->GetDCA(l2);
692 if(dca > fDCAcut || dca<0.00001) continue;
694 Int_t retc = l1->Cross(l2,point);
696 Double_t deltaZ=point[2]-zvert;
697 if(TMath::Abs(deltaZ)>dZmax)continue;
698 Double_t rad=TMath::Sqrt(point[0]*point[0]+point[1]*point[1]);
699 if(rad>fCoarseMaxRCut)continue;
700 Double_t deltaX=point[0]-xbeam;
701 Double_t deltaY=point[1]-ybeam;
702 Double_t raddist=TMath::Sqrt(deltaX*deltaX+deltaY*deltaY);
703 if(raddist>deltaR)continue;
706 h3d->Fill(point[0],point[1],point[2]);
707 h3dcs->Fill(point[0],point[1],point[2]);
713 Int_t numbtracklets=0;
714 for(Int_t i=0; i<fLines.GetEntriesFast();i++)if(validate[i]>=1)numbtracklets++;
722 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
723 if(validate[i]<1)fLines.RemoveAt(i);
726 AliDebug(1,Form("Number of tracklets (after compress)%d ",fLines.GetEntriesFast()));
729 // Exit here if Pileup Algorithm 2 has been chosen during second loop
730 if(fPileupAlgo == 2 && optCuts==1){
736 // Find peaks in histos
738 Double_t peak[3]={0.,0.,0.};
740 FindPeaks(h3d,peak,ntrkl,ntimes);
742 Double_t binsizer=(rh-rl)/nbr;
743 Double_t binsizez=(zh-zl)/nbz;
744 if(optCuts==0 && (ntrkl<=2 || ntimes>1)){
747 FindPeaks(h3dcs,peak,ntrkl,ntimes);
748 binsizer=(rh-rl)/nbrcs;
749 binsizez=(zh-zl)/nbzcs;
750 if(ntrkl==1 || ntimes>1){delete h3dcs; return retcode;}
754 // Second selection loop
756 Double_t bs=(binsizer+binsizez)/2.;
757 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
758 AliStrLine *l1 = (AliStrLine*)fLines.At(i);
759 if(l1->GetDistFromPoint(peak)>2.5*bs)fLines.RemoveAt(i);
762 AliDebug(1,Form("Number of tracklets (after 2nd compression) %d",fLines.GetEntriesFast()));
764 if(fLines.GetEntriesFast()>1){
766 // find a first candidate for the primary vertex
767 fVert3D=AliVertexerTracks::TrackletVertexFinder(&fLines,0);
768 // make a further selection on tracklets based on this first candidate
769 fVert3D.GetXYZ(peak);
770 AliDebug(1,Form("FIRST V candidate: %f ; %f ; %f",peak[0],peak[1],peak[2]));
771 Int_t *validate2 = new Int_t [fLines.GetEntriesFast()];
772 for(Int_t i=0; i<fLines.GetEntriesFast();i++) validate2[i]=1;
773 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
774 if(validate2[i]==0) continue;
775 AliStrLine *l1 = (AliStrLine*)fLines.At(i);
776 if(l1->GetDistFromPoint(peak)> fDCAcut)fLines.RemoveAt(i);
777 if(optCuts==2){ // temporarily only for pileup
778 for(Int_t j=i+1; j<fLines.GetEntriesFast();j++){
779 AliStrLine *l2 = (AliStrLine*)fLines.At(j);
780 if(l1->GetDCA(l2)<0.00001){
781 Int_t delta1=(Int_t)l1->GetIdPoint(0)-(Int_t)l2->GetIdPoint(0);
782 Int_t delta2=(Int_t)l1->GetIdPoint(1)-(Int_t)l2->GetIdPoint(1);
783 Int_t deltamod1=(Int_t)l1->GetIdPoint(0)/kMaxCluPerMod
784 -(Int_t)l2->GetIdPoint(0)/kMaxCluPerMod;
785 Int_t deltamod2=(Int_t)l1->GetIdPoint(1)/kMaxCluPerMod
786 -(Int_t)l2->GetIdPoint(1)/kMaxCluPerMod;
787 // remove tracklets sharing a point
788 if( (delta1==0 && deltamod2==0) ||
789 (delta2==0 && deltamod1==0) ) validate2[j]=0;
794 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
795 if(validate2[i]==0) fLines.RemoveAt(i);
799 AliDebug(1,Form("Number of tracklets (after 3rd compression) %d",fLines.GetEntriesFast()));
800 if(fLines.GetEntriesFast()>1){// this new tracklet selection is used
801 fVert3D=AliVertexerTracks::TrackletVertexFinder(&fLines,0);
807 //________________________________________________________
808 void AliITSVertexer3D::SetMeanPPtSelTracks(Double_t fieldTesla){
809 // Sets mean values of Pt based on the field
810 // for P (used in multiple scattering) the most probable value is used
811 if(TMath::Abs(fieldTesla-0.5)<0.01){
812 SetMeanPSelTracks(0.375);
813 SetMeanPtSelTracks(0.630);
814 }else if(TMath::Abs(fieldTesla-0.4)<0.01){
815 SetMeanPSelTracks(0.375);
816 SetMeanPtSelTracks(0.580);
817 }else if(TMath::Abs(fieldTesla-0.2)<0.01){
818 SetMeanPSelTracks(0.375);
819 SetMeanPtSelTracks(0.530);
820 }else if(fieldTesla<0.00001){
821 SetMeanPSelTracks(0.375);
822 SetMeanPtSelTracks(0.230);
825 SetMeanPtSelTracks();
829 //________________________________________________________
830 void AliITSVertexer3D::FindPeaks(TH3F* histo, Double_t *peak, Int_t &nOfTracklets, Int_t &nOfTimes){
831 // Finds bin with max contents in 3D histo of tracket intersections
832 TAxis *xax = histo->GetXaxis();
833 TAxis *yax = histo->GetYaxis();
834 TAxis *zax = histo->GetZaxis();
840 Int_t peakbin[3]={0,0,0};
841 Int_t peak2bin[3]={-1,-1,-1};
843 for(Int_t i=xax->GetFirst();i<=xax->GetLast();i++){
844 Double_t xval = xax->GetBinCenter(i);
845 for(Int_t j=yax->GetFirst();j<=yax->GetLast();j++){
846 Double_t yval = yax->GetBinCenter(j);
847 for(Int_t k=zax->GetFirst();k<=zax->GetLast();k++){
848 Double_t zval = zax->GetBinCenter(k);
849 Int_t bc =(Int_t)histo->GetBinContent(i,j,k);
864 }else if(bc==nOfTracklets){
865 if(TMath::Abs(i-peakbin[0])<=1 && TMath::Abs(j-peakbin[1])<=1 && TMath::Abs(k-peakbin[2])<=1){
878 if(peak2bin[0]>=-1 && bc2!=-1){ // two contiguous peak-cells with same contents
879 peak[0]=0.5*(xax->GetBinCenter(peakbin[0])+xax->GetBinCenter(peak2bin[0]));
880 peak[1]=0.5*(yax->GetBinCenter(peakbin[1])+yax->GetBinCenter(peak2bin[1]));
881 peak[2]=0.5*(zax->GetBinCenter(peakbin[2])+zax->GetBinCenter(peak2bin[2]));
886 //________________________________________________________
887 void AliITSVertexer3D::MarkUsedClusters(){
888 // Mark clusters of tracklets used in vertex claulation
889 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
890 AliStrLine *lin = (AliStrLine*)fLines.At(i);
891 Int_t idClu1=lin->GetIdPoint(0);
892 Int_t idClu2=lin->GetIdPoint(1);
893 fUsedCluster.SetBitNumber(idClu1);
894 fUsedCluster.SetBitNumber(idClu2);
897 //________________________________________________________
898 Int_t AliITSVertexer3D::RemoveTracklets(){
899 // Remove trackelts close to first found vertex
900 Double_t vert[3]={fVert3D.GetXv(),fVert3D.GetYv(),fVert3D.GetZv()};
902 for(Int_t i=0; i<fLines.GetEntriesFast();i++){
903 AliStrLine *lin = (AliStrLine*)fLines.At(i);
904 if(lin->GetDistFromPoint(vert)<fDCAforPileup){
905 Int_t idClu1=lin->GetIdPoint(0);
906 Int_t idClu2=lin->GetIdPoint(1);
907 fUsedCluster.SetBitNumber(idClu1);
908 fUsedCluster.SetBitNumber(idClu2);
916 //________________________________________________________
917 void AliITSVertexer3D::FindOther3DVertices(TTree *itsClusterTree){
918 // pileup identification based on 3D vertexing with not used clusters
921 Int_t nolines = FindTracklets(itsClusterTree,2);
923 Int_t nr=RemoveTracklets();
926 Int_t rc=Prepare3DVertex(2);
928 fVert3D=AliVertexerTracks::TrackletVertexFinder(&fLines,0);
929 if(fVert3D.GetNContributors()>=fMinTrackletsForPilup){
932 fVertArray = new AliESDVertex[2];
933 fVertArray[0]=(*fCurrentVertex);
934 fVertArray[1]=fVert3D;
935 fZpuv=fVert3D.GetZv();
936 fNTrpuv=fVert3D.GetNContributors();
942 //______________________________________________________________________
943 void AliITSVertexer3D::PileupFromZ(){
944 // Calls the pileup algorithm of ALiITSVertexerZ
945 Int_t binmin, binmax;
946 Int_t nPeaks=AliITSVertexerZ::GetPeakRegion(fZHisto,binmin,binmax);
947 if(nPeaks==2)AliWarning("2 peaks found");
948 Int_t firstPeakCont=0;
949 Double_t firstPeakPos=0.;
950 for(Int_t i=binmin-1;i<=binmax+1;i++){
951 firstPeakCont+=static_cast<Int_t>(fZHisto->GetBinContent(i));
952 firstPeakPos+=fZHisto->GetBinContent(i)*fZHisto->GetBinCenter(i);
955 firstPeakPos/=firstPeakCont;
957 if(firstPeakCont>fMinTrackletsForPilup){
959 ncontr2=AliITSVertexerZ::FindSecondPeak(fZHisto,binmin,binmax,secPeakPos);
960 if(ncontr2>=fMinTrackletsForPilup){
963 AliESDVertex secondVert(secPeakPos,0.1,ncontr2);
964 fVertArray = new AliESDVertex[2];
965 fVertArray[0]=(*fCurrentVertex);
966 fVertArray[1]=secondVert;
973 //________________________________________________________
974 void AliITSVertexer3D::PrintStatus() const {
975 // Print current status
976 printf("========= First step selections =====================\n");
977 printf("Cut on diamond (Z) %f\n",fZCutDiamond);
978 printf("Loose cut on Delta Phi %f\n",fCoarseDiffPhiCut);
979 printf("Loose cut on tracklet DCA to Z axis %f\n",fCoarseMaxRCut);
980 printf("Cut on DCA - tracklet to tracklet and to vertex %f\n",fDCAcut);
981 printf("========= Second step selections ====================\n");
982 printf("Cut on tracklet-to-first-vertex Z distance %f\n",fMaxZCut);
983 printf("Max Phi difference: %f\n",fDiffPhiMax);
984 printf("Cut on tracklet DCA to beam axis %f\n",fMaxRCut);
985 printf("Cut on tracklet DCA to beam axis (algo2) %f\n",fMaxRCut2);
986 printf("========= Pileup selections =========================\n");
987 printf("Pileup algo: %d\n",fPileupAlgo);
988 printf("Min DCA to 1st vertex for pileup (algo 0 and 1): %f\n",fDCAforPileup);
989 printf("Cut on distance between pair-vertices (algo 2): %f\n",fCutOnPairs);
990 printf("Maximum number of clusters allowed on L1 or L2: %d\n",fMaxNumOfCl);
991 printf("=======================================================\n");