[u/mrichter/AliRoot.git] / STEER / AliVertexerTracks.h

#ifndef ALIVERTEXERTRACKS_H
#define ALIVERTEXERTRACKS_H
/* Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. *
 * See cxx source for full Copyright notice                               */


//-------------------------------------------------------
// Class for vertex determination with tracks
//
//   Origin: AliITSVertexerTracks  
//           A.Dainese, Padova, andrea.dainese@pd.infn.it
//           M.Masera,  Torino, massimo.masera@to.infn.it 
//   Moved to STEER and adapted to ESD tracks: 
//           F.Prino, Torino, prino@to.infn.it 
//-------------------------------------------------------

/*****************************************************************************
 *                                                                           *
 * This class determines the vertex of a set of tracks.                      *
 * Different algorithms are implemented, see data member fAlgo.              *
 *                                                                           *
 *****************************************************************************/

#include <TObjArray.h>
#include <TMatrixD.h>

#include "AliESDVertex.h"
#include "AliExternalTrackParam.h"
#include "AliLog.h"

class AliVEvent;
class AliESDEvent;
class AliStrLine;

class AliVertexerTracks : public TObject {
  
 public:
  AliVertexerTracks(); 
  AliVertexerTracks(Double_t fieldkG); 
  virtual ~AliVertexerTracks();

  AliESDVertex* FindPrimaryVertex(AliVEvent *vEvent);
  AliESDVertex* FindPrimaryVertex(TObjArray *trkArrayOrig,UShort_t *idOrig);
  AliESDVertex* VertexForSelectedTracks(TObjArray *trkArray,UShort_t *id,
					Bool_t optUseFitter=kTRUE,
					Bool_t optPropagate=kTRUE);
  AliESDVertex* VertexForSelectedESDTracks(TObjArray *trkArray,
					Bool_t optUseFitter=kTRUE,
					Bool_t optPropagate=kTRUE);
  AliESDVertex* RemoveTracksFromVertex(AliESDVertex *inVtx,
				       TObjArray *trkArray,UShort_t *id,
				       Float_t *diamondxy); 
  void  SetITSMode(Double_t dcacut=0.1,
		   Double_t dcacutIter0=0.1,
		   Double_t maxd0z0=0.5,
		   Int_t minCls=5,
		   Int_t mintrks=1,
		   Double_t nsigma=3.,
		   Double_t mindetfitter=100.,
		   Double_t maxtgl=1000.,
		   Double_t fidR=3.,
		   Double_t fidZ=30.,
		   Int_t finderAlgo=1,
		   Int_t finderAlgoIter0=4); 
  void  SetTPCMode(Double_t dcacut=0.1,
		   Double_t dcacutIter0=1.0,
		   Double_t maxd0z0=5.0,
		   Int_t minCls=10,
		   Int_t mintrks=1,
		   Double_t nsigma=3.,
		   Double_t mindetfitter=0.1,
		   Double_t maxtgl=1.5, 
		   Double_t fidR=3.,
		   Double_t fidZ=30.,
		   Int_t finderAlgo=1,
		   Int_t finderAlgoIter0=4); 
  void  SetCuts(Double_t *cuts);
  void  SetConstraintOff() { fConstraint=kFALSE; return; }
  void  SetConstraintOn() { fConstraint=kTRUE; return; }
  void  SetDCAcut(Double_t maxdca) { fDCAcut=maxdca; return; }
  void  SetDCAcutIter0(Double_t maxdca) { fDCAcutIter0=maxdca; return; }
  void  SetFinderAlgorithm(Int_t opt=1) { fAlgo=opt; return; }
  void  SetITSrefitRequired() { fITSrefit=kTRUE; return; }
  Bool_t GetITSrefitRequired() const { return fITSrefit; }
  void  SetITSrefitNotRequired() { fITSrefit=kFALSE; return; }
  void  SetFiducialRZ(Double_t r=3,Double_t z=30) { fFiducialR=r; fFiducialZ=z; return; }
  void  SetMaxd0z0(Double_t maxd0z0=0.5) { fMaxd0z0=maxd0z0; return; }
  void  SetMinClusters(Int_t n=5) { fMinClusters=n; return; }
  Int_t GetMinClusters() const { return fMinClusters; }
  void  SetMinTracks(Int_t n=1) { fMinTracks=n; return; }
  void  SetNSigmad0(Double_t n=3) { fNSigma=n; return; }
  Double_t GetNSigmad0() const { return fNSigma; }
  void  SetMinDetFitter(Double_t mindet=100.) { fMinDetFitter=mindet; return; }
  void  SetMaxTgl(Double_t maxtgl=1.) { fMaxTgl=maxtgl; return; }
  void  SetOnlyFitter() { if(!fConstraint) AliFatal("Set constraint first!"); 
     fOnlyFitter=kTRUE; return; }
  void  SetSkipTracks(Int_t n,Int_t *skipped);
  void  SetVtxStart(Double_t x=0,Double_t y=0,Double_t z=0) 
    { fNominalPos[0]=x; fNominalPos[1]=y; fNominalPos[2]=z; return; }
  void  SetVtxStartSigma(Double_t sx=3.,Double_t sy=3.,Double_t sz=15.) 
    { fNominalCov[0]=sx*sx; fNominalCov[2]=sy*sy; fNominalCov[5]=sz*sz;
      fNominalCov[1]=0.; fNominalCov[3]=0.; fNominalCov[4]=0.; return; }
  void  SetVtxStart(AliESDVertex *vtx);
  static Double_t GetStrLinMinDist(Double_t *p0,Double_t *p1,Double_t *x0);
  static Double_t GetDeterminant3X3(Double_t matr[][3]);
  static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t (*m)[3],Double_t *d);
  static void GetStrLinDerivMatrix(Double_t *p0,Double_t *p1,Double_t *sigmasq,Double_t (*m)[3],Double_t *d);
  static AliESDVertex TrackletVertexFinder(TClonesArray *lines, Int_t optUseWeights=0);
  static AliESDVertex TrackletVertexFinder(AliStrLine **lines, const Int_t knacc, Int_t optUseWeights=0);
  void     SetFieldkG(Double_t field=-999.) { fFieldkG=field; return; }
  Double_t GetFieldkG() const { 
    if(fFieldkG<-99.) AliFatal("Field value not set");
    return fFieldkG; } 
  void SetNSigmaForUi00(Double_t n=1.5) { fnSigmaForUi00=n; return; }
  Double_t GetNSigmaForUi00() const { return fnSigmaForUi00; }

 protected:
  void     HelixVertexFinder();
  void     OneTrackVertFinder();
  Int_t    PrepareTracks(TObjArray &trkArrayOrig,UShort_t *idOrig,
			 Int_t optImpParCut);
  Bool_t   PropagateTrackTo(AliExternalTrackParam *track,
			    Double_t xToGo);
  Bool_t   TrackToPoint(AliExternalTrackParam *t,
		        TMatrixD &ri,TMatrixD &wWi,
			Bool_t uUi3by3=kFALSE) const;     
  void     VertexFinder(Int_t optUseWeights=0);
  void     VertexFitter();
  void     StrLinVertexFinderMinDist(Int_t optUseWeights=0);
  void     TooFewTracks();

  AliESDVertex fVert;         // vertex after vertex finder
  AliESDVertex *fCurrentVertex;  // ESD vertex after fitter
  UShort_t  fMode;            // 0 ITS+TPC; 1 TPC
  Double_t  fFieldkG;         // z component of field (kGauss) 
  Double_t  fNominalPos[3];   // initial knowledge on vertex position
  Double_t  fNominalCov[6];   // initial knowledge on vertex position
  TObjArray fTrkArraySel;     // array with tracks to be processed
  UShort_t  *fIdSel;          // IDs of the tracks (AliESDtrack::GetID())
  Int_t     *fTrksToSkip;     // track IDs to be skipped for find and fit 
  Int_t     fNTrksToSkip;     // number of tracks to be skipped 
  Bool_t    fConstraint;      // true when "mean vertex" was set in 
                              // fNominal ... and must be used in the fit
  Bool_t    fOnlyFitter;      // primary with one fitter shot only
                              // (use only with beam constraint)
  Int_t     fMinTracks;       // minimum number of tracks
  Int_t     fMinClusters;     // minimum number of ITS or TPC clusters per track
  Double_t  fDCAcut;          // maximum DCA between 2 tracks used for vertex
  Double_t  fDCAcutIter0;     // maximum DCA between 2 tracks used for vertex
  Double_t  fNSigma;          // number of sigmas for d0 cut in PrepareTracks()
  Double_t  fMaxd0z0;         // value for sqrt(d0d0+z0z0) cut 
                              // in PrepareTracks(1) if fConstraint=kFALSE
  Double_t  fMinDetFitter;    // minimum determinant to try to invertex matrix
  Double_t  fMaxTgl;          // maximum tgl of tracks
  Bool_t    fITSrefit;        // if kTRUE (default), use only kITSrefit tracks
                              // if kFALSE, use all tracks (also TPC only)
  Double_t  fFiducialR;       // radius of fiducial cylinder for tracks 
  Double_t  fFiducialZ;       // length of fiducial cylinder for tracks
  Double_t  fnSigmaForUi00;   // n. sigmas from finder in TrackToPoint
  Int_t     fAlgo;            // option for vertex finding algorythm
  Int_t     fAlgoIter0;       // this is for iteration 0
  // fAlgo=1 (default) finds minimum-distance point among all selected tracks
  //         approximated as straight lines 
  //         and uses errors on track parameters as weights
  // fAlgo=2 finds minimum-distance point among all the selected tracks
  //         approximated as straight lines 
  // fAlgo=3 finds the average point among DCA points of all pairs of tracks
  //         treated as helices
  // fAlgo=4 finds the average point among DCA points of all pairs of tracks
  //         approximated as straight lines 
  //         and uses errors on track parameters as weights
  // fAlgo=5 finds the average point among DCA points of all pairs of tracks
  //         approximated as straight lines 


 private:
  AliVertexerTracks(const AliVertexerTracks & source);
  AliVertexerTracks & operator=(const AliVertexerTracks & source);

  ClassDef(AliVertexerTracks,12) // 3D Vertexing with tracks 
};

#endif
Commit	Line	Data
2d57349e	1	#ifndef ALIVERTEXERTRACKS_H
	2	#define ALIVERTEXERTRACKS_H
	3	/* Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. *
	4	* See cxx source for full Copyright notice */
	5
	6
	7	//-------------------------------------------------------
6d8df534	8	// Class for vertex determination with tracks
2d57349e	9	//
	10	// Origin: AliITSVertexerTracks
	11	// A.Dainese, Padova, andrea.dainese@pd.infn.it
	12	// M.Masera, Torino, massimo.masera@to.infn.it
	13	// Moved to STEER and adapted to ESD tracks:
	14	// F.Prino, Torino, prino@to.infn.it
	15	//-------------------------------------------------------
	16
	17	/*****************************************************************************
	18	* *
6d8df534	19	* This class determines the vertex of a set of tracks. *
2d57349e	20	* Different algorithms are implemented, see data member fAlgo. *
	21	* *
	22	*****************************************************************************/
	23
2d57349e	24	#include <TObjArray.h>
fee9ef0d	25	#include <TMatrixD.h>
2d57349e	26
6d8df534	27	#include "AliESDVertex.h"
	28	#include "AliExternalTrackParam.h"
	29	#include "AliLog.h"
	30
0aa2faf4	31	class AliVEvent;
af885e0f	32	class AliESDEvent;
8e104736	33	class AliStrLine;
2d57349e	34
	35	class AliVertexerTracks : public TObject {
	36
	37	public:
	38	AliVertexerTracks();
dc3719f3	39	AliVertexerTracks(Double_t fieldkG);
2d57349e	40	virtual ~AliVertexerTracks();
2d57349e	41
4448efe4	42	AliESDVertex* FindPrimaryVertex(AliVEvent *vEvent);
6d8df534	43	AliESDVertex* FindPrimaryVertex(TObjArray trkArrayOrig,UShort_t idOrig);
	44	AliESDVertex* VertexForSelectedTracks(TObjArray trkArray,UShort_t id,
	45	Bool_t optUseFitter=kTRUE,
	46	Bool_t optPropagate=kTRUE);
	47	AliESDVertex* VertexForSelectedESDTracks(TObjArray *trkArray,
	48	Bool_t optUseFitter=kTRUE,
	49	Bool_t optPropagate=kTRUE);
	50	AliESDVertex* RemoveTracksFromVertex(AliESDVertex *inVtx,
	51	TObjArray trkArray,UShort_t id,
	52	Float_t *diamondxy);
a00021a7	53	void SetITSMode(Double_t dcacut=0.1,
	54	Double_t dcacutIter0=0.1,
	55	Double_t maxd0z0=0.5,
	56	Int_t minCls=5,
	57	Int_t mintrks=1,
	58	Double_t nsigma=3.,
	59	Double_t mindetfitter=100.,
	60	Double_t maxtgl=1000.,
	61	Double_t fidR=3.,
8c75f668	62	Double_t fidZ=30.,
	63	Int_t finderAlgo=1,
	64	Int_t finderAlgoIter0=4);
a00021a7	65	void SetTPCMode(Double_t dcacut=0.1,
	66	Double_t dcacutIter0=1.0,
	67	Double_t maxd0z0=5.0,
	68	Int_t minCls=10,
	69	Int_t mintrks=1,
	70	Double_t nsigma=3.,
	71	Double_t mindetfitter=0.1,
	72	Double_t maxtgl=1.5,
	73	Double_t fidR=3.,
8c75f668	74	Double_t fidZ=30.,
	75	Int_t finderAlgo=1,
	76	Int_t finderAlgoIter0=4);
a00021a7	77	void SetCuts(Double_t *cuts);
fee9ef0d	78	void SetConstraintOff() { fConstraint=kFALSE; return; }
fee9ef0d	79	void SetConstraintOn() { fConstraint=kTRUE; return; }
fee9ef0d	80	void SetDCAcut(Double_t maxdca) { fDCAcut=maxdca; return; }
f09c879d	81	void SetDCAcutIter0(Double_t maxdca) { fDCAcutIter0=maxdca; return; }
fee9ef0d	82	void SetFinderAlgorithm(Int_t opt=1) { fAlgo=opt; return; }
6d8df534	83	void SetITSrefitRequired() { fITSrefit=kTRUE; return; }
0aa2faf4	84	Bool_t GetITSrefitRequired() const { return fITSrefit; }
50ff0bcd	85	void SetITSrefitNotRequired() { fITSrefit=kFALSE; return; }
6b29d399	86	void SetFiducialRZ(Double_t r=3,Double_t z=30) { fFiducialR=r; fFiducialZ=z; return; }
fee9ef0d	87	void SetMaxd0z0(Double_t maxd0z0=0.5) { fMaxd0z0=maxd0z0; return; }
6b29d399	88	void SetMinClusters(Int_t n=5) { fMinClusters=n; return; }
0aa2faf4	89	Int_t GetMinClusters() const { return fMinClusters; }
6d8df534	90	void SetMinTracks(Int_t n=1) { fMinTracks=n; return; }
fee9ef0d	91	void SetNSigmad0(Double_t n=3) { fNSigma=n; return; }
fee9ef0d	92	Double_t GetNSigmad0() const { return fNSigma; }
f09c879d	93	void SetMinDetFitter(Double_t mindet=100.) { fMinDetFitter=mindet; return; }
f09c879d	94	void SetMaxTgl(Double_t maxtgl=1.) { fMaxTgl=maxtgl; return; }
fee9ef0d	95	void SetOnlyFitter() { if(!fConstraint) AliFatal("Set constraint first!");
fee9ef0d	96	fOnlyFitter=kTRUE; return; }
ec1be5d5	97	void SetSkipTracks(Int_t n,Int_t *skipped);
3b768a1d	98	void SetVtxStart(Double_t x=0,Double_t y=0,Double_t z=0)
07680cae	99	{ fNominalPos[0]=x; fNominalPos[1]=y; fNominalPos[2]=z; return; }
146c29df	100	void SetVtxStartSigma(Double_t sx=3.,Double_t sy=3.,Double_t sz=15.)
50ff0bcd	101	{ fNominalCov[0]=sxsx; fNominalCov[2]=sysy; fNominalCov[5]=sz*sz;
	102	fNominalCov[1]=0.; fNominalCov[3]=0.; fNominalCov[4]=0.; return; }
	103	void SetVtxStart(AliESDVertex *vtx);
71d84967	104	static Double_t GetStrLinMinDist(Double_t p0,Double_t p1,Double_t *x0);
	105	static Double_t GetDeterminant3X3(Double_t matr[][3]);
	106	static void GetStrLinDerivMatrix(Double_t p0,Double_t p1,Double_t (m)[3],Double_t d);
	107	static void GetStrLinDerivMatrix(Double_t p0,Double_t p1,Double_t sigmasq,Double_t (m)[3],Double_t *d);
146c29df	108	static AliESDVertex TrackletVertexFinder(TClonesArray *lines, Int_t optUseWeights=0);
8e104736	109	static AliESDVertex TrackletVertexFinder(AliStrLine **lines, const Int_t knacc, Int_t optUseWeights=0);
dc3719f3	110	void SetFieldkG(Double_t field=-999.) { fFieldkG=field; return; }
	111	Double_t GetFieldkG() const {
	112	if(fFieldkG<-99.) AliFatal("Field value not set");
	113	return fFieldkG; }
3b768a1d	114	void SetNSigmaForUi00(Double_t n=1.5) { fnSigmaForUi00=n; return; }
3b768a1d	115	Double_t GetNSigmaForUi00() const { return fnSigmaForUi00; }
07680cae	116
2d57349e	117	protected:
fee9ef0d	118	void HelixVertexFinder();
0c69be49	119	void OneTrackVertFinder();
6d8df534	120	Int_t PrepareTracks(TObjArray &trkArrayOrig,UShort_t *idOrig,
6d8df534	121	Int_t optImpParCut);
f09c879d	122	Bool_t PropagateTrackTo(AliExternalTrackParam *track,
f09c879d	123	Double_t xToGo);
6d8df534	124	Bool_t TrackToPoint(AliExternalTrackParam *t,
0bf2e2b4	125	TMatrixD &ri,TMatrixD &wWi,
0bf2e2b4	126	Bool_t uUi3by3=kFALSE) const;
2d57349e	127	void VertexFinder(Int_t optUseWeights=0);
6d8df534	128	void VertexFitter();
fee9ef0d	129	void StrLinVertexFinderMinDist(Int_t optUseWeights=0);
6d8df534	130	void TooFewTracks();
eae1677e	131
146c29df	132	AliESDVertex fVert; // vertex after vertex finder
ec1be5d5	133	AliESDVertex *fCurrentVertex; // ESD vertex after fitter
f09c879d	134	UShort_t fMode; // 0 ITS+TPC; 1 TPC
dc3719f3	135	Double_t fFieldkG; // z component of field (kGauss)
07680cae	136	Double_t fNominalPos[3]; // initial knowledge on vertex position
50ff0bcd	137	Double_t fNominalCov[6]; // initial knowledge on vertex position
f09c879d	138	TObjArray fTrkArraySel; // array with tracks to be processed
	139	UShort_t *fIdSel; // IDs of the tracks (AliESDtrack::GetID())
	140	Int_t *fTrksToSkip; // track IDs to be skipped for find and fit
	141	Int_t fNTrksToSkip; // number of tracks to be skipped
fee9ef0d	142	Bool_t fConstraint; // true when "mean vertex" was set in
	143	// fNominal ... and must be used in the fit
	144	Bool_t fOnlyFitter; // primary with one fitter shot only
	145	// (use only with beam constraint)
2d57349e	146	Int_t fMinTracks; // minimum number of tracks
6b29d399	147	Int_t fMinClusters; // minimum number of ITS or TPC clusters per track
2d57349e	148	Double_t fDCAcut; // maximum DCA between 2 tracks used for vertex
f09c879d	149	Double_t fDCAcutIter0; // maximum DCA between 2 tracks used for vertex
07680cae	150	Double_t fNSigma; // number of sigmas for d0 cut in PrepareTracks()
43c9dae1	151	Double_t fMaxd0z0; // value for sqrt(d0d0+z0z0) cut
fee9ef0d	152	// in PrepareTracks(1) if fConstraint=kFALSE
f09c879d	153	Double_t fMinDetFitter; // minimum determinant to try to invertex matrix
f09c879d	154	Double_t fMaxTgl; // maximum tgl of tracks
50ff0bcd	155	Bool_t fITSrefit; // if kTRUE (default), use only kITSrefit tracks
50ff0bcd	156	// if kFALSE, use all tracks (also TPC only)
6b29d399	157	Double_t fFiducialR; // radius of fiducial cylinder for tracks
6b29d399	158	Double_t fFiducialZ; // length of fiducial cylinder for tracks
3b768a1d	159	Double_t fnSigmaForUi00; // n. sigmas from finder in TrackToPoint
f09c879d	160	Int_t fAlgo; // option for vertex finding algorythm
8c75f668	161	Int_t fAlgoIter0; // this is for iteration 0
2d57349e	162	// fAlgo=1 (default) finds minimum-distance point among all selected tracks
	163	// approximated as straight lines
	164	// and uses errors on track parameters as weights
	165	// fAlgo=2 finds minimum-distance point among all the selected tracks
	166	// approximated as straight lines
	167	// fAlgo=3 finds the average point among DCA points of all pairs of tracks
	168	// treated as helices
	169	// fAlgo=4 finds the average point among DCA points of all pairs of tracks
	170	// approximated as straight lines
	171	// and uses errors on track parameters as weights
	172	// fAlgo=5 finds the average point among DCA points of all pairs of tracks
	173	// approximated as straight lines
	174
3b768a1d	175
fe12e09c	176	private:
	177	AliVertexerTracks(const AliVertexerTracks & source);
	178	AliVertexerTracks & operator=(const AliVertexerTracks & source);
2d57349e	179
919e537f	180	ClassDef(AliVertexerTracks,12) // 3D Vertexing with tracks
2d57349e	181	};
	182
	183	#endif
43c9dae1	184