fZsig = 0.;
fZCombc = 0;
fZCombf = 0;
+ fZCombv = 0;
SetLowLimit(0.);
SetHighLimit(0.);
SetBinWidthCoarse(0.);
SetBinWidthFine(0.);
SetTolerance(0.);
+ SetPPsetting(0.,0.);
}
//______________________________________________________________________
fZsig = 0.;
fZCombc = 0;
fZCombf = 0;
+ fZCombv = 0;
SetLowLimit();
SetHighLimit();
SetBinWidthCoarse();
SetBinWidthFine();
SetTolerance();
+ SetPPsetting();
}
return *this;
}
-
//______________________________________________________________________
AliITSVertexerZ::~AliITSVertexerZ() {
- // Default Destructor
- //fITS = 0;
- if(fZCombc)delete fZCombc;
- if(fZCombf)delete fZCombf;
+ // Destructor
+ delete fZCombc;
+ delete fZCombf;
+ delete fZCombv;
}
//______________________________________________________________________
TTree *tR = itsLoader->TreeR();
detTypeRec.SetTreeAddressR(tR);
TClonesArray *itsRec = 0;
+ // lc and gc are local and global coordinates for layer 1
Float_t lc[3]; for(Int_t ii=0; ii<3; ii++) lc[ii]=0.;
Float_t gc[3]; for(Int_t ii=0; ii<3; ii++) gc[ii]=0.;
+ // lc2 and gc2 are local and global coordinates for layer 2
Float_t lc2[3]; for(Int_t ii=0; ii<3; ii++) lc2[ii]=0.;
Float_t gc2[3]; for(Int_t ii=0; ii<3; ii++) gc2[ii]=0.;
TBranch *branch;
branch = tR->GetBranch("ITSRecPoints");
- Int_t nbinfine = static_cast<Int_t>((fHighLim-fLowLim)/fStepFine);
- Int_t nbincoarse = static_cast<Int_t>((fHighLim-fLowLim)/fStepCoarse);
- if(fZCombc)delete fZCombc;
- fZCombc = new TH1F("fZCombc","Z",nbincoarse,fLowLim,fLowLim+nbincoarse*fStepCoarse);
- if(fZCombf)delete fZCombf;
- fZCombf = new TH1F("fZCombf","Z",nbinfine,fLowLim,fLowLim+nbinfine*fStepFine);
-
Int_t nrpL1 = 0;
Int_t nrpL2 = 0;
+ // By default fFirstL1=0 and fLastL1=79
+ // This loop counts the number of recpoints on layer1 (central modules)
for(Int_t module= fFirstL1; module<=fLastL1;module++){
+ // Keep only central modules
if(module%4==0 || module%4==3)continue;
+ // cout<<"Procesing module "<<module<<" ";
branch->GetEvent(module);
+ // cout<<"Number of clusters "<<clusters->GetEntries()<<endl;
nrpL1+= itsRec->GetEntries();
detTypeRec.ResetRecPoints();
}
+ //By default fFirstL2=80 and fLastL2=239
+ //This loop counts the number of RP on layer 2
for(Int_t module= fFirstL2; module<=fLastL2;module++){
branch->GetEvent(module);
nrpL2+= itsRec->GetEntries();
ResetHistograms();
return fCurrentVertex;
}
- Float_t *xc1 = new Float_t [nrpL1];
+ // The vertex finding is attempted only if the number of RP is !=0 on
+ // both layers
+ Float_t *xc1 = new Float_t [nrpL1]; // coordinates of the L1 Recpoints
Float_t *yc1 = new Float_t [nrpL1];
Float_t *zc1 = new Float_t [nrpL1];
Float_t *phi1 = new Float_t [nrpL1];
- Float_t *xc2 = new Float_t [nrpL2];
+ Float_t *xc2 = new Float_t [nrpL2]; // coordinates of the L1 Recpoints
Float_t *yc2 = new Float_t [nrpL2];
Float_t *zc2 = new Float_t [nrpL2];
Float_t *phi2 = new Float_t [nrpL2];
- Int_t ind = 0;
+ Int_t ind = 0;// running index for RP
+ // Force a coarse bin size of 200 microns if the number of clusters on layer 2
+ // is low
+ if(nrpL2<fPPsetting[0])SetBinWidthCoarse(fPPsetting[1]);
+ // By default nbinfine = (10+10)/0.0005=40000
+ Int_t nbinfine = static_cast<Int_t>((fHighLim-fLowLim)/fStepFine);
+ // By default nbincoarse=(10+10)/0.01=2000
+ Int_t nbincoarse = static_cast<Int_t>((fHighLim-fLowLim)/fStepCoarse);
+ // Set stepverycoarse = 3*fStepCoarse
+ Int_t nbinvcoarse = static_cast<Int_t>((fHighLim-fLowLim)/(3.*fStepCoarse));
+ if(fZCombc)delete fZCombc;
+ fZCombc = new TH1F("fZCombc","Z",nbincoarse,fLowLim,fLowLim+nbincoarse*fStepCoarse);
+ if(fZCombv)delete fZCombv;
+ fZCombv = new TH1F("fZCombv","Z",nbinvcoarse,fLowLim,fLowLim+nbinvcoarse*3.*fStepCoarse);
+ if(fZCombf)delete fZCombf;
+ fZCombf = new TH1F("fZCombf","Z",nbinfine,fLowLim,fLowLim+nbinfine*fStepFine);
+ // Loop on modules of layer 1 (restricted to central modules)
for(Int_t module= fFirstL1; module<=fLastL1;module++){
if(module%4==0 || module%4==3)continue;
branch->GetEvent(module);
Int_t nrecp1 = itsRec->GetEntries();
for(Int_t j=0;j<nrecp1;j++){
AliITSRecPoint *recp = (AliITSRecPoint*)itsRec->At(j);
+ // Local coordinates of this recpoint
lc[0]=recp->GetDetLocalX();
lc[2]=recp->GetDetLocalZ();
geom->LtoG(module,lc,gc);
- gc[0]-=fX0;
- gc[1]-=fY0;
+ // Global coordinates of this recpoints
+ gc[0]-=fX0; // Possible beam offset in the bending plane
+ gc[1]-=fY0; // " "
xc1[ind]=gc[0];
yc1[ind]=gc[1];
zc1[ind]=gc[2];
+ // azimuthal angle is computed in the interval 0 --> 2*pi
phi1[ind] = TMath::ATan2(gc[1],gc[0]);
if(phi1[ind]<0)phi1[ind]=2*TMath::Pi()+phi1[ind];
ind++;
}
detTypeRec.ResetRecPoints();
}
- ind = 0;
+ ind = 0; // the running index is reset for Layer 2
for(Int_t module= fFirstL2; module<=fLastL2;module++){
branch->GetEvent(module);
Int_t nrecp2 = itsRec->GetEntries();
}
detTypeRec.ResetRecPoints();
}
- for(Int_t i=0;i<nrpL1;i++){
- Float_t r1=TMath::Sqrt(xc1[i]*xc1[i]+yc1[i]*yc1[i]);
- for(Int_t j=0;j<nrpL2;j++){
- Float_t diff = TMath::Abs(phi2[j]-phi1[i]);
- if(diff>TMath::Pi())diff=2.*TMath::Pi()-diff;
- if(diff<fDiffPhiMax){
- Float_t r2=TMath::Sqrt(xc2[j]*xc2[j]+yc2[j]*yc2[j]);
- Float_t zr0=(r2*zc1[i]-r1*zc2[j])/(r2-r1);
+ for(Int_t i=0;i<nrpL1;i++){ // loop on L1 RP
+ Float_t r1=TMath::Sqrt(xc1[i]*xc1[i]+yc1[i]*yc1[i]); // radius L1 RP
+ for(Int_t j=0;j<nrpL2;j++){ // loop on L2 RP
+ Float_t diff = TMath::Abs(phi2[j]-phi1[i]); // diff in azimuth
+ if(diff>TMath::Pi())diff=2.*TMath::Pi()-diff; //diff<pi
+ if(diff<fDiffPhiMax){ // cut on 10 milliradians by def.
+ Float_t r2=TMath::Sqrt(xc2[j]*xc2[j]+yc2[j]*yc2[j]); // radius L2 RP
+ Float_t zr0=(r2*zc1[i]-r1*zc2[j])/(r2-r1); //Z @ null radius
fZCombf->Fill(zr0);
fZCombc->Fill(zr0);
+ fZCombv->Fill(zr0);
}
}
}
ResetHistograms();
return fCurrentVertex;
}
- // else {
- // cout<<"Number of entries in hist. "<<fZCombc->GetEntries()<<endl;
- // }
- Int_t bi = fZCombc->GetMaximumBin();
- Float_t centre = fZCombc->GetBinCenter(bi);
- Int_t n1 = static_cast<Int_t>((centre-fZCombc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
- Int_t n2 = static_cast<Int_t>((centre+fZCombc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
+ /*
+ else {
+ if(fDebug>0)cout<<"Number of entries in hist. "<<fZCombc->GetEntries()<<endl;
+ }
+ */
+
+ TH1F *hc = fZCombc;
+ Bool_t goon = kFALSE;
+ Int_t cnt = 0;
+ Int_t bi;
+
+ do {
+ goon = kFALSE;
+ cnt++;
+ bi = hc->GetMaximumBin(); // bin with maximal content on coarse histogram
+ if(hc->GetBinContent(bi)<3){
+ if(cnt==1)goon = kTRUE;
+ hc = fZCombv;
+ }
+ } while(goon);
+
+
+ Float_t centre = hc->GetBinCenter(bi); // z value of the bin with maximal content
+
+ // evaluation of the centroid
+ Int_t ii1=TMath::Max(bi-3,1);
+ Int_t ii2=TMath::Min(bi+3,hc->GetNbinsX());
+ centre = 0.;
+ Int_t nn=0;
+ for(Int_t ii=ii1;ii<ii2;ii++){
+ centre+= hc->GetBinCenter(ii)*hc->GetBinContent(ii);
+ nn+=static_cast<Int_t>(hc->GetBinContent(ii));
+ }
+ centre/=nn;
+ /*
+ if(fDebug>0){
+ cout<<"Value of center "<<centre<<endl;
+ cout<<"Population of 3 central bins: "<<hc->GetBinContent(bi-1)<<", ";
+ cout<<hc->GetBinContent(bi)<<", ";
+ cout<<hc->GetBinContent(bi+1)<<endl;
+ }
+ */
+ // n1 is the bin number of fine histogram containing the point located 1 coarse bin less than "centre"
+ Int_t n1 = static_cast<Int_t>((centre-hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
+ // n2 is the bin number of fine histogram containing the point located 1 coarse bin more than "centre"
+ Int_t n2 = static_cast<Int_t>((centre+hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
+ if(n1<1)n1=1;
+ if(n2>nbinfine)n2=nbinfine;
Int_t niter = 0;
- Bool_t goon = kTRUE;
- Int_t num;
- while(goon){
+ goon = kTRUE;
+ Int_t num=0;
+ Bool_t last = kFALSE;
+
+ while(goon || last){
fZFound = 0.;
fZsig = 0.;
num=0;
+ // at the end of the loop:
+ // fZFound = N*(Average Z) - where N is the number of tracklets
+ // num=N
+ // fZsig = N*Q - where Q is the average of Z*Z
for(Int_t n=n1;n<=n2;n++){
fZFound+=fZCombf->GetBinCenter(n)*fZCombf->GetBinContent(n);
num+=static_cast<Int_t>(fZCombf->GetBinContent(n));
if(num<2){
fZsig = 0.;
}
- else {
+ else{
Float_t radi = fZsig/(num-1)-fZFound*fZFound/num/(num-1);
+ // radi = square root of sample variance of Z
if(radi>0.)fZsig=TMath::Sqrt(radi);
else fZsig=0.;
+ // fZfound - Average Z
fZFound/=num;
}
- goon = TMath::Abs(TMath::Abs(fZFound-fZCombf->GetBinCenter(n1))-TMath::Abs(fZFound-fZCombf->GetBinCenter(n2)))>fTolerance;
- n1 = static_cast<Int_t>((fZFound-fZCombc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
- n2 = static_cast<Int_t>((fZFound+fZCombc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
- niter++;
- if(niter>=10){
- goon = kFALSE;
- Warning("FindVertexForCurrentEvent","The procedure dows not converge\n");
+ if(!last){
+ // goon is true if the distance between the found Z and the lower bin differs from the distance between the found Z and
+ // the upper bin by more than tolerance (0.002)
+ goon = TMath::Abs(TMath::Abs(fZFound-fZCombf->GetBinCenter(n1))-TMath::Abs(fZFound-fZCombf->GetBinCenter(n2)))>fTolerance;
+ // a window in the fine grained histogram is centered aroung the found Z. The width is 2 bins of
+ // the coarse grained histogram
+ n1 = static_cast<Int_t>((fZFound-hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
+ if(n1<1)n1=1;
+ n2 = static_cast<Int_t>((fZFound+hc->GetBinWidth(bi)-fZCombf->GetBinLowEdge(0))/fStepFine);
+ if(n2>nbinfine)n2=nbinfine;
+ /*
+ if(fDebug>0){
+ cout<<"Search restricted to n1 = "<<n1<<", n2= "<<n2<<endl;
+ cout<<"z1= "<<fZCombf->GetBinCenter(n1)<<", n2 = "<<fZCombf->GetBinCenter(n2)<<endl;
+ }
+ */
+ niter++;
+ // no more than 10 adjusting iterations
+ if(niter>=10){
+ goon = kFALSE;
+ Warning("FindVertexForCurrentEvent","The procedure dows not converge\n");
+ }
+
+ if((fZsig> 0.0001) && !goon && num>5){
+ last = kTRUE;
+ n1 = static_cast<Int_t>((fZFound-fZsig-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
+ if(n1<1)n1=1;
+ n2 = static_cast<Int_t>((fZFound+fZsig-fZCombf->GetBinLowEdge(0))/fZCombf->GetBinWidth(0));
+ if(n2>nbinfine)n2=nbinfine;
+ /*
+ if(fDebug>0){
+ cout<<"FINAL Search restricted to n1 = "<<n1<<", n2= "<<n2<<endl;
+ cout<<"z1= "<<fZCombf->GetBinCenter(n1)<<", n2 = "<<fZCombf->GetBinCenter(n2)<<endl;
+ }
+ */
+ }
+ }
+ else {
+ last = kFALSE;
}
+
}
- // cout<<"Numer of Iterations "<<niter<<endl<<endl;
+ // if(fDebug>0)cout<<"Numer of Iterations "<<niter<<endl<<endl;
+ if(num!=0)fZsig/=TMath::Sqrt(num);
fCurrentVertex = new AliESDVertex(fZFound,fZsig,num);
fCurrentVertex->SetTitle("vertexer: B");
ResetHistograms();
// delete TH1 data members
if(fZCombc)delete fZCombc;
if(fZCombf)delete fZCombf;
+ if(fZCombv)delete fZCombv;
fZCombc = 0;
fZCombf = 0;
+ fZCombv = 0;
}
//______________________________________________________________________
if(fCurrentVertex){
WriteCurrentVertex();
}
+ /*
else {
if(fDebug>0){
cout<<"Vertex not found for event "<<i<<endl;
cout<<"fZFound = "<<fZFound<<", fZsig= "<<fZsig<<endl;
}
}
+ */
}
}
cout <<" Debug flag: "<<fDebug<<endl;
cout <<"First event to be processed "<<fFirstEvent;
cout <<"\n Last event to be processed "<<fLastEvent<<endl;
-
+ if(fZCombc){
+ cout<<"fZCombc exists - entries="<<fZCombc->GetEntries()<<endl;
+ }
+ else{
+ cout<<"fZCombc does not exist\n";
+ }
+ if(fZCombv){
+ cout<<"fZCombv exists - entries="<<fZCombv->GetEntries()<<endl;
+ }
+ else{
+ cout<<"fZCombv does not exist\n";
+ }
+ if(fZCombf){
+ cout<<"fZCombf exists - entries="<<fZCombv->GetEntries()<<endl;
+ }
+ else{
+ cout<<"fZCombf does not exist\n";
+ }
cout <<"=======================================================\n";
}
git://git.uio.no / u / mrichter / AliRoot.git / blobdiff