EdbMosaicPath Class Reference

#include <EdbMosaicPath.h>

Inheritance diagram for EdbMosaicPath:

Collaboration diagram for EdbMosaicPath:

Public Member Functions
Float_t	Dist (const int i) const
	EdbMosaicPath (int n)
EdbViewHeader *	FindNearest (const TObjArray &harr, const float x0, const float y0)
int	GetAlignedNeighbours (const int i0, TArrayI &list) const
EdbViewHeader *	GetHeader (int i) const
int	I (const int i) const
void	InitArea (const TObjArray &harr, const float x0, const float y0, int nsegmin)
float	InitLineX (const TObjArray &harr, const float y0, const float dy)
float	InitLineY (const TObjArray &harr, const float x0, const float dx)
int	N () const
int	N0 () const
int	OK (const int i) const
void	SetOK (const int i)
virtual	~EdbMosaicPath ()

Public Attributes
Float_t	eR0
Float_t	eX0
Float_t	eY0

Private Attributes
TArrayF	eDist
TObjArray	eHarr
TArrayI	eInd
Int_t	eN
Int_t	eN0
TArrayI	eOK

Constructor & Destructor Documentation

EdbMosaicPath()

EdbMosaicPath::EdbMosaicPath ( int  n )

inline

: eHarr(n),eOK(n),eDist(n),eInd(n) {eN0=n;}

~EdbMosaicPath()

virtual EdbMosaicPath::~EdbMosaicPath ( )

inlinevirtual

{}

Member Function Documentation

Dist()

Float_t EdbMosaicPath::Dist ( const int  i ) const

inline

{ return eDist[i]; }

FindNearest()

EdbViewHeader * EdbMosaicPath::FindNearest	(	const TObjArray &	harr,
		const float	x0,
		const float	y0
	)

{
  int n = harr.GetEntries();
  float r2min=kMaxLong;
  EdbViewHeader *h0=0;
  for(int i=0; i<n; i++)
  {
    EdbViewHeader *h=(EdbViewHeader *)(harr.At(i));
    float dx = h->GetXview()-x0;
    float dy = h->GetYview()-y0;
    float r2 = dx*dx+dy*dy;
    if(r2<r2min)
    {
      r2min=r2;
      h0=h;
    }
  }
  return h0;
}

GetAlignedNeighbours()

int EdbMosaicPath::GetAlignedNeighbours	(	const int	i0,
		TArrayI &	list
	)		const

{
  // for a given view return list of already aligned neighbours
  EdbViewHeader *h0 = (EdbViewHeader *)(eHarr.At(i0));
  int n=0;
  for(int i=0; i<eN; i++)
  {
    if(eOK[i]) {
      EdbViewHeader *h=(EdbViewHeader *)(eHarr.At(i));
      float  dx = h->GetXview() - h0->GetXview();
      float  dy = h->GetYview() - h0->GetYview();
      float  d  = Sqrt(dx*dx+dy*dy);
      if( d<eR0 && d>0.1 ) { list[n] = i; n++; }
    }
  }
  return n;
}

GetHeader()

EdbViewHeader* EdbMosaicPath::GetHeader ( int  i ) const

inline

{ return (EdbViewHeader *)(eHarr.At(i)); }

I()

int EdbMosaicPath::I ( const int  i ) const

inline

{ return eInd[i]; }

InitArea()

void EdbMosaicPath::InitArea	(	const TObjArray &	harr,
		const float	x0,
		const float	y0,
		int	nsegmin
	)

{
  eX0 = x0;
  eY0 = y0;
  int n = harr.GetEntries();
  if(n>eN0) {Log(1,"EdbMosaicPath::InitArea","ERROR: array length %d > %d",n,eN0); return;}
  int cnt=0;
  for(int i=0; i<n; i++)
  {
    EdbViewHeader *h=(EdbViewHeader *)(harr.At(i));
    //if( h->GetNsegments() >= nsegmin )
    if( 1 )
    {
      eHarr.AddAt(h,cnt);
      float dx = h->GetXview()-eX0;
      float dy = h->GetYview()-eY0;
      eDist[cnt] = Sqrt(dx*dx+dy*dy);
      cnt++;
    }
  }
  eN=cnt;
  TMath::Sort(eN,eDist.GetArray(),eInd.GetArray(),0);
}

InitLineX()

float EdbMosaicPath::InitLineX	(	const TObjArray &	harr,
		const float	y0,
		const float	dy
	)

{
  eN0 = harr.GetEntries();
  int cnt=0;
  for(int i=0; i<eN0; i++)
  {
    EdbViewHeader *h=(EdbViewHeader *)(harr.At(i));
    eHarr.Add(h);
    if( Abs( h->GetYview()-y0 ) < dy0 ) {
      eDist[i] = h->GetXview();
      cnt++;
    } else    eDist[i] = kMaxLong;
  }
  eN  = cnt;
  TMath::Sort(eN0,eDist.GetArray(),eInd.GetArray(),0);
  eY0 = y0;
  eX0 = ((EdbViewHeader *)(eHarr.At(I(0))))->GetXview();
  return ((EdbViewHeader *)(eHarr.At(I(eN-1))))->GetXview() - eX0;
}

InitLineY()

float EdbMosaicPath::InitLineY	(	const TObjArray &	harr,
		const float	x0,
		const float	dx
	)

{
  eN0 = harr.GetEntries();
  int cnt=0;
  for(int i=0; i<eN0; i++)
  {
    EdbViewHeader *h=(EdbViewHeader *)(harr.At(i));
    eHarr.Add(h);
    if( Abs( h->GetXview()-x0 ) < dx0 ) {
      eDist[i] = h->GetYview();
      cnt++;
    } else    eDist[i] = kMaxLong;    
  }
  eN  = cnt;
  TMath::Sort(eN0,eDist.GetArray(),eInd.GetArray(),0);
  eX0 = x0;
  eY0 = ((EdbViewHeader *)(eHarr.At(I(0))))->GetYview();
  return ((EdbViewHeader *)(eHarr.At(I(eN-1))))->GetYview() - eY0;
}

N()

int EdbMosaicPath::N ( ) const

inline

{ return eN;  }

N0()

int EdbMosaicPath::N0 ( ) const

inline

{ return eN0; }

OK()

int EdbMosaicPath::OK ( const int  i ) const

inline

{ return eOK[i]; }

SetOK()

void EdbMosaicPath::SetOK ( const int  i )

inline

{ eOK[i]++; }

Member Data Documentation

eDist

TArrayF EdbMosaicPath::eDist

private

eHarr

TObjArray EdbMosaicPath::eHarr

private

eInd

TArrayI EdbMosaicPath::eInd

private

eN

Int_t EdbMosaicPath::eN

private

eN0

Int_t EdbMosaicPath::eN0

private

eOK

TArrayI EdbMosaicPath::eOK

private

eR0

Float_t EdbMosaicPath::eR0

eX0

Float_t EdbMosaicPath::eX0

eY0

Float_t EdbMosaicPath::eY0

---

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

• src/libMosaic/EdbMosaicPath.h
• src/libMosaic/EdbMosaicPath.cxx