ClusteringAlgo Class Reference

#include <ClusteringAlgo.hh>

Public Member Functions
	ClusteringAlgo (G4double pEps, G4int pMinPts, G4double pSPointsProb, G4double pEMinDamage, G4double pEMaxDamage)
	~ClusteringAlgo ()
G4double	GetEps ()
void	SetEps (G4double val)
G4int	GetMinPts ()
void	SetMinPts (G4int val)
G4double	GetSPointsProb ()
void	SetSPointsProb (G4double val)
G4double	GetEMinDamage ()
void	SetEMinDamage (G4double val)
G4double	GetEMaxDamage ()
void	SetEMaxDamage (G4double val)
void	RegisterDamage (G4ThreeVector, G4double)
std::map< G4int, G4int >	RunClustering ()
void	Purge ()
G4int	GetSSB () const
G4int	GetComplexSSB () const
G4int	GetDSB () const
std::map< G4int, G4int >	GetClusterSizeDistribution ()

Detailed Description

Definition at line 49 of file ClusteringAlgo.hh.

Constructor & Destructor Documentation

ClusteringAlgo::ClusteringAlgo	(	G4double	pEps,
		G4int	pMinPts,
		G4double	pSPointsProb,
		G4double	pEMinDamage,
		G4double	pEMaxDamage
	)

Definition at line 51 of file ClusteringAlgo.cc.

:fEps(pEps),fMinPts(pMinPts),
 fSPointsProb(pSPointsProb),fEMinDamage(pEMinDamage),fEMaxDamage(pEMaxDamage)
{
  fNextSBPointID = 0;
  fpClustAlgoMessenger = new ClusteringAlgoMessenger(this);
}

ClusteringAlgo::~ClusteringAlgo

(

)

Definition at line 62 of file ClusteringAlgo.cc.

{
  delete fpClustAlgoMessenger;
  Purge();
}

Here is the call graph for this function:

Member Function Documentation

map< G4int, G4int > ClusteringAlgo::GetClusterSizeDistribution

(

)

Definition at line 333 of file ClusteringAlgo.cc.

{
  std::map<G4int,G4int>  sizeDistribution;
  sizeDistribution[1]=GetSSB();
  std::vector<ClusterSBPoints*>::const_iterator itCluster;
  for(itCluster = fpClusters.begin();
      itCluster != fpClusters.end();
      itCluster++)
  {
    sizeDistribution[(*itCluster)->GetSize()]++;
  }
  return sizeDistribution;
}

Here is the call graph for this function:

Here is the caller graph for this function:

G4int ClusteringAlgo::GetComplexSSB

(

)

const

Definition at line 297 of file ClusteringAlgo.cc.

{
  G4int nbSSB = 0;
  std::vector<ClusterSBPoints*>::const_iterator itCluster;
  for(itCluster = fpClusters.begin();
      itCluster != fpClusters.end();
      ++itCluster)
  {
    if((*itCluster)->IsSSB())
    {
      nbSSB ++;
    }
  }
  return nbSSB;
}

G4int ClusteringAlgo::GetDSB

(

)

const

Definition at line 315 of file ClusteringAlgo.cc.

{
  G4int nbDSB = 0;
  std::vector<ClusterSBPoints*>::const_iterator itCluster;
  for(itCluster = fpClusters.begin();
      itCluster != fpClusters.end();
      ++itCluster)
  {
    if((*itCluster)->IsDSB())
    {
      nbDSB ++;
    }
  }
  return nbDSB;
}

G4double ClusteringAlgo::GetEMaxDamage ( )

inline

Definition at line 90 of file ClusteringAlgo.hh.

  {
    return fEMaxDamage;
  };

G4double ClusteringAlgo::GetEMinDamage ( )

inline

Definition at line 82 of file ClusteringAlgo.hh.

  {
    return fEMinDamage;
  };

G4double ClusteringAlgo::GetEps ( )

inline

Definition at line 58 of file ClusteringAlgo.hh.

  {
    return fEps;
  };

G4int ClusteringAlgo::GetMinPts ( )

inline

Definition at line 66 of file ClusteringAlgo.hh.

  {
    return fMinPts;
  };

G4double ClusteringAlgo::GetSPointsProb ( )

inline

Definition at line 74 of file ClusteringAlgo.hh.

  {
    return fSPointsProb;
  };

G4int ClusteringAlgo::GetSSB

(

)

const

Definition at line 279 of file ClusteringAlgo.cc.

{
  G4int nbSSB = 0;
  std::vector<SBPoint*>::const_iterator itSDSPt;
  for(itSDSPt = fpSetOfPoints.begin();
      itSDSPt != fpSetOfPoints.end();
      ++itSDSPt)
  {
    if(!(*itSDSPt)->HasCluster())
    {
      nbSSB++;
    }
  }
  return nbSSB;
}

Here is the caller graph for this function:

void ClusteringAlgo::Purge

(

)

Definition at line 349 of file ClusteringAlgo.cc.

{
  fNextSBPointID = 0;
  std::vector<ClusterSBPoints*>::iterator itCluster;
  for(itCluster = fpClusters.begin();
      itCluster != fpClusters.end();
      ++itCluster)
  {
    delete *itCluster;
    *itCluster = NULL;
  }  
  fpClusters.clear();
  std::vector<SBPoint*>::iterator itPt;
  for(itPt = fpSetOfPoints.begin();
      itPt != fpSetOfPoints.end();
      ++itPt)
  {
    delete *itPt;
    *itPt = NULL;
  }
  fpSetOfPoints.clear();
}

Here is the caller graph for this function:

void ClusteringAlgo::RegisterDamage	(	G4ThreeVector	pPos,
		G4double	pEdep
	)

Definition at line 105 of file ClusteringAlgo.cc.

{
  if(IsEdepSufficient(pEdep))
  {
    if(IsInSensitiveArea())
    {
      fpSetOfPoints.push_back( new SBPoint(fNextSBPointID++, pPos, pEdep));
    }
  }
}

map< G4int, G4int > ClusteringAlgo::RunClustering

(

)

Definition at line 118 of file ClusteringAlgo.cc.

{

  // quick sort style
  // create cluster
  std::vector<SBPoint*>::iterator itVisitorPt, itObservedPt;
  for(itVisitorPt = fpSetOfPoints.begin();
      itVisitorPt != fpSetOfPoints.end();
      ++itVisitorPt  )
  {
    itObservedPt = itVisitorPt;
    itObservedPt ++;
    while(itObservedPt != fpSetOfPoints.end() )
    {
      // if at least one of the two points has not a cluster
      if(!((*itObservedPt)->HasCluster() && (*itVisitorPt)->HasCluster()))
      {
        if(AreOnTheSameCluster( (*itObservedPt)->GetPosition(),
                                (*itVisitorPt)->GetPosition(),fEps))
        {
          // if none has a cluster. Create a new one
          if(!(*itObservedPt)->HasCluster() && !(*itVisitorPt)->HasCluster())
          {
            // create the new cluster
            set<SBPoint*> clusterPoints;
            clusterPoints.insert((*itObservedPt));
            clusterPoints.insert((*itVisitorPt));
            ClusterSBPoints* lCluster = new ClusterSBPoints(clusterPoints);
            assert(lCluster);
            fpClusters.push_back(lCluster);
            assert(lCluster);
            // inform SB point that they are part of a cluster now
            assert(lCluster);
            (*itObservedPt)->SetCluster(lCluster);
            assert(lCluster);
            (*itVisitorPt)->SetCluster(lCluster);
          }else
          {
            // add the point to the existing cluster
            if((*itObservedPt)->HasCluster())
            {
              (*itObservedPt)->GetCluster()->AddSBPoint((*itVisitorPt));
              (*itVisitorPt)->SetCluster((*itObservedPt)->GetCluster());
            }

            if((*itVisitorPt)->HasCluster())
            {
              (*itVisitorPt)->GetCluster()->AddSBPoint((*itObservedPt));
              (*itObservedPt)->SetCluster((*itVisitorPt)->GetCluster());
            }
          }
        }
      }
      ++itObservedPt;
    }
  }

  // associate isolated points and merge clusters
  IncludeUnassociatedPoints();
  MergeClusters();

  // return cluster size distribution
  return GetClusterSizeDistribution();
}

Here is the call graph for this function:

void ClusteringAlgo::SetEMaxDamage ( G4double  val )

inline

Definition at line 94 of file ClusteringAlgo.hh.

  {
    fEMaxDamage=val;
  };

Here is the caller graph for this function:

void ClusteringAlgo::SetEMinDamage ( G4double  val )

inline

Definition at line 86 of file ClusteringAlgo.hh.

  {
    fEMinDamage=val;
  };

Here is the caller graph for this function:

void ClusteringAlgo::SetEps ( G4double  val )

inline

Definition at line 62 of file ClusteringAlgo.hh.

  {
    fEps=val;
  };

Here is the caller graph for this function:

void ClusteringAlgo::SetMinPts ( G4int  val )

inline

Definition at line 70 of file ClusteringAlgo.hh.

  {
    fMinPts=val;
  };

Here is the caller graph for this function:

void ClusteringAlgo::SetSPointsProb ( G4double  val )

inline

Definition at line 78 of file ClusteringAlgo.hh.

  {
    fSPointsProb=val;
  };

Here is the caller graph for this function:

---

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

• source/geant4.10.03.p02/examples/extended/medical/dna/clustering/include/ClusteringAlgo.hh
• source/geant4.10.03.p02/examples/extended/medical/dna/clustering/src/ClusteringAlgo.cc