ClusterSBPoints Class Reference

define a cluster of SB Points More...

#include <ClusterSBPoints.hh>

Public Member Functions
	ClusterSBPoints (std::set< SBPoint * > pPoints)
	~ClusterSBPoints ()
bool	IsDSB () const
bool	IsSSB () const
unsigned int	GetSize () const
void	AddSBPoint (SBPoint *pSBPoint)
G4ThreeVector	GetBarycenter () const
G4double	GetEdep () const
void	FindAllPointsPossible (std::vector< SBPoint * > *ptToCheck, G4int minPts, G4double minDist)
void	NoticeInternalPts ()
	will set to all store SBPoint they are part of this cluster More...
bool	HasIn (const SBPoint *, G4double)
bool	HasInBarycenter (const SBPoint *, G4double)
void	MergeWith (ClusterSBPoints *)
std::set< SBPoint * >	GetRegistredSBPoints () const
void	Clear ()

Detailed Description

define a cluster of SB Points

Definition at line 48 of file ClusterSBPoints.hh.

Constructor & Destructor Documentation

ClusterSBPoints::ClusterSBPoints

(

std::set< SBPoint * >

pPoints

)

Definition at line 47 of file ClusterSBPoints.cc.

                                                          :
    fpRegisteredSBPoints()
{
  UpdateDoubleStrand();
  std::set<SBPoint*>::iterator itPt;
  for(itPt = pSBPoints.begin(); itPt != pSBPoints.end(); ++itPt)
  {
    AddSBPoint(*itPt);
  }
}

Here is the call graph for this function:

ClusterSBPoints::~ClusterSBPoints

(

)

Definition at line 60 of file ClusterSBPoints.cc.

{
  Clear();
}

Here is the call graph for this function:

Member Function Documentation

void ClusterSBPoints::AddSBPoint

(

SBPoint *

pSBPoint

)

Definition at line 79 of file ClusterSBPoints.cc.

{
  assert(pSBPoint);
  fpRegisteredSBPoints.insert(pSBPoint);
  pSBPoint->SetCluster(this);

  UpdateDoubleStrand();
}

Here is the call graph for this function:

Here is the caller graph for this function:

void ClusterSBPoints::Clear

(

)

Definition at line 65 of file ClusterSBPoints.cc.

{
  std::set<SBPoint*>::iterator itPt;
  for(itPt = fpRegisteredSBPoints.begin();
      itPt != fpRegisteredSBPoints.end();
      ++itPt)
  {
    (*itPt)->CleanCluster();
  }
  fpRegisteredSBPoints.clear();
}

Here is the caller graph for this function:

void ClusterSBPoints::FindAllPointsPossible	(	std::vector< SBPoint * > *	ptToCheck,
		G4int	minPts,
		G4double	minDist
	)

Definition at line 192 of file ClusterSBPoints.cc.

{
  assert((unsigned int)pMinPts > this->GetSize());
  std::vector<SBPoint*>::iterator itPt = pPtsToCheck->begin();
  while(itPt != pPtsToCheck->end() )
  {

    // If 1- each SBpoint is part of only one cluster
    //    2- the point isn't already in the cluster
    //    3- the point is close enough of the barycenter
    if( (!(*itPt)->HasCluster())
        && (fpRegisteredSBPoints.find(*itPt) == fpRegisteredSBPoints.end())
        && HasInBarycenter(*itPt, pMinDist)) // first version used HasIn method
    {
      // the point is added
      this->AddSBPoint(*itPt);
      if(this->GetSize() >= (unsigned int)pMinPts)
      {
        return;
      }
      // restart from scratch
      itPt = pPtsToCheck->begin();
    }else
    {
      ++itPt;
    }
  }
}

Here is the call graph for this function:

G4ThreeVector ClusterSBPoints::GetBarycenter

(

)

const

Definition at line 90 of file ClusterSBPoints.cc.

{
  G4double x = 0;
  G4double y = 0;
  G4double z = 0;

  std::set<SBPoint* >::iterator itSDSPt;
  for(itSDSPt = fpRegisteredSBPoints.begin();
      itSDSPt != fpRegisteredSBPoints.end();
      ++itSDSPt)
  {
    x+= (*itSDSPt)->GetPosition().x();
    y+= (*itSDSPt)->GetPosition().y();
    z+= (*itSDSPt)->GetPosition().z();
  }

  return G4ThreeVector(
      x/fpRegisteredSBPoints.size(),
      y/fpRegisteredSBPoints.size(),
      z/fpRegisteredSBPoints.size());
}

Here is the caller graph for this function:

G4double ClusterSBPoints::GetEdep

(

)

const

Definition at line 114 of file ClusterSBPoints.cc.

{
  G4double res = 0;
  std::set<SBPoint* >::iterator itSDSPt;
  for(itSDSPt = fpRegisteredSBPoints.begin();
      itSDSPt != fpRegisteredSBPoints.end();
      ++itSDSPt)
  {
    res += (*itSDSPt)->GetEdep();
  }
  return res;
}

std::set<SBPoint* > ClusterSBPoints::GetRegistredSBPoints ( ) const

inline

Definition at line 85 of file ClusterSBPoints.hh.

      {
    return fpRegisteredSBPoints;
      }

Here is the caller graph for this function:

unsigned int ClusterSBPoints::GetSize ( ) const

inline

Definition at line 64 of file ClusterSBPoints.hh.

  {
    return fpRegisteredSBPoints.size();
  }

Here is the caller graph for this function:

bool ClusterSBPoints::HasIn	(	const SBPoint *	pPtToCheck,
		G4double	pMinDist
	)

Definition at line 224 of file ClusterSBPoints.cc.

{
  // check if the given point is near one of the cluster's point
  std::set<SBPoint*>::iterator itClusPt;
  for(itClusPt = fpRegisteredSBPoints.begin();
      itClusPt != fpRegisteredSBPoints.end();
      ++itClusPt)
  {
    // if are two different pts
    if((*pPtToCheck != *(*itClusPt)))
    {
      // if close enought of an include point of the cluster
      if( AreOnTheSameCluster(pPtToCheck, *itClusPt, pMinDist) )
      {
        return true;
      }
    }
  }
  return false;
}

Here is the call graph for this function:

bool ClusterSBPoints::HasInBarycenter	(	const SBPoint *	pPtToCheck,
		G4double	pMinDist
	)

Definition at line 247 of file ClusterSBPoints.cc.

{

  G4double x1=pPtToCheck->GetPosition().x()/nm;
  G4double y1=pPtToCheck->GetPosition().y()/nm;
  G4double z1=pPtToCheck->GetPosition().z()/nm;

  G4double x2=this->GetBarycenter().x()/nm;
  G4double y2=this->GetBarycenter().y()/nm;
  G4double z2=this->GetBarycenter().z()/nm;

  // if the two points are closed enough
  if(((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2))<=
      (pMinDist/nm*pMinDist/nm))
  {
    return true;
  }else
  {
    return false;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool ClusterSBPoints::IsDSB ( ) const

inline

Definition at line 54 of file ClusterSBPoints.hh.

  {
    return fIsDoubleSB;
  }

Here is the caller graph for this function:

bool ClusterSBPoints::IsSSB ( ) const

inline

Definition at line 59 of file ClusterSBPoints.hh.

  {
    return ! IsDSB();
  }

Here is the call graph for this function:

void ClusterSBPoints::MergeWith

(

ClusterSBPoints *

pCluster

)

this will insert all registredSBPoint from the given cluster to this cluster.

Definition at line 274 of file ClusterSBPoints.cc.

{
  std::set<SBPoint*> points = pCluster->GetRegistredSBPoints();
  pCluster->Clear();
  std::set<SBPoint*>::iterator itPt;
  for(itPt = points.begin(); itPt != points.end(); ++itPt)
  {
    this->AddSBPoint(*itPt);
  }
}

Here is the call graph for this function:

void ClusterSBPoints::NoticeInternalPts

(

)

will set to all store SBPoint they are part of this cluster

---

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

• source/geant4.10.03.p03/examples/extended/medical/dna/clustering/include/ClusterSBPoints.hh
• source/geant4.10.03.p03/examples/extended/medical/dna/clustering/src/ClusterSBPoints.cc