VertexBasedPfoRecoveryAlgorithm class. More...

#include <VertexBasedPfoRecoveryAlgorithm.h>

Inheritance diagram for lar_content::VertexBasedPfoRecoveryAlgorithm:

Classes
class	Particle
	Particle class. More...

Public Member Functions
	VertexBasedPfoRecoveryAlgorithm ()
	Default constructor. More...

Private Types
typedef std::vector< Particle >	ParticleList

Private Member Functions
pandora::StatusCode	Run ()

pandora::StatusCode	GetAvailableClusters (const pandora::StringVector inputClusterListName, pandora::ClusterVector &clusterVector) const
	Get a vector of available clusters. More...

void	BuildSlidingFitResultMap (const pandora::ClusterVector &clusterVector, TwoDSlidingFitResultMap &slidingFitResultMap) const
	Build the map of sliding fit results. More...

void	SelectVertexClusters (const pandora::Vertex *const pVertex, const TwoDSlidingFitResultMap &slidingFitResultMap, const pandora::ClusterVector &inputClusters, pandora::ClusterVector &outputClusters) const
	Select clusters in proximity to reconstructed vertex. More...

void	MatchThreeViews (const pandora::Vertex *const pVertex, const TwoDSlidingFitResultMap &slidingFitResultMap, const pandora::ClusterVector &selectedClusters, pandora::ClusterSet &vetoList, ParticleList &particleList) const
	Match clusters from three views. More...

void	MatchTwoViews (const pandora::Vertex *const pVertex, const TwoDSlidingFitResultMap &slidingFitResultMap, const pandora::ClusterVector &selectedClusters, pandora::ClusterSet &vetoList, ParticleList &particleList) const
	Match clusters from two views. More...

void	GetBestChi2 (const pandora::Vertex const pVertex, const TwoDSlidingFitResultMap &slidingFitResultMap, const pandora::ClusterVector &clusters1, const pandora::ClusterVector &clusters2, const pandora::ClusterVector &clusters3, const pandora::Cluster &pBestCluster1, const pandora::Cluster &pBestCluster2, const pandora::Cluster &pBestCluster3, float &chi2) const
	Get best-matched triplet of clusters from a set of input cluster vectors. More...

void	GetBestChi2 (const pandora::Vertex const pVertex, const TwoDSlidingFitResultMap &slidingFitResultMap, const pandora::ClusterVector &clusters1, const pandora::ClusterVector &clusters2, const pandora::Cluster &pBestCluster1, const pandora::Cluster *&pBestCluster2, float &chi2) const
	Get best-matched pair of clusters from a set of input cluster vectors. More...

float	GetChi2 (const pandora::Vertex *const pVertex, const LArPointingCluster &pointingCluster1, const LArPointingCluster &pointingCluster2) const
	Merge two pointing clusters and return chi-squared metric giving consistency of matching. More...

float	GetChi2 (const pandora::Vertex *const pVertex, const LArPointingCluster &pointingCluster1, const LArPointingCluster &pointingCluster2, const LArPointingCluster &pointingCluster3) const
	Merge three clusters between views and return chi-squared metric giving consistency of matching. More...

void	SelectAvailableClusters (const pandora::ClusterSet &vetoList, const pandora::ClusterVector &inputVector, pandora::ClusterVector &outputVector) const
	Select cluster which haven't been vetoed. More...

void	SelectClusters (const pandora::HitType hitType, const pandora::ClusterVector &inputVector, pandora::ClusterVector &outputVector) const
	Select clusters of a specified hit type. More...

const LArPointingCluster::Vertex &	GetInnerVertex (const pandora::CartesianVector &vertex, const LArPointingCluster &cluster) const
	Find nearest end of pointing cluster to a specified position vector. More...

const LArPointingCluster::Vertex &	GetOuterVertex (const pandora::CartesianVector &vertex, const LArPointingCluster &cluster) const
	Find furthest end of pointing cluster from a specified position vector. More...

void	BuildParticles (const ParticleList &particleList)
	Build particle flow objects from matched clusters. More...

pandora::StatusCode	ReadSettings (const pandora::TiXmlHandle xmlHandle)

Private Attributes
pandora::StringVector	m_inputClusterListNames
	The list of input cluster list names. More...

std::string	m_outputPfoListName
	The name of the output pfo list. More...

unsigned int	m_slidingFitHalfWindow

float	m_maxLongitudinalDisplacement

float	m_maxTransverseDisplacement

float	m_twoViewChi2Cut

float	m_threeViewChi2Cut

Detailed Description

VertexBasedPfoRecoveryAlgorithm class.

Definition at line 22 of file VertexBasedPfoRecoveryAlgorithm.h.

Member Typedef Documentation

typedef std::vector<Particle> lar_content::VertexBasedPfoRecoveryAlgorithm::ParticleList

private

Definition at line 53 of file VertexBasedPfoRecoveryAlgorithm.h.

Constructor & Destructor Documentation

lar_content::VertexBasedPfoRecoveryAlgorithm::VertexBasedPfoRecoveryAlgorithm ( )

Default constructor.

Definition at line 22 of file VertexBasedPfoRecoveryAlgorithm.cc.

                                                                  :
     m_slidingFitHalfWindow(10),
     m_maxLongitudinalDisplacement(5.f),
     m_maxTransverseDisplacement(2.f),
     m_twoViewChi2Cut(5.f),
     m_threeViewChi2Cut(5.f)
 {
 }

Member Function Documentation

void lar_content::VertexBasedPfoRecoveryAlgorithm::BuildParticles ( const ParticleList & particleList )

private

Build particle flow objects from matched clusters.

Parameters

particleList the input list of matched clusters

Definition at line 469 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     if (particleList.empty())
         return;
 
     const PfoList *pPfoList = NULL;
     std::string pfoListName;
     PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::CreateTemporaryListAndSetCurrent(*this, pPfoList, pfoListName));
 
     for (ParticleList::const_iterator iter = particleList.begin(), iterEnd = particleList.end(); iter != iterEnd; ++iter)
     {
         const Particle &particle = *iter;
 
         ClusterList clusterList;
         const Cluster *const pClusterU = particle.m_pClusterU;
         const Cluster *const pClusterV = particle.m_pClusterV;
         const Cluster *const pClusterW = particle.m_pClusterW;
 
         const bool isAvailableU((NULL != pClusterU) ? pClusterU->IsAvailable() : true);
         const bool isAvailableV((NULL != pClusterV) ? pClusterV->IsAvailable() : true);
         const bool isAvailableW((NULL != pClusterW) ? pClusterW->IsAvailable() : true);
 
         if (!(isAvailableU && isAvailableV && isAvailableW))
             throw StatusCodeException(STATUS_CODE_FAILURE);
 
         if (pClusterU)
             clusterList.push_back(pClusterU);
         if (pClusterV)
             clusterList.push_back(pClusterV);
         if (pClusterW)
             clusterList.push_back(pClusterW);
 
         // TODO Correct these placeholder parameters
         PandoraContentApi::ParticleFlowObject::Parameters pfoParameters;
         pfoParameters.m_particleId = MU_MINUS; // TRACK
         pfoParameters.m_charge = PdgTable::GetParticleCharge(pfoParameters.m_particleId.Get());
         pfoParameters.m_mass = PdgTable::GetParticleMass(pfoParameters.m_particleId.Get());
         pfoParameters.m_energy = 0.f;
         pfoParameters.m_momentum = CartesianVector(0.f, 0.f, 0.f);
         pfoParameters.m_clusterList = clusterList;
 
         const ParticleFlowObject *pPfo(NULL);
         PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::ParticleFlowObject::Create(*this, pfoParameters, pPfo));
     }
 
     if (!pPfoList->empty())
         PANDORA_THROW_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::SaveList<Pfo>(*this, m_outputPfoListName));
 }

void lar_content::VertexBasedPfoRecoveryAlgorithm::BuildSlidingFitResultMap	(	const pandora::ClusterVector &	clusterVector,
		TwoDSlidingFitResultMap &	slidingFitResultMap
	)		const

private

Build the map of sliding fit results.

Parameters

clusterVector	the vector of selected clusters
halfWindowLayers	the half-window to use for the sliding fits
slidingFitResultMap	the sliding fit result map

Definition at line 112 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     const float slidingFitPitch(LArGeometryHelper::GetWireZPitch(this->GetPandora()));
 
     for (ClusterVector::const_iterator iter = clusterVector.begin(), iterEnd = clusterVector.end(); iter != iterEnd; ++iter)
     {
         if (slidingFitResultMap.end() == slidingFitResultMap.find(*iter))
         {
             try
             {
                 const TwoDSlidingFitResult slidingFitResult(*iter, m_slidingFitHalfWindow, slidingFitPitch);
                 const LArPointingCluster pointingCluster(slidingFitResult);
 
                 if (pointingCluster.GetLengthSquared() < std::numeric_limits<float>::epsilon())
                     continue;
 
                 if (!slidingFitResultMap.insert(TwoDSlidingFitResultMap::value_type(*iter, slidingFitResult)).second)
                     throw StatusCodeException(STATUS_CODE_FAILURE);
             }
             catch (StatusCodeException &statusCodeException)
             {
                 if (STATUS_CODE_FAILURE == statusCodeException.GetStatusCode())
                     throw statusCodeException;
             }
         }
     }
 }

StatusCode lar_content::VertexBasedPfoRecoveryAlgorithm::GetAvailableClusters	(	const pandora::StringVector	inputClusterListName,
		pandora::ClusterVector &	clusterVector
	)		const

private

Get a vector of available clusters.

Parameters

inputClusterListName	the input vector of the cluster list names
clusterVector	the output vector of available clusters

Definition at line 75 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     for (StringVector::const_iterator iter = inputClusterListNames.begin(), iterEnd = inputClusterListNames.end(); iter != iterEnd; ++iter)
     {
         const ClusterList *pClusterList(NULL);
         PANDORA_THROW_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetList(*this, *iter, pClusterList));
 
         if (NULL == pClusterList)
         {
             if (PandoraContentApi::GetSettings(*this)->ShouldDisplayAlgorithmInfo())
                 std::cout << "VertexBasedPfoRecoveryAlgorithm: could not find cluster list " << *iter << std::endl;
             continue;
         }
 
         for (ClusterList::const_iterator cIter = pClusterList->begin(), cIterEnd = pClusterList->end(); cIter != cIterEnd; ++cIter)
         {
             const Cluster *const pCluster = *cIter;
 
             if (!pCluster->IsAvailable())
                 continue;
 
             if (pCluster->GetNCaloHits() <= 1)
                 continue;
 
             if (TPC_3D == LArClusterHelper::GetClusterHitType(pCluster))
                 continue;
 
             clusterVector.push_back(pCluster);
         }
     }
 
     std::sort(clusterVector.begin(), clusterVector.end(), LArClusterHelper::SortByNHits);
 
     return STATUS_CODE_SUCCESS;
 }

void lar_content::VertexBasedPfoRecoveryAlgorithm::GetBestChi2	(	const pandora::Vertex *const	pVertex,
		const TwoDSlidingFitResultMap &	slidingFitResultMap,
		const pandora::ClusterVector &	clusters1,
		const pandora::ClusterVector &	clusters2,
		const pandora::ClusterVector &	clusters3,
		const pandora::Cluster *&	pBestCluster1,
		const pandora::Cluster *&	pBestCluster2,
		const pandora::Cluster *&	pBestCluster3,
		float &	chi2
	)		const

private

Get best-matched triplet of clusters from a set of input cluster vectors.

Parameters

pVertex	the input vertex
slidingFitResultMap	the mapping between clusters and sliding fit results
clusters1	the clusters in the first view
clusters2	the clusters in the second view
clusters3	the clusters in the third view
pBestCluster1	the best-matched cluster from the first view
pBestCluster2	the best-matched cluster from the second view
pBestCluster3	the best-matched cluster from the third view
chi2	the chi-squared metric from the best match

void lar_content::VertexBasedPfoRecoveryAlgorithm::GetBestChi2	(	const pandora::Vertex *const	pVertex,
		const TwoDSlidingFitResultMap &	slidingFitResultMap,
		const pandora::ClusterVector &	clusters1,
		const pandora::ClusterVector &	clusters2,
		const pandora::Cluster *&	pBestCluster1,
		const pandora::Cluster *&	pBestCluster2,
		float &	chi2
	)		const

private

Get best-matched pair of clusters from a set of input cluster vectors.

Parameters

pVertex	the input vertex
slidingFitResultMap	the mapping between clusters and sliding fit results
clusters1	the clusters in the first view
clusters2	the clusters in the second view
pBestCluster1	the best-matched cluster from the first view
pBestCluster2	the best-matched cluster from the second view
chi2	the chi-squared metric from the best match

float lar_content::VertexBasedPfoRecoveryAlgorithm::GetChi2	(	const pandora::Vertex *const	pVertex,
		const LArPointingCluster &	pointingCluster1,
		const LArPointingCluster &	pointingCluster2
	)		const

private

Merge two pointing clusters and return chi-squared metric giving consistency of matching.

Parameters

pVertex	the input vertex
pointingCluster1	the first pointing cluster
pointingCluster2	the second pointing cluster

float lar_content::VertexBasedPfoRecoveryAlgorithm::GetChi2	(	const pandora::Vertex *const	pVertex,
		const LArPointingCluster &	pointingCluster1,
		const LArPointingCluster &	pointingCluster2,
		const LArPointingCluster &	pointingCluster3
	)		const

private

Merge three clusters between views and return chi-squared metric giving consistency of matching.

Parameters

pVertex	the input vertex
pointingCluster1	the first pointing cluster
pointingCluster2	the second pointing cluster
pointingCluster3	the third pointing cluster

const LArPointingCluster::Vertex & lar_content::VertexBasedPfoRecoveryAlgorithm::GetInnerVertex	(	const pandora::CartesianVector &	vertex,
		const LArPointingCluster &	cluster
	)		const

private

Find nearest end of pointing cluster to a specified position vector.

Parameters

vertex	the input position
cluster	the input cluster

Definition at line 444 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     const float innerDistance((vertex - cluster.GetInnerVertex().GetPosition()).GetMagnitudeSquared());
     const float outerDistance((vertex - cluster.GetOuterVertex().GetPosition()).GetMagnitudeSquared());
 
     if (innerDistance < outerDistance)
         return cluster.GetInnerVertex();
     else
         return cluster.GetOuterVertex();
 }

const LArPointingCluster::Vertex & lar_content::VertexBasedPfoRecoveryAlgorithm::GetOuterVertex	(	const pandora::CartesianVector &	vertex,
		const LArPointingCluster &	cluster
	)		const

private

Find furthest end of pointing cluster from a specified position vector.

Parameters

vertex	the input position
cluster	the input pointing cluster

Definition at line 457 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     const LArPointingCluster::Vertex &innerVertex = this->GetInnerVertex(vertex, cluster);
 
     if (innerVertex.IsInnerVertex())
         return cluster.GetOuterVertex();
     else
         return cluster.GetInnerVertex();
 }

void lar_content::VertexBasedPfoRecoveryAlgorithm::MatchThreeViews	(	const pandora::Vertex *const	pVertex,
		const TwoDSlidingFitResultMap &	slidingFitResultMap,
		const pandora::ClusterVector &	selectedClusters,
		pandora::ClusterSet &	vetoList,
		ParticleList &	particleList
	)		const

private

Match clusters from three views.

Parameters

pVertex	the input vertex
slidingFitResultMap	the mapping between clusters and sliding fit results
selectedClusters	the input vertex clusters
vetoList	the list of matched clusters
particleList	the output list of matched clusters

Definition at line 184 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     while (true)
     {
         ClusterVector availableClusters, clustersU, clustersV, clustersW;
         this->SelectAvailableClusters(vetoList, inputClusters, availableClusters);
         this->SelectClusters(TPC_VIEW_U, availableClusters, clustersU);
         this->SelectClusters(TPC_VIEW_V, availableClusters, clustersV);
         this->SelectClusters(TPC_VIEW_W, availableClusters, clustersW);
 
         float chi2(m_threeViewChi2Cut);
         const Cluster *pCluster1(NULL);
         const Cluster *pCluster2(NULL);
         const Cluster *pCluster3(NULL);
 
         this->GetBestChi2(pVertex, slidingFitResultMap, clustersU, clustersV, clustersW, pCluster1, pCluster2, pCluster3, chi2);
 
         if (NULL == pCluster1 || NULL == pCluster2 || NULL == pCluster3)
             return;
 
         const HitType hitType1(LArClusterHelper::GetClusterHitType(pCluster1));
         const HitType hitType2(LArClusterHelper::GetClusterHitType(pCluster2));
         const HitType hitType3(LArClusterHelper::GetClusterHitType(pCluster3));
 
         const Cluster *const pClusterU(
             (TPC_VIEW_U == hitType1) ? pCluster1 : (TPC_VIEW_U == hitType2) ? pCluster2 : (TPC_VIEW_U == hitType3) ? pCluster3 : NULL);
         const Cluster *const pClusterV(
             (TPC_VIEW_V == hitType1) ? pCluster1 : (TPC_VIEW_V == hitType2) ? pCluster2 : (TPC_VIEW_V == hitType3) ? pCluster3 : NULL);
         const Cluster *const pClusterW(
             (TPC_VIEW_W == hitType1) ? pCluster1 : (TPC_VIEW_W == hitType2) ? pCluster2 : (TPC_VIEW_W == hitType3) ? pCluster3 : NULL);
 
         particleList.push_back(Particle(pClusterU, pClusterV, pClusterW));
 
         vetoList.insert(pCluster1);
         vetoList.insert(pCluster2);
         vetoList.insert(pCluster3);
     }
 }

void lar_content::VertexBasedPfoRecoveryAlgorithm::MatchTwoViews	(	const pandora::Vertex *const	pVertex,
		const TwoDSlidingFitResultMap &	slidingFitResultMap,
		const pandora::ClusterVector &	selectedClusters,
		pandora::ClusterSet &	vetoList,
		ParticleList &	particleList
	)		const

private

Match clusters from two views.

Parameters

pVertex	the input vertex
slidingFitResultMap	the mapping between clusters and sliding fit results
selectedClusters	the input vertex clusters
vetoList	the list of matched clusters
particleList	the output list of matched clusters

Definition at line 226 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     while (true)
     {
         ClusterVector availableClusters, clustersU, clustersV, clustersW;
         this->SelectAvailableClusters(vetoList, inputClusters, availableClusters);
         this->SelectClusters(TPC_VIEW_U, availableClusters, clustersU);
         this->SelectClusters(TPC_VIEW_V, availableClusters, clustersV);
         this->SelectClusters(TPC_VIEW_W, availableClusters, clustersW);
 
         float chi2(m_twoViewChi2Cut);
         const Cluster *pCluster1(NULL);
         const Cluster *pCluster2(NULL);
 
         this->GetBestChi2(pVertex, slidingFitResultMap, clustersU, clustersV, pCluster1, pCluster2, chi2);
         this->GetBestChi2(pVertex, slidingFitResultMap, clustersV, clustersW, pCluster1, pCluster2, chi2);
         this->GetBestChi2(pVertex, slidingFitResultMap, clustersW, clustersU, pCluster1, pCluster2, chi2);
 
         if (NULL == pCluster1 || NULL == pCluster2)
             return;
 
         const HitType hitType1(LArClusterHelper::GetClusterHitType(pCluster1));
         const HitType hitType2(LArClusterHelper::GetClusterHitType(pCluster2));
 
         const Cluster *const pClusterU((TPC_VIEW_U == hitType1) ? pCluster1 : (TPC_VIEW_U == hitType2) ? pCluster2 : NULL);
         const Cluster *const pClusterV((TPC_VIEW_V == hitType1) ? pCluster1 : (TPC_VIEW_V == hitType2) ? pCluster2 : NULL);
         const Cluster *const pClusterW((TPC_VIEW_W == hitType1) ? pCluster1 : (TPC_VIEW_W == hitType2) ? pCluster2 : NULL);
 
         particleList.push_back(Particle(pClusterU, pClusterV, pClusterW));
 
         vetoList.insert(pCluster1);
         vetoList.insert(pCluster2);
     }
 }

StatusCode lar_content::VertexBasedPfoRecoveryAlgorithm::ReadSettings ( const pandora::TiXmlHandle xmlHandle )

private

Definition at line 538 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, XmlHelper::ReadVectorOfValues(xmlHandle, "InputClusterListNames", m_inputClusterListNames));
 
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, XmlHelper::ReadValue(xmlHandle, "OutputPfoListName", m_outputPfoListName));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "SlidingFitHalfWindow", m_slidingFitHalfWindow));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MaxLongitudinalDisplacement", m_maxLongitudinalDisplacement));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MaxTransverseDisplacement", m_maxTransverseDisplacement));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "TwoViewChi2Cut", m_twoViewChi2Cut));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "ThreeViewChi2Cut", m_threeViewChi2Cut));
 
     return STATUS_CODE_SUCCESS;
 }

StatusCode lar_content::VertexBasedPfoRecoveryAlgorithm::Run ( )

private

Definition at line 33 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     const VertexList *pVertexList = NULL;
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetCurrentList(*this, pVertexList));
 
     const Vertex *const pSelectedVertex(
         (pVertexList && (pVertexList->size() == 1) && (VERTEX_3D == (*(pVertexList->begin()))->GetVertexType())) ? *(pVertexList->begin()) : NULL);
 
     if (!pSelectedVertex)
     {
         if (PandoraContentApi::GetSettings(*this)->ShouldDisplayAlgorithmInfo())
             std::cout << "VertexBasedPfoRecoveryAlgorithm: unable to find vertex in current list " << std::endl;
 
         return STATUS_CODE_SUCCESS;
     }
 
     // Get the available clusters from each view
     ClusterVector availableClusters;
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, this->GetAvailableClusters(m_inputClusterListNames, availableClusters));
 
     // Build a set of sliding fit results
     TwoDSlidingFitResultMap slidingFitResultMap;
     this->BuildSlidingFitResultMap(availableClusters, slidingFitResultMap);
 
     // Select seed clusters (adjacent to vertex)
     ClusterVector selectedClusters;
     this->SelectVertexClusters(pSelectedVertex, slidingFitResultMap, availableClusters, selectedClusters);
 
     // Match the cluster end points
     ClusterSet vetoList;
     ParticleList particleList;
     this->MatchThreeViews(pSelectedVertex, slidingFitResultMap, selectedClusters, vetoList, particleList);
     this->MatchTwoViews(pSelectedVertex, slidingFitResultMap, selectedClusters, vetoList, particleList);
 
     // Build new particles
     this->BuildParticles(particleList);
 
     return STATUS_CODE_SUCCESS;
 }

void lar_content::VertexBasedPfoRecoveryAlgorithm::SelectAvailableClusters	(	const pandora::ClusterSet &	vetoList,
		const pandora::ClusterVector &	inputVector,
		pandora::ClusterVector &	outputVector
	)		const

private

Select cluster which haven't been vetoed.

Parameters

vetoList	the list of vetoed clusters
inputVector	the input vector of clusters
outputVector	the output vector of clusters

Definition at line 422 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     for (ClusterVector::const_iterator iter = inputVector.begin(), iterEnd = inputVector.end(); iter != iterEnd; ++iter)
     {
         if (0 == vetoList.count(*iter))
             outputVector.push_back(*iter);
     }
 }

void lar_content::VertexBasedPfoRecoveryAlgorithm::SelectClusters	(	const pandora::HitType	hitType,
		const pandora::ClusterVector &	inputVector,
		pandora::ClusterVector &	outputVector
	)		const

private

Select clusters of a specified hit type.

Parameters

hitType	the specified hit type
inputVector	the input vector of clusters
outputVector	the output vector of clusters

Definition at line 433 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     for (ClusterVector::const_iterator iter = inputVector.begin(), iterEnd = inputVector.end(); iter != iterEnd; ++iter)
     {
         if (hitType == LArClusterHelper::GetClusterHitType(*iter))
             outputVector.push_back(*iter);
     }
 }

void lar_content::VertexBasedPfoRecoveryAlgorithm::SelectVertexClusters	(	const pandora::Vertex *const	pVertex,
		const TwoDSlidingFitResultMap &	slidingFitResultMap,
		const pandora::ClusterVector &	inputClusters,
		pandora::ClusterVector &	outputClusters
	)		const

private

Select clusters in proximity to reconstructed vertex.

Parameters

pVertex	the input vertex
slidingFitResultMap	the mapping between clusters and sliding fit results
inputClusters	the input vector of clusters
outputClusters	the output vector of clusters

Definition at line 142 of file VertexBasedPfoRecoveryAlgorithm.cc.

 {
     const CartesianVector vertexU(LArGeometryHelper::ProjectPosition(this->GetPandora(), pVertex->GetPosition(), TPC_VIEW_U));
     const CartesianVector vertexV(LArGeometryHelper::ProjectPosition(this->GetPandora(), pVertex->GetPosition(), TPC_VIEW_V));
     const CartesianVector vertexW(LArGeometryHelper::ProjectPosition(this->GetPandora(), pVertex->GetPosition(), TPC_VIEW_W));
 
     for (ClusterVector::const_iterator cIter = inputClusters.begin(), cIterEnd = inputClusters.end(); cIter != cIterEnd; ++cIter)
     {
         const Cluster *const pCluster = *cIter;
         const HitType hitType(LArClusterHelper::GetClusterHitType(pCluster));
 
         if (TPC_3D == hitType)
             continue;
 
         const CartesianVector vertexPosition((TPC_VIEW_U == hitType) ? vertexU : (TPC_VIEW_V == hitType) ? vertexV : vertexW);
 
         TwoDSlidingFitResultMap::const_iterator sIter = slidingFitResultMap.find(pCluster);
         if (slidingFitResultMap.end() == sIter)
             continue;
 
         const TwoDSlidingFitResult &slidingFitResult = sIter->second;
         const LArPointingCluster pointingCluster(slidingFitResult);
 
         for (unsigned int iVtx = 0; iVtx < 2; ++iVtx)
         {
             const LArPointingCluster::Vertex &pointingVertex((0 == iVtx) ? pointingCluster.GetInnerVertex() : pointingCluster.GetOuterVertex());
 
             float rL(0.f), rT(0.f);
             LArPointingClusterHelper::GetImpactParameters(pointingVertex, vertexPosition, rL, rT);
 
             if (rL > -1.f && rL < m_maxLongitudinalDisplacement && rT < m_maxTransverseDisplacement)
             {
                 outputClusters.push_back(pCluster);
                 break;
             }
         }
     }
 }