StRoot  1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Member Functions | List of all members
StFgtSimpleClusterAlgo Class Reference

#include <StFgtSimpleClusterAlgo.h>

Inheritance diagram for StFgtSimpleClusterAlgo:

Public Member Functions

virtual Int_t doClustering (const StFgtCollection &fgtCollection, StFgtStripCollection &strips, StFgtHitCollection &clusters)
 the main function, using a collection of strips tht fired to build clusters of neighbouring strips More...
virtual Int_t Init ()
- Public Member Functions inherited from StFgtIClusterAlgo
virtual Int_t Finish ()=0
virtual void setDb (StFgtDb *pDb)=0

Detailed Description

This class implements the IClusterAlgo interface, in particular the doClustering function. The implemented algo (simple) agregates all strips that are above threshold to clusters. It respects the fact that at the inner radius only every second P-Strip exist. There is a cutoff on the maximum numbers of strips per cluster as a safety in case of noisy data.

Copy constructor and assignment operator omitted deliberately

Anselm Vossen (avoss.nosp@m.en@i.nosp@m.ndian.nosp@m.a.ed.nosp@m.u)

Simple Point making algorithm taking the clusters from the StFgtEvent and adding points. It considers all combinations of r-phi clusters in a quadrant up to a maximum of 40. It combines all clusters to a point with a charge asymmetry smaller than what the user has set. Default allowed charge asymmetry is 0.1

Definition at line 44 of file StFgtSimpleClusterAlgo.h.

Member Function Documentation

Int_t StFgtSimpleClusterAlgo::doClustering ( const StFgtCollection fgtCollection,
StFgtStripCollection strips,
StFgtHitCollection clusters 

the main function, using a collection of strips tht fired to build clusters of neighbouring strips

The simple cluster algorithm. It used the fact that neighbouring strips have neighbouring geoIds. The hits are sorted according to the geoId and the list of hits is then checked for geoIds that are next to each other. If there is a hit in the R layer that is in the inner half of the detector, it is allowed in the phi to skip a geoId. The error on the cluster charge is computed from the errors on the strip charges and the error on the position is the stdDev of the ordinates. So no weighting by charge yet. The code gets called for each disk separately, so global coordinates have to be set later by the calling cluster maker.

Implements StFgtIClusterAlgo.

Definition at line 97 of file StFgtSimpleClusterAlgo.cxx.

References kStOk.

The documentation for this class was generated from the following files: