SlidingConePfoMopUpAlgorithm class. More...

#include <SlidingConePfoMopUpAlgorithm.h>

Inheritance diagram for lar_content::SlidingConePfoMopUpAlgorithm:

Classes
class	ClusterMerge
	ClusterMerge class. More...

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

Public Member Functions inherited from lar_content::PfoMopUpBaseAlgorithm
virtual void	MergeAndDeletePfos (const pandora::ParticleFlowObject const pPfoToEnlarge, const pandora::ParticleFlowObject const pPfoToDelete) const
	Merge and delete a pair of pfos, with a specific set of conventions for cluster merging, vertex use, etc. More...

Public Member Functions inherited from lar_content::MopUpBaseAlgorithm
template<typename T >
const std::string	GetListName (const T *const pT) const
	Find the name of the list hosting a specific object. More...

Private Types
typedef std::vector< ClusterMerge >	ClusterMergeList

typedef std::unordered_map < const pandora::Cluster , const pandora::ParticleFlowObject >	ClusterToPfoMap

typedef std::unordered_map < const pandora::Cluster *, ClusterMergeList >	ClusterMergeMap

typedef std::unordered_map < const pandora::Cluster *, bool >	VertexAssociationMap

typedef std::unordered_map < const pandora::Cluster , const pandora::Cluster >	ClusterReplacementMap

Private Member Functions
pandora::StatusCode	Run ()

void	GetInteractionVertex (const pandora::Vertex *&pVertex) const
	Get the neutrino interaction vertex if it is available and if the algorithm is configured to do so. More...

void	GetThreeDClusters (pandora::ClusterVector &clusters3D, ClusterToPfoMap &clusterToPfoMap) const
	Get all 3d clusters contained in the input pfo lists and a mapping from clusters to pfos. More...

void	GetClusterMergeMap (const pandora::Vertex *const pVertex, const pandora::ClusterVector &clusters3D, const ClusterToPfoMap &clusterToPfoMap, ClusterMergeMap &clusterMergeMap) const
	Get the cluster merge map describing all potential 3d cluster merges. More...

bool	IsVertexAssociated (const pandora::Cluster const pCluster, const pandora::Vertex const pVertex, VertexAssociationMap &vertexAssociationMap, const ThreeDSlidingFitResult *const pSlidingFitResult=nullptr) const
	Whether a 3D cluster is nodally associated with a provided vertex. More...

bool	IsVertexAssociated (const pandora::Cluster const pCluster, const pandora::CartesianVector &vertexPosition, const ThreeDSlidingFitResult const pSlidingFitResult=nullptr) const
	Whether a 3D cluster is nodally associated with a provided vertex. More...

bool	MakePfoMerges (const ClusterToPfoMap &clusterToPfoMap, const ClusterMergeMap &clusterMergeMap) const
	Make pfo merges based on the provided cluster merge map. More...

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

Private Attributes
pandora::StringVector	m_inputPfoListNames
	The input pfo list names. More...

bool	m_useVertex
	Whether to use the interaction vertex to select useful cone directions. More...

unsigned int	m_maxIterations
	The maximum allowed number of algorithm iterations. More...

unsigned int	m_maxHitsToConsider3DTrack
	The maximum number of hits in a 3d track cluster to warrant inclusion in algorithm. More...

unsigned int	m_minHitsToConsider3DShower
	The minimum number of hits in a 3d shower cluster to attempt cone fits. More...

unsigned int	m_halfWindowLayers
	The number of layers to use for half-window of sliding fit. More...

unsigned int	m_nConeFitLayers
	The number of layers over which to sum fitted direction to obtain cone fit. More...

unsigned int	m_nConeFits
	The number of cone fits to perform, spread roughly uniformly along the shower length. More...

float	m_coneLengthMultiplier
	The cone length multiplier to use when calculating bounded cluster fractions. More...

float	m_maxConeLength
	The maximum allowed cone length to use when calculating bounded cluster fractions. More...

float	m_coneTanHalfAngle1
	The cone tan half angle to use when calculating bounded cluster fractions 1. More...

float	m_coneBoundedFraction1
	The minimum cluster bounded fraction for association 1. More...

float	m_coneTanHalfAngle2
	The cone tan half angle to use when calculating bounded cluster fractions 2. More...

float	m_coneBoundedFraction2
	The minimum cluster bounded fraction for association 2. More...

float	m_minVertexLongitudinalDistance
	Vertex association check: min longitudinal distance cut. More...

float	m_maxVertexTransverseDistance
	Vertex association check: max transverse distance cut. More...

Additional Inherited Members
Static Public Member Functions inherited from lar_content::PfoMopUpBaseAlgorithm
static const pandora::Cluster *	GetParentCluster (const pandora::ClusterList &clusterList, const pandora::HitType hitType)
	Select the parent cluster (same hit type and most hits) using a provided cluster list and hit type. More...

Protected Attributes inherited from lar_content::MopUpBaseAlgorithm
pandora::StringVector	m_daughterListNames
	The list of potential daughter object list names. More...

Detailed Description

SlidingConePfoMopUpAlgorithm class.

Definition at line 21 of file SlidingConePfoMopUpAlgorithm.h.

Member Typedef Documentation

typedef std::vector<ClusterMerge> lar_content::SlidingConePfoMopUpAlgorithm::ClusterMergeList

private

Definition at line 81 of file SlidingConePfoMopUpAlgorithm.h.

typedef std::unordered_map<const pandora::Cluster *, ClusterMergeList> lar_content::SlidingConePfoMopUpAlgorithm::ClusterMergeMap

private

Definition at line 102 of file SlidingConePfoMopUpAlgorithm.h.

typedef std::unordered_map<const pandora::Cluster *, const pandora::Cluster *> lar_content::SlidingConePfoMopUpAlgorithm::ClusterReplacementMap

private

Definition at line 154 of file SlidingConePfoMopUpAlgorithm.h.

typedef std::unordered_map<const pandora::Cluster *, const pandora::ParticleFlowObject *> lar_content::SlidingConePfoMopUpAlgorithm::ClusterToPfoMap

private

Definition at line 92 of file SlidingConePfoMopUpAlgorithm.h.

typedef std::unordered_map<const pandora::Cluster *, bool> lar_content::SlidingConePfoMopUpAlgorithm::VertexAssociationMap

private

Definition at line 115 of file SlidingConePfoMopUpAlgorithm.h.

Constructor & Destructor Documentation

lar_content::SlidingConePfoMopUpAlgorithm::SlidingConePfoMopUpAlgorithm ( )

Default constructor.

Definition at line 25 of file SlidingConePfoMopUpAlgorithm.cc.

                                                            :
     m_useVertex(true),
     m_maxIterations(1000),
     m_maxHitsToConsider3DTrack(100),
     m_minHitsToConsider3DShower(20),
     m_halfWindowLayers(20),
     m_nConeFitLayers(20),
     m_nConeFits(5),
     m_coneLengthMultiplier(7.f),
     m_maxConeLength(126.f),
     m_coneTanHalfAngle1(0.5f),
     m_coneBoundedFraction1(0.5f),
     m_coneTanHalfAngle2(0.75f),
     m_coneBoundedFraction2(0.75f),
     m_minVertexLongitudinalDistance(-2.5f),
     m_maxVertexTransverseDistance(3.5f)
 {
 }

Member Function Documentation

void lar_content::SlidingConePfoMopUpAlgorithm::GetClusterMergeMap	(	const pandora::Vertex *const	pVertex,
		const pandora::ClusterVector &	clusters3D,
		const ClusterToPfoMap &	clusterToPfoMap,
		ClusterMergeMap &	clusterMergeMap
	)		const

private

Get the cluster merge map describing all potential 3d cluster merges.

Parameters

pVertex	the neutrino interaction vertex, if available
clusters3D	the sorted list of 3d clusters
clusterToPfoMap	the mapping from 3d cluster to pfo
clusterMergeMap	to receive the populated cluster merge map

Definition at line 124 of file SlidingConePfoMopUpAlgorithm.cc.

 {
     VertexAssociationMap vertexAssociationMap;
     const float layerPitch(LArGeometryHelper::GetWireZPitch(this->GetPandora()));
 
     for (const Cluster *const pShowerCluster : clusters3D)
     {
         if ((pShowerCluster->GetNCaloHits() < m_minHitsToConsider3DShower) || !LArPfoHelper::IsShower(clusterToPfoMap.at(pShowerCluster)))
             continue;
 
         float coneLength(0.f);
         SimpleConeList simpleConeList;
         bool isShowerVertexAssociated(false);
 
         try
         {
             const ThreeDSlidingConeFitResult slidingConeFitResult3D(pShowerCluster, m_halfWindowLayers, layerPitch);
 
             const CartesianVector &minLayerPosition(slidingConeFitResult3D.GetSlidingFitResult().GetGlobalMinLayerPosition());
             const CartesianVector &maxLayerPosition(slidingConeFitResult3D.GetSlidingFitResult().GetGlobalMaxLayerPosition());
             coneLength = std::min(m_coneLengthMultiplier * (maxLayerPosition - minLayerPosition).GetMagnitude(), m_maxConeLength);
 
             const float vertexToMinLayer(!pVertex ? 0.f : (pVertex->GetPosition() - minLayerPosition).GetMagnitude());
             const float vertexToMaxLayer(!pVertex ? 0.f : (pVertex->GetPosition() - maxLayerPosition).GetMagnitude());
             const ConeSelection coneSelection(
                 !pVertex ? CONE_BOTH_DIRECTIONS : (vertexToMaxLayer > vertexToMinLayer) ? CONE_FORWARD_ONLY : CONE_BACKWARD_ONLY);
 
             slidingConeFitResult3D.GetSimpleConeList(m_nConeFitLayers, m_nConeFits, coneSelection, simpleConeList);
             isShowerVertexAssociated =
                 this->IsVertexAssociated(pShowerCluster, pVertex, vertexAssociationMap, &(slidingConeFitResult3D.GetSlidingFitResult()));
         }
         catch (const StatusCodeException &)
         {
             continue;
         }
 
         for (const Cluster *const pNearbyCluster : clusters3D)
         {
             if (pNearbyCluster == pShowerCluster)
                 continue;
 
             ClusterMerge bestClusterMerge(nullptr, 0.f, 0.f);
 
             for (const SimpleCone &simpleCone : simpleConeList)
             {
                 const float boundedFraction1(simpleCone.GetBoundedHitFraction(pNearbyCluster, coneLength, m_coneTanHalfAngle1));
                 const float boundedFraction2(simpleCone.GetBoundedHitFraction(pNearbyCluster, coneLength, m_coneTanHalfAngle2));
                 const ClusterMerge clusterMerge(pShowerCluster, boundedFraction1, boundedFraction2);
 
                 if (clusterMerge < bestClusterMerge)
                     bestClusterMerge = clusterMerge;
             }
 
             if (isShowerVertexAssociated && this->IsVertexAssociated(pNearbyCluster, pVertex, vertexAssociationMap))
                 continue;
 
             if (bestClusterMerge.GetParentCluster() && (bestClusterMerge.GetBoundedFraction1() > m_coneBoundedFraction1) &&
                 (bestClusterMerge.GetBoundedFraction2() > m_coneBoundedFraction2))
                 clusterMergeMap[pNearbyCluster].push_back(bestClusterMerge);
         }
     }
 
     for (ClusterMergeMap::value_type &mapEntry : clusterMergeMap)
         std::sort(mapEntry.second.begin(), mapEntry.second.end());
 }

void lar_content::SlidingConePfoMopUpAlgorithm::GetInteractionVertex ( const pandora::Vertex *& pVertex ) const

private

Get the neutrino interaction vertex if it is available and if the algorithm is configured to do so.

Parameters

pVertex to receive the neutrino interaction vertex

Definition at line 78 of file SlidingConePfoMopUpAlgorithm.cc.

 {
     if (!m_useVertex)
         return;
 
     const VertexList *pVertexList = nullptr;
     PANDORA_THROW_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetCurrentList(*this, pVertexList));
 
     pVertex =
         ((pVertexList && (pVertexList->size() == 1) && (VERTEX_3D == (*(pVertexList->begin()))->GetVertexType())) ? *(pVertexList->begin()) : nullptr);
 }

void lar_content::SlidingConePfoMopUpAlgorithm::GetThreeDClusters	(	pandora::ClusterVector &	clusters3D,
		ClusterToPfoMap &	clusterToPfoMap
	)		const

private

Get all 3d clusters contained in the input pfo lists and a mapping from clusters to pfos.

Parameters

clusters3D	to receive the sorted list of 3d clusters
clusterToPfoMap	to receive the mapping from 3d cluster to pfo

Definition at line 92 of file SlidingConePfoMopUpAlgorithm.cc.

 {
     for (const std::string &pfoListName : m_inputPfoListNames)
     {
         const PfoList *pPfoList(nullptr);
 
         if (STATUS_CODE_SUCCESS != PandoraContentApi::GetList(*this, pfoListName, pPfoList))
             continue;
 
         for (const Pfo *const pPfo : *pPfoList)
         {
             ClusterList pfoClusters3D;
             LArPfoHelper::GetThreeDClusterList(pPfo, pfoClusters3D);
 
             for (const Cluster *const pCluster3D : pfoClusters3D)
             {
                 if (LArPfoHelper::IsTrack(pPfo) && (pCluster3D->GetNCaloHits() > m_maxHitsToConsider3DTrack))
                     continue;
 
                 if (!clusterToPfoMap.insert(ClusterToPfoMap::value_type(pCluster3D, pPfo)).second)
                     throw StatusCodeException(STATUS_CODE_ALREADY_PRESENT);
 
                 clusters3D.push_back(pCluster3D);
             }
         }
     }
 
     std::sort(clusters3D.begin(), clusters3D.end(), LArClusterHelper::SortByNHits);
 }

bool lar_content::SlidingConePfoMopUpAlgorithm::IsVertexAssociated	(	const pandora::Cluster *const	pCluster,
		const pandora::Vertex *const	pVertex,
		VertexAssociationMap &	vertexAssociationMap,
		const ThreeDSlidingFitResult *const	pSlidingFitResult = `nullptr`
	)		const

private

Whether a 3D cluster is nodally associated with a provided vertex.

Parameters

pCluster	the address of the cluster
pVertex	the address of the vertex
vertexAssociationMap	the vertex association map, which caches the results for efficiency
pSlidingFitResult	the address of a 3D sliding linear fit, if available, which aids pointing cluster construction efficiency

Returns: boolean

bool lar_content::SlidingConePfoMopUpAlgorithm::IsVertexAssociated	(	const pandora::Cluster *const	pCluster,
		const pandora::CartesianVector &	vertexPosition,
		const ThreeDSlidingFitResult *const	pSlidingFitResult = `nullptr`
	)		const

private

Whether a 3D cluster is nodally associated with a provided vertex.

Parameters

pCluster	the address of the cluster
vertexPosition	the vertex position
pSlidingFitResult	the address of a 3D sliding linear fit, if available, which aids pointing cluster construction efficiency

Returns: boolean

bool lar_content::SlidingConePfoMopUpAlgorithm::MakePfoMerges	(	const ClusterToPfoMap &	clusterToPfoMap,
		const ClusterMergeMap &	clusterMergeMap
	)		const

private

Make pfo merges based on the provided cluster merge map.

Parameters

clusterToPfoMap	the mapping from 3d cluster to pfo
clusterMergeMap	the populated cluster merge map

Returns: whether a pfo merge has been made

Definition at line 236 of file SlidingConePfoMopUpAlgorithm.cc.

 {
     ClusterVector daughterClusters;
     for (const ClusterMergeMap::value_type &mapEntry : clusterMergeMap)
         daughterClusters.push_back(mapEntry.first);
     std::sort(daughterClusters.begin(), daughterClusters.end(), LArClusterHelper::SortByNHits);
 
     bool pfosMerged(false);
     ClusterReplacementMap clusterReplacementMap;
 
     for (ClusterVector::const_reverse_iterator rIter = daughterClusters.rbegin(), rIterEnd = daughterClusters.rend(); rIter != rIterEnd; ++rIter)
     {
         const Cluster *const pDaughterCluster(*rIter);
 
         if (clusterReplacementMap.count(pDaughterCluster))
             throw StatusCodeException(STATUS_CODE_FAILURE);
 
         const Cluster *pParentCluster(clusterMergeMap.at(pDaughterCluster).at(0).GetParentCluster());
 
         if (clusterReplacementMap.count(pParentCluster))
             pParentCluster = clusterReplacementMap.at(pParentCluster);
 
         // ATTN Sign there was a reciprocal relationship in the cluster merge map (already actioned once)
         if (pDaughterCluster == pParentCluster)
             continue;
 
         // Key book-keeping on clusters and use cluster->pfo lookup
         const Pfo *const pDaughterPfo(clusterToPfoMap.at(pDaughterCluster));
         const Pfo *const pParentPfo(clusterToPfoMap.at(pParentCluster));
         this->MergeAndDeletePfos(pParentPfo, pDaughterPfo);
         pfosMerged = true;
 
         // Simple/placeholder book-keeping for reciprocal relationships and progressive merges
         clusterReplacementMap[pDaughterCluster] = pParentCluster;
 
         for (ClusterReplacementMap::value_type &mapEntry : clusterReplacementMap)
         {
             if (pDaughterCluster == mapEntry.second)
                 mapEntry.second = pParentCluster;
         }
     }
 
     return pfosMerged;
 }

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

privatevirtual

Reimplemented from lar_content::PfoMopUpBaseAlgorithm.

Definition at line 307 of file SlidingConePfoMopUpAlgorithm.cc.

 {
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadVectorOfValues(xmlHandle, "InputPfoListNames", m_inputPfoListNames));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "UseVertex", m_useVertex));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "MaxIterations", m_maxIterations));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MaxHitsToConsider3DTrack", m_maxHitsToConsider3DTrack));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MinHitsToConsider3DShower", m_minHitsToConsider3DShower));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "SlidingFitHalfWindow", m_halfWindowLayers));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "NConeFitLayers", m_nConeFitLayers));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "NConeFits", m_nConeFits));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "ConeLengthMultiplier", m_coneLengthMultiplier));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "MaxConeLength", m_maxConeLength));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "ConeTanHalfAngle1", m_coneTanHalfAngle1));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "ConeBoundedFraction1", m_coneBoundedFraction1));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "ConeTanHalfAngle2", m_coneTanHalfAngle2));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "ConeBoundedFraction2", m_coneBoundedFraction2));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MinVertexLongitudinalDistance", m_minVertexLongitudinalDistance));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MaxVertexTransverseDistance", m_maxVertexTransverseDistance));
 
     m_daughterListNames.insert(m_daughterListNames.end(), m_inputPfoListNames.begin(), m_inputPfoListNames.end());
 
     return PfoMopUpBaseAlgorithm::ReadSettings(xmlHandle);
 }

StatusCode lar_content::SlidingConePfoMopUpAlgorithm::Run ( )

private

Definition at line 46 of file SlidingConePfoMopUpAlgorithm.cc.

 {
     const Vertex *pVertex(nullptr);
     this->GetInteractionVertex(pVertex);
 
     if (m_useVertex && !pVertex)
     {
         if (PandoraContentApi::GetSettings(*this)->ShouldDisplayAlgorithmInfo())
             std::cout << "SlidingConePfoMopUpAlgorithm - interaction vertex not available for use." << std::endl;
         return STATUS_CODE_SUCCESS;
     }
 
     unsigned int nIterations(0);
 
     while (nIterations++ < m_maxIterations)
     {
         ClusterVector clusters3D;
         ClusterToPfoMap clusterToPfoMap;
         this->GetThreeDClusters(clusters3D, clusterToPfoMap);
 
         ClusterMergeMap clusterMergeMap;
         this->GetClusterMergeMap(pVertex, clusters3D, clusterToPfoMap, clusterMergeMap);
 
         if (!this->MakePfoMerges(clusterToPfoMap, clusterMergeMap))
             break;
     }
 
     return STATUS_CODE_SUCCESS;
 }

Member Data Documentation

float lar_content::SlidingConePfoMopUpAlgorithm::m_coneBoundedFraction1

private

The minimum cluster bounded fraction for association 1.

Definition at line 167 of file SlidingConePfoMopUpAlgorithm.h.

float lar_content::SlidingConePfoMopUpAlgorithm::m_coneBoundedFraction2

private

The minimum cluster bounded fraction for association 2.

Definition at line 169 of file SlidingConePfoMopUpAlgorithm.h.

float lar_content::SlidingConePfoMopUpAlgorithm::m_coneLengthMultiplier

private

The cone length multiplier to use when calculating bounded cluster fractions.

Definition at line 164 of file SlidingConePfoMopUpAlgorithm.h.

float lar_content::SlidingConePfoMopUpAlgorithm::m_coneTanHalfAngle1

private

The cone tan half angle to use when calculating bounded cluster fractions 1.

Definition at line 166 of file SlidingConePfoMopUpAlgorithm.h.

float lar_content::SlidingConePfoMopUpAlgorithm::m_coneTanHalfAngle2

private

The cone tan half angle to use when calculating bounded cluster fractions 2.

Definition at line 168 of file SlidingConePfoMopUpAlgorithm.h.

unsigned int lar_content::SlidingConePfoMopUpAlgorithm::m_halfWindowLayers

private

The number of layers to use for half-window of sliding fit.

Definition at line 161 of file SlidingConePfoMopUpAlgorithm.h.

pandora::StringVector lar_content::SlidingConePfoMopUpAlgorithm::m_inputPfoListNames

private

The input pfo list names.

Definition at line 156 of file SlidingConePfoMopUpAlgorithm.h.

float lar_content::SlidingConePfoMopUpAlgorithm::m_maxConeLength

private

The maximum allowed cone length to use when calculating bounded cluster fractions.

Definition at line 165 of file SlidingConePfoMopUpAlgorithm.h.

unsigned int lar_content::SlidingConePfoMopUpAlgorithm::m_maxHitsToConsider3DTrack

private

The maximum number of hits in a 3d track cluster to warrant inclusion in algorithm.

Definition at line 159 of file SlidingConePfoMopUpAlgorithm.h.

unsigned int lar_content::SlidingConePfoMopUpAlgorithm::m_maxIterations

private

The maximum allowed number of algorithm iterations.

Definition at line 158 of file SlidingConePfoMopUpAlgorithm.h.

float lar_content::SlidingConePfoMopUpAlgorithm::m_maxVertexTransverseDistance

private

Vertex association check: max transverse distance cut.

Definition at line 171 of file SlidingConePfoMopUpAlgorithm.h.

unsigned int lar_content::SlidingConePfoMopUpAlgorithm::m_minHitsToConsider3DShower

private

The minimum number of hits in a 3d shower cluster to attempt cone fits.

Definition at line 160 of file SlidingConePfoMopUpAlgorithm.h.

float lar_content::SlidingConePfoMopUpAlgorithm::m_minVertexLongitudinalDistance

private

Vertex association check: min longitudinal distance cut.

Definition at line 170 of file SlidingConePfoMopUpAlgorithm.h.

unsigned int lar_content::SlidingConePfoMopUpAlgorithm::m_nConeFitLayers

private

The number of layers over which to sum fitted direction to obtain cone fit.

Definition at line 162 of file SlidingConePfoMopUpAlgorithm.h.

unsigned int lar_content::SlidingConePfoMopUpAlgorithm::m_nConeFits

private

The number of cone fits to perform, spread roughly uniformly along the shower length.

Definition at line 163 of file SlidingConePfoMopUpAlgorithm.h.

bool lar_content::SlidingConePfoMopUpAlgorithm::m_useVertex

private

Whether to use the interaction vertex to select useful cone directions.

Definition at line 157 of file SlidingConePfoMopUpAlgorithm.h.

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

Classes

Public Member Functions

Private Types

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation