[u/mrichter/AliRoot.git] / JETAN / AliDAJetFinder.cxx


//  **************************************************************************
//  * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
//  *                                                                        *
//  * Author: The ALICE Off-line Project.                                    *
//  * Contributors are mentioned in the code where appropriate.              *
//  *                                                                        *
//  * Permission to use, copy, modify and distribute this software and its   *
//  * documentation strictly for non-commercial purposes is hereby granted   *
//  * without fee, provided that the above copyright notice appears in all   *
//  * copies and that both the copyright notice and this permission notice   *
//  * appear in the supporting documentation. The authors make no claims     *
//  * about the suitability of this software for any purpose. It is          *
//  * provided "as is" without express or implied warranty.                  *
//  **************************************************************************

//-----------------------------------------------------------------------------------
// Jet finder based on Deterministic Annealing
// For further informations about the DA working features see:
// Phys.Lett. B601 (2004) 56-63 (http://arxiv.org/abs/hep-ph/0407214)
// Author: Davide Perrino (davide.perrino@ba.infn.it, davide.perrino@cern.ch)
//-----------------------------------------------------------------------------------

#include <TMath.h>
#include <TRandom.h>
#include <TClonesArray.h>
#include "AliJetReaderHeader.h"
#include "AliJetReader.h"
#include "AliDAJetHeader.h"
#include "AliDAJetFinder.h"

ClassImp(AliDAJetFinder)


//-----------------------------------------------------------------------------------
AliDAJetFinder::AliDAJetFinder():
	AliJetFinder(),
	fAlpha(1.01),
	fDelta(1e-8),
	fAvDist(1e-6),
	fEps(1e-4),
	fEpsMax(1e-2),
	fNloopMax(100),
	fBeta(0.1),
	fNclustMax(0),
	fNin(0)
{
	// Constructor
}

//-----------------------------------------------------------------------------------
AliDAJetFinder::~AliDAJetFinder()
{
	// Destructor
}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::FindJets()  
{
// Find the jets in current event
// 
	Float_t betaStop=100.;
    fDebug = fHeader->GetDebug();

	Double_t dEtSum=0;
	Double_t *xData[2];
    TVectorD *vPx = new TVectorD();
    TVectorD *vPy = new TVectorD();
    TMatrixD *mPyx= new TMatrixD();
    TMatrixD *mY  = new TMatrixD();
	InitDetAnn(dEtSum,xData,vPx,vPy,mPyx,mY);
	if (fNin < fNclustMax) return;

	Int_t nc=1, nk;
	DoubleClusters(nc,nk,vPy,mY);
	do{					//loop over beta
		fBeta*=fAlpha;
		Annealing(nk,xData,vPx,vPy,mPyx,mY);
		NumCl(nc,nk,vPy,mPyx,mY);
	}while((fBeta<betaStop || nc<4) && nc<fNclustMax);

	Int_t *xx=new Int_t[fNin];
	EndDetAnn(nk,xData,xx,dEtSum,vPx,vPy,mPyx,mY);
	StoreJets(nk,xData,xx,mY);
	delete [] xx;

	delete [] xData[0], delete [] xData[1];
	delete mPyx;
	delete mY;
	delete vPx;
	delete vPy;

}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::InitDetAnn(Double_t &dEtSum,Double_t **xData,TVectorD *vPx,TVectorD *vPy,TMatrixD *mPyx,TMatrixD *mY)
{
//Initialise the variables used by the algorithm
	fBeta=0.1;
	fNclustMax= ((AliDAJetHeader*)fHeader)->GetFixedCl() ? 
	    ((AliDAJetHeader*)fHeader)->GetNclustMax() : 
	    TMath::Max((Int_t)TMath::Sqrt(fNin),5);
	TClonesArray *lvArray = fReader->GetMomentumArray();
	Int_t nEntr = lvArray->GetEntries();
	fNin=0;
	for (Int_t iEn=0; iEn<nEntr; iEn++) if (fReader->GetCutFlag(iEn)==1) fNin++;
	Double_t *xEta = new Double_t[fNin];
	Double_t *xPhi = new Double_t[fNin];
	xData[0]=xEta; xData[1]=xPhi;
	vPx->ResizeTo(fNin);
	Int_t iIn=0;
	for (Int_t iEn=0; iEn<nEntr; iEn++){
		if (fReader->GetCutFlag(iEn)==0) continue;
		TLorentzVector *lv=(TLorentzVector*)lvArray->At(iEn);
		xEta[iIn] = lv->Eta();
		xPhi[iIn] = lv->Phi()<0 ? lv->Phi() + 2*TMath::Pi() : lv->Phi();
		(*vPx)(iIn)=lv->Pt();
		dEtSum+=(*vPx)(iIn);
		iIn++;
	}
	for (iIn=0; iIn<fNin; iIn++) (*vPx)(iIn)=(*vPx)(iIn)/dEtSum;

	Int_t njdim=2*fNclustMax+1;
	mPyx->ResizeTo(fNin,njdim);
	mY->ResizeTo(4,njdim);
	vPy->ResizeTo(njdim);
	mY->Zero();mPyx->Zero();vPy->Zero();
	(*vPy)(0)=1;
	TMatrixDColumn(*mPyx,0)=1;
	Double_t ypos=0,xpos=0;
	for (iIn=0; iIn<fNin; iIn++){
		(*mY)(0,0)+=(*vPx)(iIn)*xEta[iIn];
		ypos+=(*vPx)(iIn)*TMath::Sin(xPhi[iIn]);
		xpos+=(*vPx)(iIn)*TMath::Cos(xPhi[iIn]);
	}
	(*mY)(1,0)=(atan2(ypos,xpos)>0) ? atan2(ypos,xpos) : atan2(ypos,xpos)+2*TMath::Pi();
}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::DoubleClusters(Int_t nc,Int_t &nk,  TVectorD *vPy,  TMatrixD *mY) const
{
	for(Int_t iClust=0; iClust<nc; iClust++){
		(*vPy)(iClust)=(*vPy)(iClust)/2;
		(*vPy)(nc+iClust)=(*vPy)(iClust);
		for(Int_t iComp=0; iComp<3; iComp++) (*mY)(iComp,nc+iClust)=(*mY)(iComp,iClust);
	}
	nk=2*nc;
}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::Annealing(Int_t nk,Double_t **xData,  TVectorD *vPx,  TVectorD *vPy,  TMatrixD *mPyx,  TMatrixD *mY)
{
// Main part of the algorithm
	const Double_t pi=TMath::Pi();
	TVectorD *py = new TVectorD(nk);
	TVectorD *p  = new TVectorD(nk);
	TMatrixD *y  = new TMatrixD(4,nk);
	TMatrixD *y1 = new TMatrixD(4,nk);
	TMatrixD *ry = new TMatrixD(2,nk);
    Double_t *xEta = xData[0];
    Double_t *xPhi = xData[1];
	Double_t Dist(TVectorD,TVectorD);

	Double_t df[2]={fReader->GetReaderHeader()->GetFiducialEtaMax(),pi};
	TVectorD vPart(2);
	Double_t *m = new Double_t[nk];
	Double_t chi,chi1;
	do{
		Int_t nloop=0;
		for (Int_t iClust=0; iClust<nk; iClust++){
			for (Int_t i=0; i<3; i++)(*y1)(i,iClust)=(*mY)(i,iClust);
			(*py)(iClust)=(*vPy)(iClust);
		}
	//perturbation of codevectors
		Double_t seed=1000000*gRandom->Rndm(24);
		ry->Randomize(-0.5,0.5,seed);
		for (Int_t i=0; i<2; i++){
			for (Int_t iClust=0; iClust<nk/2; iClust++)
				(*y1)(i,iClust)+=((*ry)(i,iClust)+TMath::Sign(0.5,(*ry)(i,iClust)))*fDelta*df[i];
			for (Int_t iClust=nk/2; iClust<nk; iClust++)
				(*y1)(i,iClust)-=((*ry)(i,iClust-nk/2)+TMath::Sign(0.5,(*ry)(i,iClust-nk/2)))*fDelta*df[i];
		}
		do{
	//recalculate conditional probabilities
			nloop++;
			for (Int_t iIn=0; iIn<fNin; iIn++){
				vPart(0)=xEta[iIn]; vPart(1)=xPhi[iIn];
				for(Int_t iClust=0; iClust<nk; iClust++){
					(*mPyx)(iIn,iClust)=-log((*py)(iClust))+fBeta*Dist(vPart,TMatrixDColumn(*y1,iClust));
					m[iClust]=(*mPyx)(iIn,iClust);
				}
				Double_t pyxNorm=0;
				Double_t minPyx=TMath::MinElement(nk,m);
				for (Int_t iClust=0; iClust<nk; iClust++){
					(*mPyx)(iIn,iClust)-=minPyx;
					(*mPyx)(iIn,iClust)=exp(-(*mPyx)(iIn,iClust));
					pyxNorm+=(*mPyx)(iIn,iClust);
				}
				for (Int_t iClust=0; iClust<nk; iClust++) (*mPyx)(iIn,iClust)/=pyxNorm;
			}
			p->Zero();
			y->Zero();
	//recalculate codevectors
			for (Int_t iClust=0; iClust<nk; iClust++){
				Double_t xpos=0,ypos=0,pxy;
				for (Int_t iIn=0; iIn<fNin; iIn++) (*p)(iClust)+=(*vPx)(iIn)*(*mPyx)(iIn,iClust);
				for (Int_t iIn=0; iIn<fNin; iIn++){
					pxy=(*vPx)(iIn)*(*mPyx)(iIn,iClust)/(*p)(iClust);
					ypos+=pxy*TMath::Sin(xPhi[iIn]);
					xpos+=pxy*TMath::Cos(xPhi[iIn]);
					(*y)(0,iClust)+=pxy*xEta[iIn];
				}
				(*y)(1,iClust)=(atan2(ypos,xpos)>0) ? atan2(ypos,xpos) : atan2(ypos,xpos)+2*pi;
			}
	//verify codevectors' stability
			chi=0;
			for (Int_t iClust=0; iClust<nk; iClust++){
				chi1=TMath::CosH((*y1)(0,iClust)-(*y)(0,iClust))-TMath::Cos((*y1)(1,iClust)-(*y)(1,iClust));
				chi1/=(2*TMath::CosH((*y1)(0,iClust))*TMath::CosH((*y)(0,iClust)));
				chi1*=chi1;
				if (chi1>chi) chi=chi1;
			}
			chi=TMath::Sqrt(chi);
			for (Int_t iClust=0; iClust<nk; iClust++){
				for (Int_t i=0; i<2; i++) (*y1)(i,iClust)=(*y)(i,iClust);
				(*py)(iClust)=(*p)(iClust);
			}
			if (nloop>fNloopMax){
				if (chi<fEpsMax || nloop>500) break;
			}
		}while (chi>fEps);
	}while (chi>fEpsMax);
	for (Int_t iClust=0; iClust<nk; iClust++){				//set codevectors and probability equal to those calculated
		for (Int_t i=0; i<2; i++) (*mY)(i,iClust)=(*y)(i,iClust);
		(*vPy)(iClust)=(*p)(iClust);
	}
    delete py;
    delete p;
    delete y;
    delete y1;
    delete ry;
    delete [] m;
}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::NumCl(Int_t &nc,Int_t &nk,TVectorD *vPy,  TMatrixD *mPyx,TMatrixD *mY)
{
	static Bool_t growcl=true;
	
	if (nk==2) growcl=true;
	if (growcl){
//verify if two codevectors are equal within fAvDist
		Int_t *nSame = new Int_t[nk];
		Int_t **iSame = new Int_t*[nk];
		Int_t **cont = new Int_t*[nk];
		for (Int_t iClust=0; iClust<nk; iClust++) cont[iClust]=new Int_t[nk],iSame[iClust]=new Int_t[nk];
		for (Int_t iClust=0; iClust<nk; iClust++){
			iSame[iClust][iClust]=1;
			for (Int_t iClust1=iClust+1; iClust1<nk; iClust1++){
				Double_t eta  = (*mY)(0,iClust) ; Double_t phi  = (*mY)(1,iClust);
				Double_t eta1 = (*mY)(0,iClust1); Double_t phi1 = (*mY)(1,iClust1);
				Double_t distCl=(TMath::CosH(eta-eta1)-TMath::Cos(phi-phi1))/(2*TMath::CosH(eta)*TMath::CosH(eta1));
				if (distCl < fAvDist) iSame[iClust][iClust1]=iSame[iClust1][iClust]=1;
				else iSame[iClust][iClust1]=iSame[iClust1][iClust]=0;
			}
		}
		ReduceClusters(iSame,nk,nc,cont,nSame);
		if (nc >= fNclustMax) growcl=false;
//recalculate the nc distinct codevectors
		TMatrixD *pyx = new TMatrixD(fNin,2*nc);
		TVectorD *py = new TVectorD(nk);
		TMatrixD *y1  = new TMatrixD(3,nk);
		for (Int_t iClust=0; iClust<nc; iClust++){
			for(Int_t j=0; j<nSame[iClust]; j++){
				Int_t iClust1 = cont[iClust][j];
				for (Int_t iIn=0; iIn<fNin; iIn++) (*pyx)(iIn,iClust)+=(*mPyx)(iIn,iClust1);
				(*py)(iClust)+=(*vPy)(iClust1);
				for (Int_t i=0; i<2; i++) (*y1)(i,iClust)+=(*mY)(i,iClust1);
			}
			for (Int_t i=0; i<2; i++) (*y1)(i,iClust)/=nSame[iClust];
		}
		for (Int_t iClust=0; iClust<nk; iClust++) delete [] cont[iClust], delete [] iSame[iClust];
		delete [] iSame;
		delete [] cont;
		delete [] nSame;
		if (nc > nk/2){
			for (Int_t iClust=0; iClust<nc; iClust++){
				for (Int_t iIn=0; iIn<fNin; iIn++) (*mPyx)(iIn,iClust)=(*pyx)(iIn,iClust);
				for (Int_t iComp=0; iComp<2; iComp++) (*mY)(iComp,iClust)=(*y1)(iComp,iClust);
				(*vPy)(iClust)=(*py)(iClust);
			}
			nk=nc;
			if (growcl) DoubleClusters(nc,nk,vPy,mY);
		}
		delete pyx;
		delete py;
		delete y1;
	}

}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::ReduceClusters(Int_t **iSame,Int_t nc,Int_t &ncout,Int_t **cont,Int_t *nSameOut) const
{
	Int_t *nSame = new Int_t[nc];
	Int_t *iperm = new Int_t[nc];
	Int_t *go = new Int_t[nc];
	for (Int_t iCl=0; iCl<nc; iCl++){
		nSame[iCl]=0;
		for (Int_t jCl=0; jCl<nc; jCl++) nSame[iCl]+=iSame[iCl][jCl], cont[iCl][jCl]=0;
		iperm[iCl]=iCl;
		go[iCl]=1;
	}
	TMath::Sort(nc,nSame,iperm,true);
	Int_t l=0;
	for (Int_t iCl=0; iCl<nc; iCl++){
		Int_t k=iperm[iCl];
		if (go[k] == 1){
			Int_t m=0;
			for (Int_t jCl=0; jCl<nc; jCl++){
				if (iSame[k][jCl] == 1){
					cont[l][m]=jCl;
					go[jCl]=0;
					m++;
				}
			}
			nSameOut[l]=m;
			l++;
		}
	}
	ncout=l;
	delete [] nSame;
	delete [] iperm;
	delete [] go;
}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::EndDetAnn(Int_t &nk,Double_t **xData,Int_t *xx,Double_t etx,
                               TVectorD *vPx,TVectorD *vPy,TMatrixD *mPyx,TMatrixD *mY)
{
//now assign each particle to only one cluster
	Double_t *clusters=new Double_t[nk];
	for (Int_t iIn=0; iIn<fNin; iIn++){
		for (Int_t iClust=0; iClust<nk; iClust++) clusters[iClust]=(*mPyx)(iIn,iClust);
		xx[iIn]=TMath::LocMax(nk,clusters);
	}
    delete [] clusters;
	
//recalculate codevectors, having all p(y|x)=0 or 1
    Double_t *xEta = xData[0];
    Double_t *xPhi = xData[1];
	mY->Zero();
	mPyx->Zero();
	vPy->Zero();
	for (Int_t iIn=0; iIn<fNin; iIn++){
		Int_t iClust=xx[iIn];
		(*mPyx)(iIn,iClust)=1;
		(*vPy)(iClust)+=(*vPx)(iIn);
		(*mY)(0,iClust)+=(*vPx)(iIn)*xEta[iIn];
		(*mY)(3,iClust)+=(*vPx)(iIn)*etx;
	}
	Int_t k=0;
	for (Int_t iClust=0; iClust<nk; iClust++){
		if ((*vPy)(iClust)>0){
			Double_t xpos=0,ypos=0,pxy;
			for (Int_t iIn=0; iIn<fNin; iIn++){
				pxy=(*vPx)(iIn)*(*mPyx)(iIn,iClust)/(*vPy)(iClust);
				ypos+=pxy*TMath::Sin(xPhi[iIn]);
				xpos+=pxy*TMath::Cos(xPhi[iIn]);
				if (xx[iIn]==iClust) xx[iIn]=k;
			}
			(*mY)(0,k)=(*mY)(0,iClust)/(*vPy)(iClust);
			(*mY)(1,k)=(atan2(ypos,xpos)>0) ? atan2(ypos,xpos) : atan2(ypos,xpos)+2*TMath::Pi();
			(*mY)(3,k)=(*mY)(3,iClust);
			k++;
		}
	}
	nk=k;
}

//-----------------------------------------------------------------------------------
void AliDAJetFinder::StoreJets(Int_t nk,Double_t **xData,  Int_t *xx,  TMatrixD *mY)
{
//evaluate significant clusters properties
	const Double_t pi=TMath::Pi();
	AliJetReaderHeader *rHeader=fReader->GetReaderHeader();
	Float_t dFiducialEta=rHeader->GetFiducialEtaMax()-rHeader->GetFiducialEtaMin();
	Double_t dMeanDist=TMath::Sqrt(2*dFiducialEta*pi/fNin);
    Double_t *xEta = xData[0];
    Double_t *xPhi = xData[1];
	Bool_t   *isJet = new Bool_t[nk];
	Double_t *etNoBg= new Double_t[nk];
	Double_t *dDeltaEta=new Double_t[nk];
	Double_t *dDeltaPhi=new Double_t[nk];
	Double_t *surf  = new Double_t[nk];
	Double_t *etDens= new Double_t[nk];
	for (Int_t iClust=0; iClust<nk; iClust++){									//clusters loop
		isJet[iClust]=false;
		Double_t dEtaMin=10.,dEtaMax=-10.,dPhiMin=10.,dPhiMax=0.;
		for (Int_t iIn=0; iIn<fNin; iIn++){
			if (xx[iIn]!=iClust) continue;
			if (xEta[iIn] < dEtaMin) dEtaMin=xEta[iIn];
			if (xEta[iIn] > dEtaMax) dEtaMax=xEta[iIn];
			Double_t dPhi=xPhi[iIn]-(*mY)(1,iClust);
			if      (dPhi > pi     ) dPhi-=2*pi;
			else if (dPhi < (-1)*pi) dPhi+=2*pi;
			if      (dPhi < dPhiMin) dPhiMin=dPhi;
			else if (dPhi > dPhiMax) dPhiMax=dPhi;
		}
		dDeltaEta[iClust]=dEtaMax-dEtaMin+dMeanDist;
		dDeltaPhi[iClust]=dPhiMax-dPhiMin+dMeanDist;
		surf[iClust]=0.25*pi*dDeltaEta[iClust]*dDeltaPhi[iClust];
		etDens[iClust]=(*mY)(3,iClust)/surf[iClust];
	}

	if (((AliDAJetHeader*)fHeader)->GetSelJets()){
		for (Int_t iClust=0; iClust<nk; iClust++){
			if (!isJet[iClust]){
				Double_t etDensMed=0.;
				Double_t etDensSqr=0.;
				Int_t norm=0;
				for (Int_t iClust1=0; iClust1<nk; iClust1++){
					if(iClust1!=iClust){
						etDensMed+=etDens[iClust1];
						etDensSqr+=TMath::Power(etDens[iClust1],2);
						norm++;
					}
				}
				etDensMed/=TMath::Max(norm,1);
				etDensSqr/=TMath::Max(norm,1);
				Double_t deltaEtDens=TMath::Sqrt(etDensSqr-TMath::Power(etDensMed,2));
				if ((*mY)(3,iClust) > (etDensMed+deltaEtDens)*surf[iClust]) isJet[iClust]=kTRUE;
				etNoBg[iClust]=(*mY)(3,iClust)-etDensMed*surf[iClust];
			}
		}
		for (Int_t iClust=0; iClust<nk; iClust++){
			if (isJet[iClust]){
				Double_t etDensMed=0;
				Double_t extSurf=2*dFiducialEta*pi;
				for (Int_t iClust1=0; iClust1<nk; iClust1++){
					if (!isJet[iClust1]) etDensMed+=(*mY)(3,iClust1);
					else extSurf-=surf[iClust1];
				}
				etDensMed/=extSurf;
				etNoBg[iClust]=(*mY)(3,iClust)-etDensMed*surf[iClust];
				if (etNoBg[iClust]<((AliDAJetHeader*)fHeader)->GetEtMin()){
					isJet[iClust]=kFALSE;
					iClust=-1;
				}
			}
		}
	} else {
		for (Int_t iClust=0; iClust<nk; iClust++) isJet[iClust]=true;
	}
	delete [] etDens;
	delete [] surf;
	
//now add selected jets to the list
	Int_t *iSort = new Int_t[nk];
    TMath::Sort(nk,etNoBg,iSort,true);
    Int_t iCl = 0;
	TRefArray *refs = 0;
	Bool_t fromAod = !strcmp(fReader->ClassName(),"AliJetAODReader");
	if (fromAod) refs = fReader->GetReferences();
	for (Int_t iClust=0; iClust<nk; iClust++){									//clusters loop
		iCl=iSort[iClust];
		if (isJet[iCl]){														//choose cluster
			Float_t px,py,pz,en;
			px = (*mY)(3,iCl)*TMath::Cos((*mY)(1,iCl));
			py = (*mY)(3,iCl)*TMath::Sin((*mY)(1,iCl));
			pz = (*mY)(3,iCl)/TMath::Tan(2.0 * TMath::ATan(TMath::Exp(-(*mY)(0,iCl))));
			en = TMath::Sqrt(px * px + py * py + pz * pz);
			AliAODJet jet(px, py, pz, en);
			if (fromAod){
				Int_t iIn=0;
				Int_t nEntr = fReader->GetMomentumArray()->GetEntries();
				for (Int_t iEn=0; iEn<nEntr; iEn++){
					if (fReader->GetCutFlag(iEn)==0) continue;
					if (xx[iIn]==iCl) jet.AddTrack(refs->At(iEn));
					iIn++;
				}
			}
			AddJet(jet);
			if (fDebug > 0) printf("jet %d, Eta: %f, Phi: %f, Et: %f\n",iCl,jet.Eta(),jet.Phi(),jet.Pt());
		}
	}
	delete [] dDeltaEta; delete [] dDeltaPhi;
	delete [] etNoBg;
	delete [] isJet;
	delete [] iSort;
}

//-----------------------------------------------------------------------------------
Double_t Dist(TVectorD x,TVectorD y)
{
// Squared distance
	const Double_t pi=TMath::Pi();
	Double_t dphi=TMath::Abs(x(1)-y(1));
	if (dphi > pi) dphi=2*pi-dphi;
	Double_t dist=pow(x(0)-y(0),2)+pow(dphi,2);
	return dist;
}
Commit	Line	Data
9e4cc50d	1
7c679be0	2	// **************************************************************************
	3	// * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
	4	// * *
	5	// * Author: The ALICE Off-line Project. *
	6	// * Contributors are mentioned in the code where appropriate. *
	7	// * *
	8	// * Permission to use, copy, modify and distribute this software and its *
	9	// * documentation strictly for non-commercial purposes is hereby granted *
	10	// * without fee, provided that the above copyright notice appears in all *
	11	// * copies and that both the copyright notice and this permission notice *
	12	// * appear in the supporting documentation. The authors make no claims *
	13	// * about the suitability of this software for any purpose. It is *
	14	// * provided "as is" without express or implied warranty. *
	15	// **************************************************************************
	16
	17	//-----------------------------------------------------------------------------------
	18	// Jet finder based on Deterministic Annealing
	19	// For further informations about the DA working features see:
	20	// Phys.Lett. B601 (2004) 56-63 (http://arxiv.org/abs/hep-ph/0407214)
	21	// Author: Davide Perrino (davide.perrino@ba.infn.it, davide.perrino@cern.ch)
	22	//-----------------------------------------------------------------------------------
	23
	24	#include <TMath.h>
	25	#include <TRandom.h>
	26	#include <TClonesArray.h>
36b5cc43	27	#include "AliJetReaderHeader.h"
7c679be0	28	#include "AliJetReader.h"
	29	#include "AliDAJetHeader.h"
	30	#include "AliDAJetFinder.h"
	31
7c679be0	32	ClassImp(AliDAJetFinder)
	33
	34
	35	//-----------------------------------------------------------------------------------
	36	AliDAJetFinder::AliDAJetFinder():
36b5cc43	37	AliJetFinder(),
7c679be0	38	fAlpha(1.01),
	39	fDelta(1e-8),
	40	fAvDist(1e-6),
	41	fEps(1e-4),
	42	fEpsMax(1e-2),
	43	fNloopMax(100),
	44	fBeta(0.1),
	45	fNclustMax(0),
9e4cc50d	46	fNin(0)
7c679be0	47	{
	48	// Constructor
	49	}
	50
	51	//-----------------------------------------------------------------------------------
	52	AliDAJetFinder::~AliDAJetFinder()
	53	{
	54	// Destructor
7c679be0	55	}
	56
	57	//-----------------------------------------------------------------------------------
	58	void AliDAJetFinder::FindJets()
	59	{
	60	// Find the jets in current event
	61	//
	62	Float_t betaStop=100.;
dd677561	63	fDebug = fHeader->GetDebug();
7c679be0	64
7c679be0	65	Double_t dEtSum=0;
36b5cc43	66	Double_t *xData[2];
	67	TVectorD *vPx = new TVectorD();
	68	TVectorD *vPy = new TVectorD();
	69	TMatrixD *mPyx= new TMatrixD();
	70	TMatrixD *mY = new TMatrixD();
	71	InitDetAnn(dEtSum,xData,vPx,vPy,mPyx,mY);
a9f9d6d5	72	if (fNin < fNclustMax) return;
7c679be0	73
36b5cc43	74	Int_t nc=1, nk;
36b5cc43	75	DoubleClusters(nc,nk,vPy,mY);
7c679be0	76	do{ //loop over beta
7c679be0	77	fBeta*=fAlpha;
36b5cc43	78	Annealing(nk,xData,vPx,vPy,mPyx,mY);
36b5cc43	79	NumCl(nc,nk,vPy,mPyx,mY);
7c679be0	80	}while((fBeta<betaStop \|\| nc<4) && nc<fNclustMax);
	81
	82	Int_t *xx=new Int_t[fNin];
36b5cc43	83	EndDetAnn(nk,xData,xx,dEtSum,vPx,vPy,mPyx,mY);
36b5cc43	84	StoreJets(nk,xData,xx,mY);
7c679be0	85	delete [] xx;
7c679be0	86
36b5cc43	87	delete [] xData[0], delete [] xData[1];
	88	delete mPyx;
	89	delete mY;
	90	delete vPx;
	91	delete vPy;
	92
7c679be0	93	}
	94
	95	//-----------------------------------------------------------------------------------
36b5cc43	96	void AliDAJetFinder::InitDetAnn(Double_t &dEtSum,Double_t *xData,TVectorD vPx,TVectorD vPy,TMatrixD mPyx,TMatrixD *mY)
7c679be0	97	{
	98	//Initialise the variables used by the algorithm
	99	fBeta=0.1;
9e4cc50d	100	fNclustMax= ((AliDAJetHeader*)fHeader)->GetFixedCl() ?
36b5cc43	101	((AliDAJetHeader*)fHeader)->GetNclustMax() :
9e4cc50d	102	TMath::Max((Int_t)TMath::Sqrt(fNin),5);
e53baffe	103	TClonesArray *lvArray = fReader->GetMomentumArray();
	104	Int_t nEntr = lvArray->GetEntries();
	105	fNin=0;
	106	for (Int_t iEn=0; iEn<nEntr; iEn++) if (fReader->GetCutFlag(iEn)==1) fNin++;
36b5cc43	107	Double_t *xEta = new Double_t[fNin];
e53baffe	108	Double_t *xPhi = new Double_t[fNin];
36b5cc43	109	xData[0]=xEta; xData[1]=xPhi;
36b5cc43	110	vPx->ResizeTo(fNin);
e53baffe	111	Int_t iIn=0;
	112	for (Int_t iEn=0; iEn<nEntr; iEn++){
	113	if (fReader->GetCutFlag(iEn)==0) continue;
	114	TLorentzVector lv=(TLorentzVector)lvArray->At(iEn);
36b5cc43	115	xEta[iIn] = lv->Eta();
	116	xPhi[iIn] = lv->Phi()<0 ? lv->Phi() + 2*TMath::Pi() : lv->Phi();
	117	(*vPx)(iIn)=lv->Pt();
	118	dEtSum+=(*vPx)(iIn);
e53baffe	119	iIn++;
7c679be0	120	}
19b36dbe	121	for (iIn=0; iIn<fNin; iIn++) (vPx)(iIn)=(vPx)(iIn)/dEtSum;
7c679be0	122
7c679be0	123	Int_t njdim=2*fNclustMax+1;
36b5cc43	124	mPyx->ResizeTo(fNin,njdim);
	125	mY->ResizeTo(4,njdim);
	126	vPy->ResizeTo(njdim);
	127	mY->Zero();mPyx->Zero();vPy->Zero();
	128	(*vPy)(0)=1;
	129	TMatrixDColumn(*mPyx,0)=1;
7c679be0	130	Double_t ypos=0,xpos=0;
19b36dbe	131	for (iIn=0; iIn<fNin; iIn++){
36b5cc43	132	(mY)(0,0)+=(vPx)(iIn)*xEta[iIn];
	133	ypos+=(vPx)(iIn)TMath::Sin(xPhi[iIn]);
	134	xpos+=(vPx)(iIn)TMath::Cos(xPhi[iIn]);
7c679be0	135	}
36b5cc43	136	(mY)(1,0)=(atan2(ypos,xpos)>0) ? atan2(ypos,xpos) : atan2(ypos,xpos)+2TMath::Pi();
7c679be0	137	}
	138
	139	//-----------------------------------------------------------------------------------
c0a5117c	140	void AliDAJetFinder::DoubleClusters(Int_t nc,Int_t &nk, TVectorD vPy, TMatrixD mY) const
7c679be0	141	{
7c679be0	142	for(Int_t iClust=0; iClust<nc; iClust++){
36b5cc43	143	(vPy)(iClust)=(vPy)(iClust)/2;
	144	(vPy)(nc+iClust)=(vPy)(iClust);
	145	for(Int_t iComp=0; iComp<3; iComp++) (mY)(iComp,nc+iClust)=(mY)(iComp,iClust);
7c679be0	146	}
	147	nk=2*nc;
	148	}
	149
	150	//-----------------------------------------------------------------------------------
c0a5117c	151	void AliDAJetFinder::Annealing(Int_t nk,Double_t *xData, TVectorD vPx, TVectorD vPy, TMatrixD mPyx, TMatrixD *mY)
7c679be0	152	{
	153	// Main part of the algorithm
	154	const Double_t pi=TMath::Pi();
	155	TVectorD *py = new TVectorD(nk);
	156	TVectorD *p = new TVectorD(nk);
	157	TMatrixD *y = new TMatrixD(4,nk);
	158	TMatrixD *y1 = new TMatrixD(4,nk);
	159	TMatrixD *ry = new TMatrixD(2,nk);
36b5cc43	160	Double_t *xEta = xData[0];
36b5cc43	161	Double_t *xPhi = xData[1];
7c679be0	162	Double_t Dist(TVectorD,TVectorD);
7c679be0	163
36b5cc43	164	Double_t df[2]={fReader->GetReaderHeader()->GetFiducialEtaMax(),pi};
7c679be0	165	TVectorD vPart(2);
	166	Double_t *m = new Double_t[nk];
	167	Double_t chi,chi1;
	168	do{
	169	Int_t nloop=0;
	170	for (Int_t iClust=0; iClust<nk; iClust++){
36b5cc43	171	for (Int_t i=0; i<3; i++)(y1)(i,iClust)=(mY)(i,iClust);
36b5cc43	172	(py)(iClust)=(vPy)(iClust);
7c679be0	173	}
	174	//perturbation of codevectors
	175	Double_t seed=1000000*gRandom->Rndm(24);
	176	ry->Randomize(-0.5,0.5,seed);
	177	for (Int_t i=0; i<2; i++){
	178	for (Int_t iClust=0; iClust<nk/2; iClust++)
	179	(y1)(i,iClust)+=((ry)(i,iClust)+TMath::Sign(0.5,(ry)(i,iClust)))fDelta*df[i];
	180	for (Int_t iClust=nk/2; iClust<nk; iClust++)
	181	(y1)(i,iClust)-=((ry)(i,iClust-nk/2)+TMath::Sign(0.5,(ry)(i,iClust-nk/2)))fDelta*df[i];
	182	}
	183	do{
	184	//recalculate conditional probabilities
	185	nloop++;
	186	for (Int_t iIn=0; iIn<fNin; iIn++){
36b5cc43	187	vPart(0)=xEta[iIn]; vPart(1)=xPhi[iIn];
7c679be0	188	for(Int_t iClust=0; iClust<nk; iClust++){
36b5cc43	189	(mPyx)(iIn,iClust)=-log((py)(iClust))+fBetaDist(vPart,TMatrixDColumn(y1,iClust));
36b5cc43	190	m[iClust]=(*mPyx)(iIn,iClust);
7c679be0	191	}
	192	Double_t pyxNorm=0;
	193	Double_t minPyx=TMath::MinElement(nk,m);
	194	for (Int_t iClust=0; iClust<nk; iClust++){
36b5cc43	195	(*mPyx)(iIn,iClust)-=minPyx;
	196	(mPyx)(iIn,iClust)=exp(-(mPyx)(iIn,iClust));
	197	pyxNorm+=(*mPyx)(iIn,iClust);
7c679be0	198	}
36b5cc43	199	for (Int_t iClust=0; iClust<nk; iClust++) (*mPyx)(iIn,iClust)/=pyxNorm;
7c679be0	200	}
	201	p->Zero();
	202	y->Zero();
	203	//recalculate codevectors
	204	for (Int_t iClust=0; iClust<nk; iClust++){
	205	Double_t xpos=0,ypos=0,pxy;
36b5cc43	206	for (Int_t iIn=0; iIn<fNin; iIn++) (p)(iClust)+=(vPx)(iIn)(mPyx)(iIn,iClust);
7c679be0	207	for (Int_t iIn=0; iIn<fNin; iIn++){
36b5cc43	208	pxy=(vPx)(iIn)(mPyx)(iIn,iClust)/(p)(iClust);
	209	ypos+=pxy*TMath::Sin(xPhi[iIn]);
	210	xpos+=pxy*TMath::Cos(xPhi[iIn]);
	211	(y)(0,iClust)+=pxyxEta[iIn];
7c679be0	212	}
	213	(y)(1,iClust)=(atan2(ypos,xpos)>0) ? atan2(ypos,xpos) : atan2(ypos,xpos)+2pi;
	214	}
	215	//verify codevectors' stability
	216	chi=0;
	217	for (Int_t iClust=0; iClust<nk; iClust++){
	218	chi1=TMath::CosH((y1)(0,iClust)-(y)(0,iClust))-TMath::Cos((y1)(1,iClust)-(y)(1,iClust));
	219	chi1/=(2TMath::CosH((y1)(0,iClust))TMath::CosH((y)(0,iClust)));
	220	chi1*=chi1;
	221	if (chi1>chi) chi=chi1;
	222	}
	223	chi=TMath::Sqrt(chi);
	224	for (Int_t iClust=0; iClust<nk; iClust++){
	225	for (Int_t i=0; i<2; i++) (y1)(i,iClust)=(y)(i,iClust);
	226	(py)(iClust)=(p)(iClust);
	227	}
	228	if (nloop>fNloopMax){
	229	if (chi<fEpsMax \|\| nloop>500) break;
	230	}
	231	}while (chi>fEps);
	232	}while (chi>fEpsMax);
	233	for (Int_t iClust=0; iClust<nk; iClust++){ //set codevectors and probability equal to those calculated
36b5cc43	234	for (Int_t i=0; i<2; i++) (mY)(i,iClust)=(y)(i,iClust);
36b5cc43	235	(vPy)(iClust)=(p)(iClust);
7c679be0	236	}
	237	delete py;
	238	delete p;
	239	delete y;
	240	delete y1;
	241	delete ry;
c0a5117c	242	delete [] m;
7c679be0	243	}
	244
	245	//-----------------------------------------------------------------------------------
c0a5117c	246	void AliDAJetFinder::NumCl(Int_t &nc,Int_t &nk,TVectorD vPy, TMatrixD mPyx,TMatrixD *mY)
7c679be0	247	{
	248	static Bool_t growcl=true;
	249
	250	if (nk==2) growcl=true;
	251	if (growcl){
	252	//verify if two codevectors are equal within fAvDist
	253	Int_t *nSame = new Int_t[nk];
	254	Int_t *iSame = new Int_t[nk];
	255	Int_t *cont = new Int_t[nk];
	256	for (Int_t iClust=0; iClust<nk; iClust++) cont[iClust]=new Int_t[nk],iSame[iClust]=new Int_t[nk];
	257	for (Int_t iClust=0; iClust<nk; iClust++){
	258	iSame[iClust][iClust]=1;
	259	for (Int_t iClust1=iClust+1; iClust1<nk; iClust1++){
36b5cc43	260	Double_t eta = (mY)(0,iClust) ; Double_t phi = (mY)(1,iClust);
36b5cc43	261	Double_t eta1 = (mY)(0,iClust1); Double_t phi1 = (mY)(1,iClust1);
7c679be0	262	Double_t distCl=(TMath::CosH(eta-eta1)-TMath::Cos(phi-phi1))/(2TMath::CosH(eta)TMath::CosH(eta1));
7c679be0	263	if (distCl < fAvDist) iSame[iClust][iClust1]=iSame[iClust1][iClust]=1;
852db00e	264	else iSame[iClust][iClust1]=iSame[iClust1][iClust]=0;
7c679be0	265	}
	266	}
	267	ReduceClusters(iSame,nk,nc,cont,nSame);
	268	if (nc >= fNclustMax) growcl=false;
	269	//recalculate the nc distinct codevectors
	270	TMatrixD pyx = new TMatrixD(fNin,2nc);
	271	TVectorD *py = new TVectorD(nk);
	272	TMatrixD *y1 = new TMatrixD(3,nk);
	273	for (Int_t iClust=0; iClust<nc; iClust++){
	274	for(Int_t j=0; j<nSame[iClust]; j++){
	275	Int_t iClust1 = cont[iClust][j];
36b5cc43	276	for (Int_t iIn=0; iIn<fNin; iIn++) (pyx)(iIn,iClust)+=(mPyx)(iIn,iClust1);
	277	(py)(iClust)+=(vPy)(iClust1);
	278	for (Int_t i=0; i<2; i++) (y1)(i,iClust)+=(mY)(i,iClust1);
7c679be0	279	}
	280	for (Int_t i=0; i<2; i++) (*y1)(i,iClust)/=nSame[iClust];
	281	}
852db00e	282	for (Int_t iClust=0; iClust<nk; iClust++) delete [] cont[iClust], delete [] iSame[iClust];
	283	delete [] iSame;
	284	delete [] cont;
	285	delete [] nSame;
7c679be0	286	if (nc > nk/2){
7c679be0	287	for (Int_t iClust=0; iClust<nc; iClust++){
36b5cc43	288	for (Int_t iIn=0; iIn<fNin; iIn++) (mPyx)(iIn,iClust)=(pyx)(iIn,iClust);
	289	for (Int_t iComp=0; iComp<2; iComp++) (mY)(iComp,iClust)=(y1)(iComp,iClust);
	290	(vPy)(iClust)=(py)(iClust);
7c679be0	291	}
7c679be0	292	nk=nc;
36b5cc43	293	if (growcl) DoubleClusters(nc,nk,vPy,mY);
7c679be0	294	}
7c679be0	295	delete pyx;
	296	delete py;
	297	delete y1;
	298	}
	299
	300	}
	301
	302	//-----------------------------------------------------------------------------------
c0a5117c	303	void AliDAJetFinder::ReduceClusters(Int_t iSame,Int_t nc,Int_t &ncout,Int_t cont,Int_t *nSameOut) const
7c679be0	304	{
	305	Int_t *nSame = new Int_t[nc];
	306	Int_t *iperm = new Int_t[nc];
	307	Int_t *go = new Int_t[nc];
	308	for (Int_t iCl=0; iCl<nc; iCl++){
	309	nSame[iCl]=0;
852db00e	310	for (Int_t jCl=0; jCl<nc; jCl++) nSame[iCl]+=iSame[iCl][jCl], cont[iCl][jCl]=0;
7c679be0	311	iperm[iCl]=iCl;
	312	go[iCl]=1;
	313	}
	314	TMath::Sort(nc,nSame,iperm,true);
	315	Int_t l=0;
	316	for (Int_t iCl=0; iCl<nc; iCl++){
	317	Int_t k=iperm[iCl];
	318	if (go[k] == 1){
	319	Int_t m=0;
	320	for (Int_t jCl=0; jCl<nc; jCl++){
	321	if (iSame[k][jCl] == 1){
	322	cont[l][m]=jCl;
	323	go[jCl]=0;
	324	m++;
	325	}
	326	}
	327	nSameOut[l]=m;
	328	l++;
	329	}
	330	}
	331	ncout=l;
	332	delete [] nSame;
	333	delete [] iperm;
	334	delete [] go;
	335	}
	336
	337	//-----------------------------------------------------------------------------------
36b5cc43	338	void AliDAJetFinder::EndDetAnn(Int_t &nk,Double_t *xData,Int_t xx,Double_t etx,
36b5cc43	339	TVectorD vPx,TVectorD vPy,TMatrixD mPyx,TMatrixD mY)
7c679be0	340	{
	341	//now assign each particle to only one cluster
	342	Double_t *clusters=new Double_t[nk];
	343	for (Int_t iIn=0; iIn<fNin; iIn++){
36b5cc43	344	for (Int_t iClust=0; iClust<nk; iClust++) clusters[iClust]=(*mPyx)(iIn,iClust);
7c679be0	345	xx[iIn]=TMath::LocMax(nk,clusters);
	346	}
	347	delete [] clusters;
	348
	349	//recalculate codevectors, having all p(y\|x)=0 or 1
36b5cc43	350	Double_t *xEta = xData[0];
	351	Double_t *xPhi = xData[1];
	352	mY->Zero();
	353	mPyx->Zero();
	354	vPy->Zero();
7c679be0	355	for (Int_t iIn=0; iIn<fNin; iIn++){
7c679be0	356	Int_t iClust=xx[iIn];
36b5cc43	357	(*mPyx)(iIn,iClust)=1;
	358	(vPy)(iClust)+=(vPx)(iIn);
	359	(mY)(0,iClust)+=(vPx)(iIn)*xEta[iIn];
	360	(mY)(3,iClust)+=(vPx)(iIn)*etx;
7c679be0	361	}
	362	Int_t k=0;
	363	for (Int_t iClust=0; iClust<nk; iClust++){
36b5cc43	364	if ((*vPy)(iClust)>0){
7c679be0	365	Double_t xpos=0,ypos=0,pxy;
7c679be0	366	for (Int_t iIn=0; iIn<fNin; iIn++){
36b5cc43	367	pxy=(vPx)(iIn)(mPyx)(iIn,iClust)/(vPy)(iClust);
	368	ypos+=pxy*TMath::Sin(xPhi[iIn]);
	369	xpos+=pxy*TMath::Cos(xPhi[iIn]);
7c679be0	370	if (xx[iIn]==iClust) xx[iIn]=k;
7c679be0	371	}
36b5cc43	372	(mY)(0,k)=(mY)(0,iClust)/(*vPy)(iClust);
	373	(mY)(1,k)=(atan2(ypos,xpos)>0) ? atan2(ypos,xpos) : atan2(ypos,xpos)+2TMath::Pi();
	374	(mY)(3,k)=(mY)(3,iClust);
7c679be0	375	k++;
	376	}
	377	}
	378	nk=k;
	379	}
	380
	381	//-----------------------------------------------------------------------------------
c0a5117c	382	void AliDAJetFinder::StoreJets(Int_t nk,Double_t *xData, Int_t xx, TMatrixD *mY)
7c679be0	383	{
	384	//evaluate significant clusters properties
	385	const Double_t pi=TMath::Pi();
36b5cc43	386	AliJetReaderHeader *rHeader=fReader->GetReaderHeader();
	387	Float_t dFiducialEta=rHeader->GetFiducialEtaMax()-rHeader->GetFiducialEtaMin();
	388	Double_t dMeanDist=TMath::Sqrt(2dFiducialEtapi/fNin);
	389	Double_t *xEta = xData[0];
	390	Double_t *xPhi = xData[1];
7c679be0	391	Bool_t *isJet = new Bool_t[nk];
	392	Double_t *etNoBg= new Double_t[nk];
	393	Double_t *dDeltaEta=new Double_t[nk];
	394	Double_t *dDeltaPhi=new Double_t[nk];
	395	Double_t *surf = new Double_t[nk];
	396	Double_t *etDens= new Double_t[nk];
	397	for (Int_t iClust=0; iClust<nk; iClust++){ //clusters loop
	398	isJet[iClust]=false;
	399	Double_t dEtaMin=10.,dEtaMax=-10.,dPhiMin=10.,dPhiMax=0.;
	400	for (Int_t iIn=0; iIn<fNin; iIn++){
	401	if (xx[iIn]!=iClust) continue;
36b5cc43	402	if (xEta[iIn] < dEtaMin) dEtaMin=xEta[iIn];
	403	if (xEta[iIn] > dEtaMax) dEtaMax=xEta[iIn];
	404	Double_t dPhi=xPhi[iIn]-(*mY)(1,iClust);
7c679be0	405	if (dPhi > pi ) dPhi-=2*pi;
	406	else if (dPhi < (-1)pi) dPhi+=2pi;
	407	if (dPhi < dPhiMin) dPhiMin=dPhi;
	408	else if (dPhi > dPhiMax) dPhiMax=dPhi;
	409	}
	410	dDeltaEta[iClust]=dEtaMax-dEtaMin+dMeanDist;
	411	dDeltaPhi[iClust]=dPhiMax-dPhiMin+dMeanDist;
	412	surf[iClust]=0.25pidDeltaEta[iClust]*dDeltaPhi[iClust];
36b5cc43	413	etDens[iClust]=(*mY)(3,iClust)/surf[iClust];
7c679be0	414	}
7c679be0	415
9e4cc50d	416	if (((AliDAJetHeader*)fHeader)->GetSelJets()){
7c679be0	417	for (Int_t iClust=0; iClust<nk; iClust++){
	418	if (!isJet[iClust]){
	419	Double_t etDensMed=0.;
	420	Double_t etDensSqr=0.;
	421	Int_t norm=0;
	422	for (Int_t iClust1=0; iClust1<nk; iClust1++){
	423	if(iClust1!=iClust){
	424	etDensMed+=etDens[iClust1];
	425	etDensSqr+=TMath::Power(etDens[iClust1],2);
	426	norm++;
	427	}
	428	}
	429	etDensMed/=TMath::Max(norm,1);
	430	etDensSqr/=TMath::Max(norm,1);
	431	Double_t deltaEtDens=TMath::Sqrt(etDensSqr-TMath::Power(etDensMed,2));
36b5cc43	432	if ((mY)(3,iClust) > (etDensMed+deltaEtDens)surf[iClust]) isJet[iClust]=kTRUE;
36b5cc43	433	etNoBg[iClust]=(mY)(3,iClust)-etDensMedsurf[iClust];
7c679be0	434	}
	435	}
	436	for (Int_t iClust=0; iClust<nk; iClust++){
	437	if (isJet[iClust]){
	438	Double_t etDensMed=0;
36b5cc43	439	Double_t extSurf=2dFiducialEtapi;
7c679be0	440	for (Int_t iClust1=0; iClust1<nk; iClust1++){
36b5cc43	441	if (!isJet[iClust1]) etDensMed+=(*mY)(3,iClust1);
7c679be0	442	else extSurf-=surf[iClust1];
	443	}
	444	etDensMed/=extSurf;
36b5cc43	445	etNoBg[iClust]=(mY)(3,iClust)-etDensMedsurf[iClust];
10bd125d	446	if (etNoBg[iClust]<((AliDAJetHeader*)fHeader)->GetEtMin()){
	447	isJet[iClust]=kFALSE;
	448	iClust=-1;
	449	}
7c679be0	450	}
	451	}
	452	} else {
	453	for (Int_t iClust=0; iClust<nk; iClust++) isJet[iClust]=true;
	454	}
	455	delete [] etDens;
	456	delete [] surf;
	457
	458	//now add selected jets to the list
af816924	459	Int_t *iSort = new Int_t[nk];
	460	TMath::Sort(nk,etNoBg,iSort,true);
	461	Int_t iCl = 0;
7c679be0	462	TRefArray *refs = 0;
	463	Bool_t fromAod = !strcmp(fReader->ClassName(),"AliJetAODReader");
	464	if (fromAod) refs = fReader->GetReferences();
	465	for (Int_t iClust=0; iClust<nk; iClust++){ //clusters loop
af816924	466	iCl=iSort[iClust];
af816924	467	if (isJet[iCl]){ //choose cluster
7c679be0	468	Float_t px,py,pz,en;
af816924	469	px = (mY)(3,iCl)TMath::Cos((*mY)(1,iCl));
	470	py = (mY)(3,iCl)TMath::Sin((*mY)(1,iCl));
	471	pz = (mY)(3,iCl)/TMath::Tan(2.0 TMath::ATan(TMath::Exp(-(*mY)(0,iCl))));
7c679be0	472	en = TMath::Sqrt(px * px + py * py + pz * pz);
7c679be0	473	AliAODJet jet(px, py, pz, en);
e53baffe	474	if (fromAod){
	475	Int_t iIn=0;
	476	Int_t nEntr = fReader->GetMomentumArray()->GetEntries();
	477	for (Int_t iEn=0; iEn<nEntr; iEn++){
	478	if (fReader->GetCutFlag(iEn)==0) continue;
af816924	479	if (xx[iIn]==iCl) jet.AddTrack(refs->At(iEn));
e53baffe	480	iIn++;
	481	}
	482	}
7c679be0	483	AddJet(jet);
dd677561	484	if (fDebug > 0) printf("jet %d, Eta: %f, Phi: %f, Et: %f\n",iCl,jet.Eta(),jet.Phi(),jet.Pt());
7c679be0	485	}
	486	}
	487	delete [] dDeltaEta; delete [] dDeltaPhi;
	488	delete [] etNoBg;
	489	delete [] isJet;
af816924	490	delete [] iSort;
7c679be0	491	}
	492
	493	//-----------------------------------------------------------------------------------
	494	Double_t Dist(TVectorD x,TVectorD y)
	495	{
	496	// Squared distance
	497	const Double_t pi=TMath::Pi();
	498	Double_t dphi=TMath::Abs(x(1)-y(1));
	499	if (dphi > pi) dphi=2*pi-dphi;
	500	Double_t dist=pow(x(0)-y(0),2)+pow(dphi,2);
	501	return dist;
	502	}