1 /**************************************************************************
2 * Copyright(c) 1998-1999, 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 **************************************************************************/
18 //////////////////////////////////////////////////////////////////////////////
19 // Clusterization class for IHEP reconstruction.
20 // Performs clusterization (collects neighbouring active cells)
21 // It differs from AliPHOSClusterizerv1 in neighbour definition only
22 //*-- Author: Boris Polichtchouk, IHEP
24 // --- ROOT system ---
25 #include "TBenchmark.h"
28 // --- Standard library ---
30 // --- AliRoot header files ---
31 #include "AliPHOSClusterizerv2.h"
32 #include "AliPHOSGetter.h"
34 #include "AliPHOSEvalRecPoint.h"
35 #include "AliPHOSRecCpvManager.h"
36 #include "AliPHOSRecEmcManager.h"
38 ClassImp(AliPHOSClusterizerv2)
40 //____________________________________________________________________________
41 AliPHOSClusterizerv2::AliPHOSClusterizerv2() : AliPHOSClusterizerv1()
44 //____________________________________________________________________________
45 AliPHOSClusterizerv2::AliPHOSClusterizerv2(const char * headerFile, const char * name):
46 AliPHOSClusterizerv1(headerFile,name)
49 //____________________________________________________________________________
50 AliPHOSClusterizerv2::AliPHOSClusterizerv2(const AliPHOSClusterizerv2 & clu):
51 AliPHOSClusterizerv1(clu)
54 //____________________________________________________________________________
55 void AliPHOSClusterizerv2::GetNumberOfClustersFound(int* numb) const
57 // Returns the number of found EMC and CPV rec.points
59 AliPHOSGetter * gime = AliPHOSGetter::Instance() ;
60 numb[0] = gime->EmcRecPoints()->GetEntries();
61 numb[1] = gime->CpvRecPoints()->GetEntries();
64 //____________________________________________________________________________
65 void AliPHOSClusterizerv2::Exec(Option_t* option)
69 if(strstr(option,"tim"))
70 gBenchmark->Start("PHOSClusterizer");
72 if(strstr(option,"print"))
75 AliPHOSGetter * gime = AliPHOSGetter::Instance() ;
77 TFolder* wPoolF = gime->PhosLoader()->GetDetectorDataFolder();
79 TObjArray* wPool = new TObjArray(400);
80 wPool->SetName("SmartPoints");
84 Int_t nevents = gime->MaxEvent() ;
87 for(ievent = 0; ievent<nevents; ievent++) {
89 gime->Event(ievent,"D") ;
91 Info("Exec", "MakeClusters invoked..") ;
93 Info("Exec", "MakeClusters done.") ;
96 //SmartRecPoints will communicate with wPool.
98 AliPHOSEvalRecPoint* rp=0;
100 // CPV reconstruction
102 AliPHOSRecCpvManager* recCpv = new AliPHOSRecCpvManager();
105 Int_t iPoint; //loop variable
107 for(iPoint=0; iPoint<gime->CpvRecPoints()->GetEntriesFast(); iPoint++) {
108 rp = new AliPHOSEvalRecPoint(iPoint, kTRUE);
112 AliPHOSEvalRecPoint pt;
113 pt.UpdateWorkingPool();
115 TObjArray * cpvRecPoints = gime->CpvRecPoints() ;
116 Int_t nOldCpv = cpvRecPoints->GetEntries();
117 cpvRecPoints->Delete();
118 cpvRecPoints->Compress();
120 Int_t i; //loop variable
122 for(i=0; i<wPool->GetEntries(); i++)
123 cpvRecPoints->Add(wPool->At(i));
128 wPoolF->Remove(recCpv);
131 Info("Exec", " %d", gime->CpvRecPoints()->GetEntries() ) ;
132 Info("Exec", " %d cpvRecPoints", cpvRecPoints->GetEntries() ) ;
135 // Now Emc reconstruction
137 AliPHOSRecEmcManager* recEmc = new AliPHOSRecEmcManager();
140 for(iPoint=0; iPoint<gime->EmcRecPoints()->GetEntriesFast(); iPoint++) {
141 rp = new AliPHOSEvalRecPoint(iPoint, kFALSE);
145 pt.UpdateWorkingPool();
147 TObjArray * emcRecPoints = gime->EmcRecPoints() ;
148 Int_t nOldEmc = emcRecPoints->GetEntries();
149 emcRecPoints->Delete();
150 emcRecPoints->Compress();
152 for(i=0; i<wPool->GetEntries(); i++)
153 emcRecPoints->Add(wPool->At(i));
158 wPoolF->Remove(recEmc);
162 message = " %d OLD cpvRecPoints\n" ;
164 message += " %d cpvRecPoints\n" ;
166 message += " %d OLD emcRecPoints " ;
168 message += " %d emcRecPoints\n" ;
170 Info("Exec", message.Data(),
172 gime->CpvRecPoints()->GetEntries(),cpvRecPoints->GetEntries(),
174 gime->EmcRecPoints()->GetEntries(), emcRecPoints->GetEntries() ) ;
179 } // loop over events
181 if(strstr(option,"tim")) {
182 gBenchmark->Stop("PHOSClusterizer");
183 Info("Exec","took %f seconds for Clusterizing", gBenchmark->GetCpuTime("PHOSClusterizer") ) ;
187 //____________________________________________________________________________
188 Int_t AliPHOSClusterizerv2::AreNeighbours(AliPHOSDigit* d1, AliPHOSDigit* d2) const
190 // Points are neighbours if they have common edge.
191 // Points with common vertex are NOT neighbours.
192 // This treatment of neighbourship is the part of
193 // IHEP algorithm of clusterization.
195 // Gives the neighbourness of two digits = 0 are not neighbour but continue searching
197 // = 2 are not neighbour but do not continue searching
198 // The order of d1 and d2 is important: first (d1) should be a digit already in a cluster
199 // which is compared to a digit (d2) not yet in a cluster
201 const AliPHOSGeometry * geom = AliPHOSGetter::Instance()->PHOSGeometry();
206 geom->AbsToRelNumbering(d1->GetId(), relid1) ;
209 geom->AbsToRelNumbering(d2->GetId(), relid2) ;
211 if ( (relid1[0] == relid2[0]) && (relid1[1]==relid2[1]) ) { // inside the same PHOS module and the same PPSD Module
212 Int_t rowdiff = TMath::Abs( relid1[2] - relid2[2] ) ;
213 Int_t coldiff = TMath::Abs( relid1[3] - relid2[3] ) ;
215 if ( ( (coldiff < 1) && (rowdiff <= 1) ) || ( ( coldiff <= 1 ) && ( rowdiff < 1 ) ) ){
219 if((relid2[2] > relid1[2]) && (relid2[3] > relid1[3]+1))
220 rv = 2; // Difference in row numbers is too large to look further
226 if( (relid1[0] < relid2[0]) || (relid1[1] < relid2[1]) )