[u/mrichter/AliRoot.git] / RICH / AliRICHDetect.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.                  *
 **************************************************************************/

/*
  $Log$
  Revision 1.4  2000/06/15 15:46:59  jbarbosa
  Corrected compilation errors on HP-UX (replaced pow with TMath::Power)

  Revision 1.3  2000/06/13 13:15:41  jbarbosa
  Still some code cleanup done (variable names)

  Revision 1.2  2000/06/12 15:19:30  jbarbosa
  Cleaned up version.

  Revision 1.1  2000/04/19 13:05:14  morsch
  J. Barbosa's spot reconstruction algorithm.

*/


#include "AliRICH.h"
#include "AliRICHPoints.h"
#include "AliRICHDetect.h"
#include "AliRICHHit.h"
#include "AliRICHDigit.h"
#include "AliRun.h"
#include "TParticle.h"
#include "TMath.h"
#include "TRandom.h"


ClassImp(AliRICHDetect)
//___________________________________________
AliRICHDetect::AliRICHDetect() : TObject()
{

// Default constructor 

    //fChambers = 0;
}

//___________________________________________
AliRICHDetect::AliRICHDetect(const char *name, const char *title)
    : TObject()
{
    
// Constructor

    /*fChambers = new TObjArray(7);
    for (Int_t i=0; i<7; i++) {
    
	(*fChambers)[i] = new AliRICHchamber();  
	
    } */     
}


void AliRICHDetect::Detect()
{  	
    
//
// Detection algorithm


  //printf("Detection started!\n");
  Float_t omega,steptheta,stepphi,x,y,cx,cy,l,aux1,aux2,aux3,maxi,maxj,maxk,max;
  //Float_t theta,phi,realomega,realtheta;
  Int_t i,j,k;
  
  //const Float_t Noise_Level=0;          //Noise Level in percentage of mesh points
  //const Float_t t=0.6;			//Softening of Noise Correction (factor)
  
  const Float_t kPi=3.1415927;		
  
  const Float_t kHeight=10;                       //Distance from Radiator to Pads in pads
  
  
  const Int_t kDimensionTheta=100;		//Matrix dimension for angle Detection
  const Int_t kDimensionPhi=100;
  const Int_t kDimensionOmega=100;
  
  //const Float_t SPOTp=.2;		//Percentage of spot action
  //const Int_t np=500;		//Number of points to reconstruct elipse 
  const Float_t kMaxOmega=65*kPi/180;		//Maximum Cherenkov angle to identify
  
  Int_t point[kDimensionTheta][kDimensionPhi][kDimensionOmega];
  //Int_t point1[kDimensionTheta][kDimensionPhi][kDimensionOmega];
  
  steptheta=kPi/kDimensionTheta;
  stepphi=kPi/kDimensionPhi;

  AliRICHChamber*       iChamber;
  
  AliRICH *pRICH  = (AliRICH*)gAlice->GetDetector("RICH");
  Int_t ntracks = (Int_t)gAlice->TreeH()->GetEntries();
  //Int_t ntrks = gAlice->GetNtrack();
  
  Float_t trackglob[3];
  Float_t trackloc[3];

  //printf("Got ntracks:%d\n",ntracks);
  /*TVector *xp = new TVector(1000);
  TVector *yp = new TVector(1000);
  TVector *zp = new TVector(1000);
  TVector *ptrk = new TVector(1000);
  TVector *phit = new TVector(1000);*/
  
  //printf("Area de uma elipse com teta 0 e Omega 45:%f",Area(0,45));
    
	
  for (Int_t track=0; track<ntracks;track++) {
    gAlice->ResetHits();
    gAlice->TreeH()->GetEvent(track);
    TClonesArray *pHits  = pRICH->Hits();
    if (pHits == 0) return;
    Int_t nhits = pHits->GetEntriesFast();
    if (nhits == 0) continue;
    Int_t nent=(Int_t)gAlice->TreeD()->GetEntries();
    gAlice->TreeD()->GetEvent(nent-1);
    AliRICHHit *mHit = 0;
    AliRICHDigit *points = 0;
    //Int_t npoints=0;
    
    Int_t counter=0;
    //Initialization
    for(i=0;i<kDimensionTheta;i++)
      {
	for(j=0;j<kDimensionPhi;j++)
	  {
	    for(k=0;k<kDimensionOmega;k++)
	      {
		counter++;
		point[i][j][k]=0;
		//printf("Dimensions theta:%d, phi:%d, omega:%d",kDimensionTheta,kDimensionPhi,kDimensionOmega);
		//printf("Resetting %d %d %d, time %d\n",i,j,k,counter);
		//-Noise_Level*(Area(i*kPi/(18*dimension),k*kMaxOmega/dimension)-Area((i-1)*kPi/(18*dimension),(k-1)*kMaxOmega/dimension));
		//printf("n-%f",-Noise_Level*(Area(i*kPi/(18*dimension),k*kMaxOmega/dimension)-Area((i-1)*kPi/(18*dimension),(k-1)*kMaxOmega/dimension)));
	      }
	  }
      }
    mHit = (AliRICHHit*) pHits->UncheckedAt(0);
    //printf("Aqui vou eu\n");
    Int_t nch  = mHit->fChamber;
    //printf("Aqui fui eu\n");
    trackglob[0] = mHit->fX;
    trackglob[1] = mHit->fY;
    trackglob[2] = mHit->fZ;

    cx=trackglob[0];
    cy=trackglob[2];
    
    
    //printf("Chamber processed:%d\n",nch);
    printf("Center processed: %3.1f %3.1f %3.1f\n",trackglob[0],trackglob[1],trackglob[2]);

    iChamber = &(pRICH->Chamber(nch-1));
    
    //printf("Nch:%d\n",nch);

    iChamber->GlobaltoLocal(trackglob,trackloc);
    
    //printf("Transformation 1: %3.1f %3.1f %3.1f\n",trackloc[0],trackloc[1],trackloc[2]);


    iChamber->LocaltoGlobal(trackloc,trackglob);
       
    //printf("Transformation 2: %3.1f %3.1f %3.1f\n",trackglob[0],trackglob[1],trackglob[2]);
    
    
    TClonesArray *pDigits = pRICH->DigitsAddress(nch-1);   
    Int_t ndigits = pDigits->GetEntriesFast();
    
    //printf("Got %d digits\n",ndigits);

    //printf("Starting calculations\n");
    
    for(Float_t theta=0;theta<kPi/18;theta+=steptheta)
      {			
	for(Float_t phi=0;phi<=kPi/3;phi+=stepphi)
	  {		       
	    for (Int_t dig=0;dig<ndigits;dig++)
	      {	
		points=(AliRICHDigit*) pDigits->UncheckedAt(dig);
		
		x=points->fPadX-cx;
		y=points->fPadY-cy;
		//printf("Loaded digit %d with coordinates x:%f, y%f\n",dig,x,y);
		//cout<<"x="<<x<<" y="<<y<<endl;
		
		if (sqrt(TMath::Power(x,2)+TMath::Power(y,2))<kHeight*tan(theta+kMaxOmega)*3/4)
		  {
		    
		    l=kHeight/cos(theta);
		    
		    aux1=-y*sin(phi)+x*cos(phi);
		    aux2=y*cos(phi)+x*sin(phi);
		    aux3=( TMath::Power(aux1,2)+TMath::Power(cos(theta)*aux2 ,2))/TMath::Power(sin(theta)*aux2+l,2);
		    //cout<<"aux1="<<aux1<<" aux2="<<aux2<<" aux3="<<aux3;
		    
		    omega=atan(sqrt(aux3));
		    //printf("Omega: %f\n",omega);
		    
		    //cout<<"\ni="<<i<<" theta="<<Int_t(2*theta*dimension/kPi)<<" phi="<<Int_t(2*phi*dimension/kPi)<<" omega="<<Int_t(2*omega*dimension/kPi)<<endl<<endl;
		    //{Int_t lixo;cin>>lixo;}
		    if(omega<kMaxOmega)point[Int_t(2*theta*kDimensionTheta/kPi)][Int_t(2*phi*kDimensionPhi/kPi)][Int_t(omega*kDimensionOmega/kMaxOmega)]+=1;	
		    //if(omega<kMaxOmega)point[Int_t(theta)][Int_t(phi)][Int_t(omega)]+=1;
		  }
		}
	  }
      }	
    
    
    //SPOT execute twice
    /*for(s=1;i<=2;s++)
      {
	//buffer copy
	for(i=0;i<=kDimensionTheta;i++)
	  for(j=0;j<=kDimensionPhi;j++)
	    for(k=0;k<=kDimensionOmega;k++)
	      point1[i][j][k]=point[i][j][k];	
	
	cout<<"COM SPOT!"<<endl;{Int_t lixo;cin>>lixo;}					
	//SPOT algorithm			
	for(i=1;i<kDimensionTheta;i++)
	  for(j=1;j<kDimensionPhi;j++)
	    for(k=1;k<kDimensionOmega;k++)
	      {
		if((point[i][k][j]>point[i-1][k][j])&&(point[i][k][j]>point[i+1][k][j])&&
		   (point[i][k][j]>point[i][k-1][j])&&(point[i][k][j]>point[i][k+1][j])&&
		   (point[i][k][j]>point[i][k][j-1])&&(point[i][k][j]>point[i][k][j+1]))
		  {
		    //cout<<"SPOT"<<endl;
		    //Execute SPOT on point											   	
		    point1[i][j][k]+=int(SPOTp*(point[i-1][k][j]+point[i+1][k][j]+point[i][k-1][j]+point[i][k+1][j]+point[i][k][j-1]+point[i][k][j+1]));    
		    point1[i-1][k][j]=int(SPOTp*point[i-1][k][j]);
		    point1[i+1][k][j]=Int_t(SPOTp*point[i+1][k][j]);
		    point1[i][k-1][j]=Int_t(SPOTp*point[i][k-1][j]);
		    point1[i][k+1][j]=Int_t(SPOTp*point[i][k+1][j]);
		    point1[i][k][j-1]=Int_t(SPOTp*point[i][k][j-1]);
		    point1[i][k][j+1]=Int_t(SPOTp*point[i][k][j+1]);
		  }
	      }
	//copy from buffer copy
	for(i=1;i<kDimensionTheta;i++)
	  for(j=1;j<kDimensionPhi;j++)
	    for(k=1;k<kDimensionOmega;k++)
	      point[i][j][k]=point1[i][j][k];										
	  
	  }*/
    
    
    //Identification is equivalent to maximum determination
    max=0;maxi=0;maxj=0;maxk=0;
    
    //cout<<"Proceeding to Identification"<<endl;
    
    for(i=1;i<kDimensionTheta-3;i++)
      for(j=1;j<=kDimensionPhi-3;j++)
	for(k=0;k<=kDimensionOmega;k++)
	  if(point[i][j][k]>max)
	    {
	      //cout<<"maxi="<<i*90/dimension<<" maxj="<<j*90/dimension<<" maxk="<<k*kMaxOmega/dimension*180/kPi<<" max="<<max<<endl;
	      maxi=i;maxj=j;maxk=k;
	      max=point[i][j][k];
	      //printf("Max Omega %f, Max Theta %f, Max Phi %f\n",maxk,maxi,maxj);
	    }
    
    //printf("Detected angle for height %3.1f and for center %3.1f %3.1f:%f\n",h,cx,cy,maxk*kPi/(kDimensionTheta*4));
    //printf("Detected angle for height %3.1f and for center %3.1f %3.1f:%f\n",kHeight,cx,cy,maxk);


    //fscanf(omegas,"%f",&realomega);
    //fscanf(thetas,"%f",&realtheta);
    //printf("Real Omega: %f",realomega);			
    //cout<<"Detected:theta="<<maxi*90/kDimensionTheta<<"phi="<<maxj*90/kDimensionPhi<<"omega="<<maxk*kMaxOmega/kDimensionOmega*180/kPi<<" OmegaError="<<fabs(maxk*kMaxOmega/kDimensionOmega*180/kPi-realomega)<<" ThetaError="<<fabs(maxi*90/kDimensionTheta-realtheta)<<endl<<endl;		
    
    //fprintf(results,"Center Coordinates, cx=%6.2f cy=%6.2f, Real Omega=%6.2f, Detected Omega=%6.2f, Omega Error=%6.2f Theta Error=%6.2f\n",cx,cy,realomega,maxk*kMaxOmega/kDimensionOmega*180/kPi,fabs(maxk*kMaxOmega/kDimensionOmega*180/kPi-realomega),fabs(maxi*90/kDimensionTheta-realtheta));
    
    /*for(j=0;j<np;j++)
      pointpp(maxj*90/kDimensionTheta,maxi*90/kDimensionPhi,maxk*kMaxOmega/kDimensionOmega*180/kPi,cx,cy);//Generates a point on the elipse*/		    


    //Start filling rec. hits
    
    Float_t rechit[6];
    
    rechit[0] = (Float_t)( maxi*kPi/(kDimensionTheta*4));
    rechit[1]   = (Float_t)( maxj*kPi/(kDimensionPhi*4));
    rechit[2] = (Float_t)( maxk*kPi/(kDimensionOmega*4));
    //rechit[0] = (Float_t)( maxi);
    //rechit[1]   = (Float_t)( maxj);
    //rechit[2] = (Float_t)( maxk);
    rechit[3] = cx;
    rechit[4] = cy;
    rechit[5] = 0.5;
    
    //printf ("track %d, theta %f, phi %f, omega %f\n\n\n",track,rechit[0],rechit[1],rechit[2]);
    
    // fill rechits
    //pRICH->AddRecHit(nch-1,rechit);
  }			
  //printf("\n\n\n\n");
  gAlice->TreeR()->Fill();
  //TTree *TR=gAlice->TreeR();
  //Stat_t ndig=TR->GetEntries();
  TClonesArray *fRec;
  for (i=0;i<kNCH;i++) {
    fRec=pRICH->RecHitsAddress(i);
    int ndig=fRec->GetEntriesFast();
    printf ("Chamber %d, rings %d\n",i,ndig);
  }
  //printf("Number of rec. hits: %d",ndig);
  pRICH->ResetRecHits();
  //char hname[30];
  //sprintf(hname,"TreeR%d",track);
  //gAlice->TreeR()->Write(hname);
	
}

Float_t AliRICHDetect:: Area(Float_t theta,Float_t omega)
{

//
// Calculates area of an ellipse for given incidence angles    


    Float_t area;
    const Float_t kHeight=9.25;                       //Distance from Radiator to Pads in pads
    
    area=TMath::Pi()*TMath::Power(kHeight*tan(omega),2)/TMath::Power(TMath::Power(cos(theta),2)-TMath::Power(tan(omega)*sin(theta),2),3/2);
    
    return (area);
}

/*Int_t ***AliRICHDetect::i3tensor(long nrl, long nrh, long ncl, long nch, long ndl, long ndh)
// allocate a Float_t 3tensor with range t[nrl..nrh][ncl..nch][ndl..ndh] 
{
long i,j,nrow=nrh-nrl+1,ncol=nch-ncl+1,ndep=ndh-ndl+1;
Int_t ***t;

// allocate pointers to pointers to rows 
t=(Int_t ***) malloc((size_t)((nrow+NR_END)*sizeof(Int_t**)));
if (!t) printf("allocation failure 1 in f3tensor()");
t += NR_END;
t -= nrl;

// allocate pointers to rows and set pointers to them 
t[nrl]=(Int_t **) malloc((size_t)((nrow*ncol+NR_END)*sizeof(Int_t*)));
if (!t[nrl]) printf("allocation failure 2 in f3tensor()");
t[nrl] += NR_END;
t[nrl] -= ncl;

// allocate rows and set pointers to them 
t[nrl][ncl]=(Int_t *) malloc((size_t)((nrow*ncol*ndep+NR_END)*sizeof(Int_t)));
if (!t[nrl][ncl]) printf("allocation failure 3 in f3tensor()");
t[nrl][ncl] += NR_END;
t[nrl][ncl] -= ndl;

for(j=ncl+1;j<=nch;j++) t[nrl][j]=t[nrl][j-1]+ndep;
for(i=nrl+1;i<=nrh;i++) {
t[i]=t[i-1]+ncol;
t[i][ncl]=t[i-1][ncl]+ncol*ndep;
for(j=ncl+1;j<=nch;j++) t[i][j]=t[i][j-1]+ndep;
}

// return pointer to array of pointers to rows 
return t;
}*/

/*void pointpp(Float_t alfa,Float_t theta,Float_t omega,Float_t cx,Float_t cy)
  {
  Int_t s;
  Float_t fiducial=h*tan((omega+theta)*kPi/180),l=h/cos(theta*kPi/180),xtrial,y,c0,c1,c2;
  
  //cout<<"fiducial="<<fiducial<<endl;
  
  c0=0;c1=0;c2=0;
  while((c1*c1-4*c2*c0)<=0)
  {	
  //Choose which side to go...
  if(aleat(1)>.5) s=1; else s=-1;
  //Trial a y
  y=s*aleat(fiducial);		
  Float_t alfa1=alfa*kPi/180;
  Float_t theta1=theta*kPi/180;
  Float_t omega1=omega*kPi/180;
  //Solve the eq for a trial x
  c0=-TMath::Power(y*cos(alfa1)*cos(theta1),2)-TMath::Power(y*sin(alfa1),2)+TMath::Power(l*tan(omega1),2)+2*l*y*cos(alfa1)*sin(theta1)*TMath::Power(tan(omega1),2)+TMath::Power(y*cos(alfa1)*sin(theta1)*tan(omega1),2);
  c1=2*y*cos(alfa1)*sin(alfa1)-2*y*cos(alfa1)*TMath::Power(cos(theta1),2)*sin(alfa1)+2*l*sin(alfa1)*sin(theta1)*TMath::Power(tan(omega1),2)+2*y*cos(alfa1)*sin(alfa1)*TMath::Power(sin(theta1),2)*TMath::Power(tan(omega1),2);
  c2=-TMath::Power(cos(alfa1),2)-TMath::Power(cos(theta1)*sin(alfa1),2)+TMath::Power(sin(alfa1)*sin(theta1)*tan(omega1),2);
  //cout<<"Trial: y="<<y<<"c0="<<c0<<" c1="<<c1<<" c2="<<c2<<endl;
  }
  //Choose which side to go...
  if(aleat(1)>.5) s=1; else s=-1;
  xtrial=cx+(-c1+s*sqrt(c1*c1-4*c2*c0))/(2*c2);
  //cout<<"x="<<xtrial<<" y="<<cy+y<<endl;
  fprintf(final,"%f %f\n",xtrial,cy+y);
  }*/
Commit	Line	Data
c1076715	1	/**************************************************************************
	2	* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
	3	* *
	4	* Author: The ALICE Off-line Project. *
	5	* Contributors are mentioned in the code where appropriate. *
	6	* *
	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	**************************************************************************/
	15
	16	/*
	17	$Log$
a366fdbe	18	Revision 1.4 2000/06/15 15:46:59 jbarbosa
	19	Corrected compilation errors on HP-UX (replaced pow with TMath::Power)
	20
00df6e79	21	Revision 1.3 2000/06/13 13:15:41 jbarbosa
	22	Still some code cleanup done (variable names)
	23
3a3df9e3	24	Revision 1.2 2000/06/12 15:19:30 jbarbosa
	25	Cleaned up version.
	26
237c933d	27	Revision 1.1 2000/04/19 13:05:14 morsch
	28	J. Barbosa's spot reconstruction algorithm.
	29
c1076715	30	*/
	31
	32
	33	#include "AliRICH.h"
	34	#include "AliRICHPoints.h"
	35	#include "AliRICHDetect.h"
237c933d	36	#include "AliRICHHit.h"
237c933d	37	#include "AliRICHDigit.h"
c1076715	38	#include "AliRun.h"
	39	#include "TParticle.h"
	40	#include "TMath.h"
	41	#include "TRandom.h"
	42
	43
	44
	45	ClassImp(AliRICHDetect)
	46	//___________________________________________
	47	AliRICHDetect::AliRICHDetect() : TObject()
	48	{
237c933d	49
	50	// Default constructor
	51
c1076715	52	//fChambers = 0;
	53	}
	54
	55	//___________________________________________
	56	AliRICHDetect::AliRICHDetect(const char name, const char title)
	57	: TObject()
	58	{
	59
237c933d	60	// Constructor
237c933d	61
c1076715	62	/*fChambers = new TObjArray(7);
	63	for (Int_t i=0; i<7; i++) {
	64
	65	(*fChambers)[i] = new AliRICHchamber();
	66
	67	} */
	68	}
	69
	70
	71	void AliRICHDetect::Detect()
	72	{
	73
237c933d	74	//
	75	// Detection algorithm
	76
	77
c1076715	78	//printf("Detection started!\n");
3a3df9e3	79	Float_t omega,steptheta,stepphi,x,y,cx,cy,l,aux1,aux2,aux3,maxi,maxj,maxk,max;
c1076715	80	//Float_t theta,phi,realomega,realtheta;
	81	Int_t i,j,k;
	82
	83	//const Float_t Noise_Level=0; //Noise Level in percentage of mesh points
	84	//const Float_t t=0.6; //Softening of Noise Correction (factor)
	85
3a3df9e3	86	const Float_t kPi=3.1415927;
c1076715	87
3a3df9e3	88	const Float_t kHeight=10; //Distance from Radiator to Pads in pads
c1076715	89
c1076715	90
3a3df9e3	91	const Int_t kDimensionTheta=100; //Matrix dimension for angle Detection
	92	const Int_t kDimensionPhi=100;
	93	const Int_t kDimensionOmega=100;
c1076715	94
	95	//const Float_t SPOTp=.2; //Percentage of spot action
	96	//const Int_t np=500; //Number of points to reconstruct elipse
3a3df9e3	97	const Float_t kMaxOmega=65*kPi/180; //Maximum Cherenkov angle to identify
c1076715	98
3a3df9e3	99	Int_t point[kDimensionTheta][kDimensionPhi][kDimensionOmega];
3a3df9e3	100	//Int_t point1[kDimensionTheta][kDimensionPhi][kDimensionOmega];
c1076715	101
3a3df9e3	102	steptheta=kPi/kDimensionTheta;
3a3df9e3	103	stepphi=kPi/kDimensionPhi;
c1076715	104
	105	AliRICHChamber* iChamber;
	106
3a3df9e3	107	AliRICH pRICH = (AliRICH)gAlice->GetDetector("RICH");
c1076715	108	Int_t ntracks = (Int_t)gAlice->TreeH()->GetEntries();
	109	//Int_t ntrks = gAlice->GetNtrack();
	110
	111	Float_t trackglob[3];
	112	Float_t trackloc[3];
	113
	114	//printf("Got ntracks:%d\n",ntracks);
	115	/TVector xp = new TVector(1000);
	116	TVector *yp = new TVector(1000);
	117	TVector *zp = new TVector(1000);
	118	TVector *ptrk = new TVector(1000);
	119	TVector phit = new TVector(1000);/
	120
	121	//printf("Area de uma elipse com teta 0 e Omega 45:%f",Area(0,45));
	122
	123
	124	for (Int_t track=0; track<ntracks;track++) {
	125	gAlice->ResetHits();
	126	gAlice->TreeH()->GetEvent(track);
3a3df9e3	127	TClonesArray *pHits = pRICH->Hits();
	128	if (pHits == 0) return;
	129	Int_t nhits = pHits->GetEntriesFast();
c1076715	130	if (nhits == 0) continue;
	131	Int_t nent=(Int_t)gAlice->TreeD()->GetEntries();
	132	gAlice->TreeD()->GetEvent(nent-1);
	133	AliRICHHit *mHit = 0;
	134	AliRICHDigit *points = 0;
	135	//Int_t npoints=0;
	136
	137	Int_t counter=0;
	138	//Initialization
3a3df9e3	139	for(i=0;i<kDimensionTheta;i++)
c1076715	140	{
3a3df9e3	141	for(j=0;j<kDimensionPhi;j++)
c1076715	142	{
3a3df9e3	143	for(k=0;k<kDimensionOmega;k++)
c1076715	144	{
c1076715	145	counter++;
3a3df9e3	146	point[i][j][k]=0;
3a3df9e3	147	//printf("Dimensions theta:%d, phi:%d, omega:%d",kDimensionTheta,kDimensionPhi,kDimensionOmega);
c1076715	148	//printf("Resetting %d %d %d, time %d\n",i,j,k,counter);
3a3df9e3	149	//-Noise_Level(Area(ikPi/(18dimension),kkMaxOmega/dimension)-Area((i-1)kPi/(18dimension),(k-1)*kMaxOmega/dimension));
3a3df9e3	150	//printf("n-%f",-Noise_Level(Area(ikPi/(18dimension),kkMaxOmega/dimension)-Area((i-1)kPi/(18dimension),(k-1)*kMaxOmega/dimension)));
c1076715	151	}
	152	}
	153	}
3a3df9e3	154	mHit = (AliRICHHit*) pHits->UncheckedAt(0);
c1076715	155	//printf("Aqui vou eu\n");
	156	Int_t nch = mHit->fChamber;
	157	//printf("Aqui fui eu\n");
	158	trackglob[0] = mHit->fX;
	159	trackglob[1] = mHit->fY;
	160	trackglob[2] = mHit->fZ;
	161
	162	cx=trackglob[0];
	163	cy=trackglob[2];
	164
	165
	166	//printf("Chamber processed:%d\n",nch);
	167	printf("Center processed: %3.1f %3.1f %3.1f\n",trackglob[0],trackglob[1],trackglob[2]);
	168
3a3df9e3	169	iChamber = &(pRICH->Chamber(nch-1));
c1076715	170
	171	//printf("Nch:%d\n",nch);
	172
	173	iChamber->GlobaltoLocal(trackglob,trackloc);
	174
3a3df9e3	175	//printf("Transformation 1: %3.1f %3.1f %3.1f\n",trackloc[0],trackloc[1],trackloc[2]);
c1076715	176
	177
	178	iChamber->LocaltoGlobal(trackloc,trackglob);
	179
3a3df9e3	180	//printf("Transformation 2: %3.1f %3.1f %3.1f\n",trackglob[0],trackglob[1],trackglob[2]);
c1076715	181
	182
	183
	184
3a3df9e3	185	TClonesArray *pDigits = pRICH->DigitsAddress(nch-1);
3a3df9e3	186	Int_t ndigits = pDigits->GetEntriesFast();
c1076715	187
	188	//printf("Got %d digits\n",ndigits);
	189
	190	//printf("Starting calculations\n");
	191
3a3df9e3	192	for(Float_t theta=0;theta<kPi/18;theta+=steptheta)
c1076715	193	{
3a3df9e3	194	for(Float_t phi=0;phi<=kPi/3;phi+=stepphi)
c1076715	195	{
	196	for (Int_t dig=0;dig<ndigits;dig++)
	197	{
3a3df9e3	198	points=(AliRICHDigit*) pDigits->UncheckedAt(dig);
c1076715	199
	200	x=points->fPadX-cx;
	201	y=points->fPadY-cy;
	202	//printf("Loaded digit %d with coordinates x:%f, y%f\n",dig,x,y);
	203	//cout<<"x="<<x<<" y="<<y<<endl;
	204
00df6e79	205	if (sqrt(TMath::Power(x,2)+TMath::Power(y,2))<kHeighttan(theta+kMaxOmega)3/4)
c1076715	206	{
c1076715	207
3a3df9e3	208	l=kHeight/cos(theta);
c1076715	209
	210	aux1=-ysin(phi)+xcos(phi);
	211	aux2=ycos(phi)+xsin(phi);
00df6e79	212	aux3=( TMath::Power(aux1,2)+TMath::Power(cos(theta)aux2 ,2))/TMath::Power(sin(theta)aux2+l,2);
c1076715	213	//cout<<"aux1="<<aux1<<" aux2="<<aux2<<" aux3="<<aux3;
c1076715	214
3a3df9e3	215	omega=atan(sqrt(aux3));
3a3df9e3	216	//printf("Omega: %f\n",omega);
c1076715	217
3a3df9e3	218	//cout<<"\ni="<<i<<" theta="<<Int_t(2thetadimension/kPi)<<" phi="<<Int_t(2phidimension/kPi)<<" omega="<<Int_t(2omegadimension/kPi)<<endl<<endl;
c1076715	219	//{Int_t lixo;cin>>lixo;}
3a3df9e3	220	if(omega<kMaxOmega)point[Int_t(2thetakDimensionTheta/kPi)][Int_t(2phikDimensionPhi/kPi)][Int_t(omega*kDimensionOmega/kMaxOmega)]+=1;
3a3df9e3	221	//if(omega<kMaxOmega)point[Int_t(theta)][Int_t(phi)][Int_t(omega)]+=1;
c1076715	222	}
	223	}
	224	}
	225	}
	226
	227
	228
	229	//SPOT execute twice
	230	/*for(s=1;i<=2;s++)
	231	{
	232	//buffer copy
3a3df9e3	233	for(i=0;i<=kDimensionTheta;i++)
	234	for(j=0;j<=kDimensionPhi;j++)
	235	for(k=0;k<=kDimensionOmega;k++)
	236	point1[i][j][k]=point[i][j][k];
c1076715	237
	238	cout<<"COM SPOT!"<<endl;{Int_t lixo;cin>>lixo;}
	239	//SPOT algorithm
3a3df9e3	240	for(i=1;i<kDimensionTheta;i++)
	241	for(j=1;j<kDimensionPhi;j++)
	242	for(k=1;k<kDimensionOmega;k++)
c1076715	243	{
3a3df9e3	244	if((point[i][k][j]>point[i-1][k][j])&&(point[i][k][j]>point[i+1][k][j])&&
	245	(point[i][k][j]>point[i][k-1][j])&&(point[i][k][j]>point[i][k+1][j])&&
	246	(point[i][k][j]>point[i][k][j-1])&&(point[i][k][j]>point[i][k][j+1]))
c1076715	247	{
	248	//cout<<"SPOT"<<endl;
	249	//Execute SPOT on point
3a3df9e3	250	point1[i][j][k]+=int(SPOTp*(point[i-1][k][j]+point[i+1][k][j]+point[i][k-1][j]+point[i][k+1][j]+point[i][k][j-1]+point[i][k][j+1]));
	251	point1[i-1][k][j]=int(SPOTp*point[i-1][k][j]);
	252	point1[i+1][k][j]=Int_t(SPOTp*point[i+1][k][j]);
	253	point1[i][k-1][j]=Int_t(SPOTp*point[i][k-1][j]);
	254	point1[i][k+1][j]=Int_t(SPOTp*point[i][k+1][j]);
	255	point1[i][k][j-1]=Int_t(SPOTp*point[i][k][j-1]);
	256	point1[i][k][j+1]=Int_t(SPOTp*point[i][k][j+1]);
c1076715	257	}
	258	}
	259	//copy from buffer copy
3a3df9e3	260	for(i=1;i<kDimensionTheta;i++)
	261	for(j=1;j<kDimensionPhi;j++)
	262	for(k=1;k<kDimensionOmega;k++)
	263	point[i][j][k]=point1[i][j][k];
c1076715	264
	265	}*/
	266
	267
	268	//Identification is equivalent to maximum determination
	269	max=0;maxi=0;maxj=0;maxk=0;
	270
	271	//cout<<"Proceeding to Identification"<<endl;
	272
3a3df9e3	273	for(i=1;i<kDimensionTheta-3;i++)
	274	for(j=1;j<=kDimensionPhi-3;j++)
	275	for(k=0;k<=kDimensionOmega;k++)
	276	if(point[i][j][k]>max)
c1076715	277	{
3a3df9e3	278	//cout<<"maxi="<<i90/dimension<<" maxj="<<j90/dimension<<" maxk="<<kkMaxOmega/dimension180/kPi<<" max="<<max<<endl;
c1076715	279	maxi=i;maxj=j;maxk=k;
3a3df9e3	280	max=point[i][j][k];
c1076715	281	//printf("Max Omega %f, Max Theta %f, Max Phi %f\n",maxk,maxi,maxj);
	282	}
	283
3a3df9e3	284	//printf("Detected angle for height %3.1f and for center %3.1f %3.1f:%f\n",h,cx,cy,maxkkPi/(kDimensionTheta4));
3a3df9e3	285	//printf("Detected angle for height %3.1f and for center %3.1f %3.1f:%f\n",kHeight,cx,cy,maxk);
c1076715	286
	287
	288	//fscanf(omegas,"%f",&realomega);
	289	//fscanf(thetas,"%f",&realtheta);
	290	//printf("Real Omega: %f",realomega);
3a3df9e3	291	//cout<<"Detected:theta="<<maxi90/kDimensionTheta<<"phi="<<maxj90/kDimensionPhi<<"omega="<<maxkkMaxOmega/kDimensionOmega180/kPi<<" OmegaError="<<fabs(maxkkMaxOmega/kDimensionOmega180/kPi-realomega)<<" ThetaError="<<fabs(maxi*90/kDimensionTheta-realtheta)<<endl<<endl;
c1076715	292
3a3df9e3	293	//fprintf(results,"Center Coordinates, cx=%6.2f cy=%6.2f, Real Omega=%6.2f, Detected Omega=%6.2f, Omega Error=%6.2f Theta Error=%6.2f\n",cx,cy,realomega,maxkkMaxOmega/kDimensionOmega180/kPi,fabs(maxkkMaxOmega/kDimensionOmega180/kPi-realomega),fabs(maxi*90/kDimensionTheta-realtheta));
c1076715	294
c1076715	295	/*for(j=0;j<np;j++)
3a3df9e3	296	pointpp(maxj90/kDimensionTheta,maxi90/kDimensionPhi,maxkkMaxOmega/kDimensionOmega180/kPi,cx,cy);//Generates a point on the elipse*/
c1076715	297
	298
	299	//Start filling rec. hits
	300
a366fdbe	301	Float_t rechit[6];
c1076715	302
3a3df9e3	303	rechit[0] = (Float_t)( maxikPi/(kDimensionTheta4));
	304	rechit[1] = (Float_t)( maxjkPi/(kDimensionPhi4));
	305	rechit[2] = (Float_t)( maxkkPi/(kDimensionOmega4));
c1076715	306	//rechit[0] = (Float_t)( maxi);
	307	//rechit[1] = (Float_t)( maxj);
	308	//rechit[2] = (Float_t)( maxk);
	309	rechit[3] = cx;
	310	rechit[4] = cy;
a366fdbe	311	rechit[5] = 0.5;
c1076715	312
	313	//printf ("track %d, theta %f, phi %f, omega %f\n\n\n",track,rechit[0],rechit[1],rechit[2]);
	314
	315	// fill rechits
a366fdbe	316	//pRICH->AddRecHit(nch-1,rechit);
c1076715	317	}
	318	//printf("\n\n\n\n");
	319	gAlice->TreeR()->Fill();
	320	//TTree *TR=gAlice->TreeR();
	321	//Stat_t ndig=TR->GetEntries();
	322	TClonesArray *fRec;
237c933d	323	for (i=0;i<kNCH;i++) {
3a3df9e3	324	fRec=pRICH->RecHitsAddress(i);
c1076715	325	int ndig=fRec->GetEntriesFast();
	326	printf ("Chamber %d, rings %d\n",i,ndig);
	327	}
	328	//printf("Number of rec. hits: %d",ndig);
3a3df9e3	329	pRICH->ResetRecHits();
c1076715	330	//char hname[30];
	331	//sprintf(hname,"TreeR%d",track);
	332	//gAlice->TreeR()->Write(hname);
	333
	334	}
	335
3a3df9e3	336	Float_t AliRICHDetect:: Area(Float_t theta,Float_t omega)
c1076715	337	{
237c933d	338
	339	//
	340	// Calculates area of an ellipse for given incidence angles
	341
	342
c1076715	343	Float_t area;
3a3df9e3	344	const Float_t kHeight=9.25; //Distance from Radiator to Pads in pads
c1076715	345
00df6e79	346	area=TMath::Pi()TMath::Power(kHeighttan(omega),2)/TMath::Power(TMath::Power(cos(theta),2)-TMath::Power(tan(omega)*sin(theta),2),3/2);
c1076715	347
	348	return (area);
	349	}
	350
	351	/Int_t **AliRICHDetect::i3tensor(long nrl, long nrh, long ncl, long nch, long ndl, long ndh)
	352	// allocate a Float_t 3tensor with range t[nrl..nrh][ncl..nch][ndl..ndh]
	353	{
	354	long i,j,nrow=nrh-nrl+1,ncol=nch-ncl+1,ndep=ndh-ndl+1;
	355	Int_t ***t;
	356
	357	// allocate pointers to pointers to rows
	358	t=(Int_t **) malloc((size_t)((nrow+NR_END)sizeof(Int_t**)));
	359	if (!t) printf("allocation failure 1 in f3tensor()");
	360	t += NR_END;
	361	t -= nrl;
	362
	363	// allocate pointers to rows and set pointers to them
	364	t[nrl]=(Int_t *) malloc((size_t)((nrowncol+NR_END)sizeof(Int_t)));
	365	if (!t[nrl]) printf("allocation failure 2 in f3tensor()");
	366	t[nrl] += NR_END;
	367	t[nrl] -= ncl;
	368
	369	// allocate rows and set pointers to them
	370	t[nrl][ncl]=(Int_t ) malloc((size_t)((nrowncolndep+NR_END)sizeof(Int_t)));
	371	if (!t[nrl][ncl]) printf("allocation failure 3 in f3tensor()");
	372	t[nrl][ncl] += NR_END;
	373	t[nrl][ncl] -= ndl;
	374
	375	for(j=ncl+1;j<=nch;j++) t[nrl][j]=t[nrl][j-1]+ndep;
	376	for(i=nrl+1;i<=nrh;i++) {
	377	t[i]=t[i-1]+ncol;
	378	t[i][ncl]=t[i-1][ncl]+ncol*ndep;
	379	for(j=ncl+1;j<=nch;j++) t[i][j]=t[i][j-1]+ndep;
	380	}
	381
	382	// return pointer to array of pointers to rows
	383	return t;
	384	}*/
	385
3a3df9e3	386	/*void pointpp(Float_t alfa,Float_t theta,Float_t omega,Float_t cx,Float_t cy)
c1076715	387	{
c1076715	388	Int_t s;
3a3df9e3	389	Float_t fiducial=htan((omega+theta)kPi/180),l=h/cos(theta*kPi/180),xtrial,y,c0,c1,c2;
c1076715	390
	391	//cout<<"fiducial="<<fiducial<<endl;
	392
	393	c0=0;c1=0;c2=0;
	394	while((c1c1-4c2*c0)<=0)
	395	{
	396	//Choose which side to go...
	397	if(aleat(1)>.5) s=1; else s=-1;
	398	//Trial a y
	399	y=s*aleat(fiducial);
3a3df9e3	400	Float_t alfa1=alfa*kPi/180;
	401	Float_t theta1=theta*kPi/180;
	402	Float_t omega1=omega*kPi/180;
c1076715	403	//Solve the eq for a trial x
00df6e79	404	c0=-TMath::Power(ycos(alfa1)cos(theta1),2)-TMath::Power(ysin(alfa1),2)+TMath::Power(ltan(omega1),2)+2lycos(alfa1)sin(theta1)TMath::Power(tan(omega1),2)+TMath::Power(ycos(alfa1)sin(theta1)tan(omega1),2);
	405	c1=2ycos(alfa1)sin(alfa1)-2ycos(alfa1)TMath::Power(cos(theta1),2)sin(alfa1)+2lsin(alfa1)sin(theta1)TMath::Power(tan(omega1),2)+2ycos(alfa1)sin(alfa1)TMath::Power(sin(theta1),2)TMath::Power(tan(omega1),2);
	406	c2=-TMath::Power(cos(alfa1),2)-TMath::Power(cos(theta1)sin(alfa1),2)+TMath::Power(sin(alfa1)sin(theta1)*tan(omega1),2);
c1076715	407	//cout<<"Trial: y="<<y<<"c0="<<c0<<" c1="<<c1<<" c2="<<c2<<endl;
	408	}
	409	//Choose which side to go...
	410	if(aleat(1)>.5) s=1; else s=-1;
	411	xtrial=cx+(-c1+ssqrt(c1c1-4c2c0))/(2*c2);
	412	//cout<<"x="<<xtrial<<" y="<<cy+y<<endl;
	413	fprintf(final,"%f %f\n",xtrial,cy+y);
	414	}*/
	415
	416
	417
	418
	419
	420