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 Revision 1.7 2001/02/14 18:22:26 cblume
19 Change in the geometry of the padplane
21 Revision 1.6 2000/11/01 14:53:20 cblume
22 Merge with TRD-develop
24 Revision 1.1.4.6 2000/10/16 01:16:53 cblume
25 Changed timebin 0 to be the one closest to the readout
27 Revision 1.1.4.5 2000/10/15 23:40:01 cblume
30 Revision 1.1.4.4 2000/10/06 16:49:46 cblume
33 Revision 1.1.4.3 2000/10/04 16:34:58 cblume
34 Replace include files by forward declarations
36 Revision 1.1.4.2 2000/09/22 14:49:49 cblume
37 Adapted to tracking code
39 Revision 1.5 2000/10/02 21:28:19 fca
40 Removal of useless dependecies via forward declarations
42 Revision 1.4 2000/06/08 18:32:58 cblume
43 Make code compliant to coding conventions
45 Revision 1.3 2000/06/07 16:27:01 cblume
46 Try to remove compiler warnings on Sun and HP
48 Revision 1.2 2000/05/08 16:17:27 cblume
51 Revision 1.1.4.1 2000/05/08 15:08:41 cblume
52 Replace AliTRDcluster by AliTRDrecPoint
54 Revision 1.4 2000/06/08 18:32:58 cblume
55 Make code compliant to coding conventions
57 Revision 1.3 2000/06/07 16:27:01 cblume
58 Try to remove compiler warnings on Sun and HP
60 Revision 1.2 2000/05/08 16:17:27 cblume
63 Revision 1.1.4.1 2000/05/08 15:08:41 cblume
64 Replace AliTRDcluster by AliTRDrecPoint
66 Revision 1.1 2000/02/28 18:58:33 cblume
71 ///////////////////////////////////////////////////////////////////////////////
73 // TRD cluster finder for the fast simulator. It takes the hits from the //
74 // fast simulator (one hit per plane) and transforms them //
75 // into cluster, by applying position smearing and merging //
76 // of nearby cluster. The searing is done uniformly in z-direction //
77 // over the length of a readout pad. In rphi-direction a Gaussian //
78 // smearing is applied with a sigma given by fRphiSigma. //
79 // Clusters are considered as overlapping when they are closer in //
80 // rphi-direction than the value defined in fRphiDist. //
81 // Use the macro fastClusterCreate.C to create the cluster. //
83 ///////////////////////////////////////////////////////////////////////////////
91 #include "AliTRDclusterizerV0.h"
92 #include "AliTRDhit.h"
93 #include "AliTRDgeometry.h"
94 #include "AliTRDrecPoint.h"
96 ClassImp(AliTRDclusterizerV0)
98 //_____________________________________________________________________________
99 AliTRDclusterizerV0::AliTRDclusterizerV0():AliTRDclusterizer()
102 // AliTRDclusterizerV0 default constructor
107 //_____________________________________________________________________________
108 AliTRDclusterizerV0::AliTRDclusterizerV0(const Text_t* name, const Text_t* title)
109 :AliTRDclusterizer(name,title)
112 // AliTRDclusterizerV0 default constructor
119 //_____________________________________________________________________________
120 AliTRDclusterizerV0::~AliTRDclusterizerV0()
123 // AliTRDclusterizerV0 destructor
128 //_____________________________________________________________________________
129 void AliTRDclusterizerV0::Init()
132 // Initializes the cluster finder
135 // Position resolution in rphi-direction
137 // Minimum distance of non-overlapping cluster
142 //_____________________________________________________________________________
143 Bool_t AliTRDclusterizerV0::MakeClusters()
146 // Generates the cluster
149 if (fTRD->IsVersion() != 0) {
150 printf("AliTRDclusterizerV0::MakeCluster -- ");
151 printf("TRD must be version 0 (fast simulator).\n");
156 AliTRDgeometry *geo = fTRD->GetGeometry();
158 printf("AliTRDclusterizerV0::MakeCluster -- ");
159 printf("Start creating cluster.\n");
165 // Get the pointer to the hit tree
166 TTree *hitTree = gAlice->TreeH();
167 // Get the pointer to the reconstruction tree
168 TTree *clusterTree = gAlice->TreeR();
170 TObjArray *chamberArray = new TObjArray();
172 // Get the number of entries in the hit tree
173 // (Number of primary particles creating a hit somewhere)
174 Int_t nTrack = (Int_t) hitTree->GetEntries();
176 // Loop through all the chambers
177 for (Int_t icham = 0; icham < AliTRDgeometry::Ncham(); icham++) {
178 for (Int_t iplan = 0; iplan < AliTRDgeometry::Nplan(); iplan++) {
179 for (Int_t isect = 0; isect < AliTRDgeometry::Nsect(); isect++) {
181 Int_t nColMax = geo->GetColMax(iplan);
182 Float_t row0 = geo->GetRow0(iplan,icham,isect);
183 Float_t col0 = geo->GetCol0(iplan);
184 Float_t time0 = geo->GetTime0(iplan);
186 Float_t rowPadSize = geo->GetRowPadSize(iplan,icham,isect);
187 Float_t colPadSize = geo->GetColPadSize(iplan);
188 Float_t timeBinSize = geo->GetTimeBinSize();
190 // Loop through all entries in the tree
191 for (Int_t iTrack = 0; iTrack < nTrack; iTrack++) {
194 nBytes += hitTree->GetEvent(iTrack);
196 // Get the number of hits in the TRD created by this particle
197 Int_t nHit = fTRD->Hits()->GetEntriesFast();
199 // Loop through the TRD hits
200 for (Int_t iHit = 0; iHit < nHit; iHit++) {
202 if (!(hit = (AliTRDhit *) fTRD->Hits()->UncheckedAt(iHit)))
209 Int_t track = hit->Track();
210 Int_t detector = hit->GetDetector();
211 Int_t plane = geo->GetPlane(detector);
212 Int_t sector = geo->GetSector(detector);
213 Int_t chamber = geo->GetChamber(detector);
215 if ((sector != isect) ||
220 // Rotate the sectors on top of each other
222 geo->Rotate(detector,pos,rot);
224 // Add this recPoint to the temporary array for this chamber
225 AliTRDrecPoint *recPoint = new AliTRDrecPoint();
226 recPoint->SetLocalRow(rot[2]);
227 recPoint->SetLocalCol(rot[1]);
228 recPoint->SetLocalTime(rot[0]);
229 recPoint->SetEnergy(0);
230 recPoint->SetDetector(detector);
231 recPoint->AddDigit(track);
232 chamberArray->Add(recPoint);
238 // Loop through the temporary cluster-array
239 for (Int_t iClus1 = 0; iClus1 < chamberArray->GetEntries(); iClus1++) {
241 AliTRDrecPoint *recPoint1 = (AliTRDrecPoint *)
242 chamberArray->UncheckedAt(iClus1);
243 Float_t row1 = recPoint1->GetLocalRow();
244 Float_t col1 = recPoint1->GetLocalCol();
245 Float_t time1 = recPoint1->GetLocalTime();
247 if (recPoint1->GetEnergy() < 0) continue; // Skip marked cluster
249 const Int_t kNsave = 5;
250 Int_t idxSave[kNsave];
253 const Int_t kNsaveTrack = 3;
254 Int_t tracks[kNsaveTrack];
255 tracks[0] = recPoint1->GetDigit(0);
257 // Check the other cluster to see, whether there are close ones
258 for (Int_t iClus2 = iClus1 + 1; iClus2 < chamberArray->GetEntries(); iClus2++) {
260 AliTRDrecPoint *recPoint2 = (AliTRDrecPoint *)
261 chamberArray->UncheckedAt(iClus2);
262 Float_t row2 = recPoint2->GetLocalRow();
263 Float_t col2 = recPoint2->GetLocalCol();
265 if ((TMath::Abs(row1 - row2) < rowPadSize) ||
266 (TMath::Abs(col1 - col2) < fRphiDist)) {
267 if (iSave == kNsave) {
268 printf("AliTRDclusterizerV0::MakeCluster -- ");
269 printf("Boundary error: iSave = %d, kNsave = %d.\n"
273 idxSave[iSave] = iClus2;
275 if (iSave < kNsaveTrack) tracks[iSave] = recPoint2->GetDigit(0);
280 // Merge close cluster
281 Float_t rowMerge = row1;
282 Float_t colMerge = col1;
284 for (Int_t iMerge = 0; iMerge < iSave; iMerge++) {
285 AliTRDrecPoint *recPoint2 =
286 (AliTRDrecPoint *) chamberArray->UncheckedAt(idxSave[iMerge]);
287 rowMerge += recPoint2->GetLocalRow();
288 colMerge += recPoint2->GetLocalCol();
289 recPoint2->SetEnergy(-1); // Mark merged cluster
291 rowMerge /= (iSave + 1);
292 colMerge /= (iSave + 1);
297 // The position smearing in row-direction (uniform over pad width)
298 Int_t row = (Int_t) ((rowMerge - row0) / rowPadSize);
299 smear[0] = (row + gRandom->Rndm()) * rowPadSize + row0;
301 // The position smearing in rphi-direction (Gaussian)
304 smear[1] = gRandom->Gaus(colMerge,fRphiSigma);
305 while ((smear[1] < col0 ) ||
306 (smear[1] > col0 + nColMax * colPadSize));
308 // Time direction stays unchanged
311 // Transform into local coordinates
312 smear[0] = (Int_t) ((smear[0] - row0) / rowPadSize);
313 smear[1] = (Int_t) ((smear[1] - col0) / colPadSize);
314 smear[2] = (Int_t) ((time0 - smear[2]) / timeBinSize);
316 // Add the smeared cluster to the output array
317 Int_t detector = recPoint1->GetDetector();
318 Int_t digits[3] = {0};
320 fTRD->AddCluster(smear,digits,detector,0.0,tr,0);
324 // Clear the temporary cluster-array and delete the cluster
325 chamberArray->Delete();
331 printf("AliTRDclusterizerV0::MakeCluster -- ");
332 printf("Found %d points.\n",fTRD->RecPoints()->GetEntries());
333 printf("AliTRDclusterizerV0::MakeCluster -- ");
334 printf("Fill the cluster tree.\n");