9 #include "Pandora/AlgorithmHeaders.h" 34 EventSlicingTool::EventSlicingTool() :
35 m_minHitsPer3DCluster(20),
36 m_min3DHitsToSeedNewSlice(50),
37 m_halfWindowLayers(20),
38 m_usePointingAssociation(true),
39 m_minVertexLongitudinalDistance(-7.5
f),
40 m_maxVertexLongitudinalDistance(60.
f),
41 m_maxVertexTransverseDistance(10.5
f),
42 m_vertexAngularAllowance(9.
f),
43 m_maxClosestApproach(15.
f),
44 m_maxInterceptDistance(60.
f),
45 m_useProximityAssociation(true),
46 m_maxHitSeparationSquared(25.
f * 25.
f),
47 m_useShowerConeAssociation(true),
50 m_coneLengthMultiplier(7.
f),
51 m_maxConeLength(126.
f),
52 m_coneTanHalfAngle1(0.5
f),
53 m_coneBoundedFraction1(0.5
f),
54 m_coneTanHalfAngle2(0.75
f),
55 m_coneBoundedFraction2(0.75
f),
56 m_use3DProjectionsInHitPickUp(true)
62 void EventSlicingTool::RunSlicing(
const Algorithm *
const pAlgorithm,
const HitTypeToNameMap &caloHitListNames,
const HitTypeToNameMap &clusterListNames,
65 if (PandoraContentApi::GetSettings(*pAlgorithm)->ShouldDisplayAlgorithmInfo())
66 std::cout <<
"----> Running Algorithm Tool: " << this->GetInstanceName() <<
", " << this->GetType() << std::endl;
70 ClusterList trackClusters3D;
73 ClusterList showerClusters3D;
79 if (clusterSliceList.size() < 2)
86 this->
CreateSlices(clusterSliceList, sliceList, clusterToSliceIndexMap);
88 ClusterSet assignedClusters;
89 this->
CopyPfoHitsToSlices(clusterToSliceIndexMap, clusterToPfoMap, sliceList, assignedClusters);
91 ClusterList remainingClusters;
102 if (!sliceList.empty())
103 throw StatusCodeException(STATUS_CODE_INVALID_PARAMETER);
105 const CaloHitList *pCaloHitListU(
nullptr);
106 PANDORA_THROW_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetList(*pAlgorithm,
107 caloHitListNames.at(TPC_VIEW_U), pCaloHitListU));
109 const CaloHitList *pCaloHitListV(
nullptr);
110 PANDORA_THROW_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetList(*pAlgorithm,
111 caloHitListNames.at(TPC_VIEW_V), pCaloHitListV));
113 const CaloHitList *pCaloHitListW(
nullptr);
114 PANDORA_THROW_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetList(*pAlgorithm,
115 caloHitListNames.at(TPC_VIEW_W), pCaloHitListW));
117 if (pCaloHitListU || pCaloHitListV || pCaloHitListW)
119 sliceList.push_back(
Slice());
120 Slice &slice(sliceList.at(0));
122 if (pCaloHitListU) slice.m_caloHitListU = *pCaloHitListU;
123 if (pCaloHitListV) slice.m_caloHitListV = *pCaloHitListV;
124 if (pCaloHitListW) slice.m_caloHitListW = *pCaloHitListW;
133 const PfoList *pPfoList(
nullptr);
134 PANDORA_THROW_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetList(*pAlgorithm, pfoListName, pPfoList));
136 if (!pPfoList || pPfoList->empty())
138 if (PandoraContentApi::GetSettings(*pAlgorithm)->ShouldDisplayAlgorithmInfo())
139 std::cout <<
"EventSlicingTool: unable to find pfo list " << pfoListName << std::endl;
144 for (
const ParticleFlowObject *
const pPfo : *pPfoList)
146 ClusterList pfoClusters3D;
149 for (
const Cluster *
const pCluster3D : pfoClusters3D)
154 if (!clusterToPfoMap.insert(ClusterToPfoMap::value_type(pCluster3D, pPfo)).second)
155 throw StatusCodeException(STATUS_CODE_ALREADY_PRESENT);
157 if (clusters3D.end() != std::find(clusters3D.begin(), clusters3D.end(), pCluster3D))
158 throw StatusCodeException(STATUS_CODE_ALREADY_PRESENT);
160 clusters3D.push_back(pCluster3D);
174 for (
const Cluster *
const pCluster3D : trackClusters3D)
177 catch (StatusCodeException &) {std::cout <<
"EventSlicingTool: ThreeDSlidingFitResult failure for track cluster." << std::endl;}
182 for (
const Cluster *
const pCluster3D : showerClusters3D)
185 catch (StatusCodeException &) {std::cout <<
"EventSlicingTool: ThreeDSlidingConeFitResult failure for shower cluster." << std::endl;}
188 ClusterVector sortedClusters3D(trackClusters3D.begin(), trackClusters3D.end());
189 sortedClusters3D.insert(sortedClusters3D.end(), showerClusters3D.begin(), showerClusters3D.end());
192 ClusterSet usedClusters;
194 for (
const Cluster *
const pCluster3D : sortedClusters3D)
196 if (usedClusters.count(pCluster3D))
203 usedClusters.insert(pCluster3D);
206 this->
CollectAssociatedClusters(pCluster3D, sortedClusters3D, trackFitResults, showerConeFitResults, clusterSlice, usedClusters);
214 ClusterSet &usedClusters)
const 218 for (
const Cluster *
const pCandidateCluster : candidateClusters)
220 if (usedClusters.count(pCandidateCluster) || (pClusterInSlice == pCandidateCluster))
227 addedClusters.push_back(pCandidateCluster);
228 (void) usedClusters.insert(pCandidateCluster);
232 clusterSlice.insert(clusterSlice.end(), addedClusters.begin(), addedClusters.end());
234 for (
const Cluster *
const pAddedCluster : addedClusters)
235 this->
CollectAssociatedClusters(pAddedCluster, candidateClusters, trackFitResults, showerConeFitResults, clusterSlice, usedClusters);
245 if ((trackFitResults.end() == inSliceIter) || (trackFitResults.end() == candidateIter))
252 this->
IsEmission(inSlicePointingCluster, candidatePointingCluster) ||
253 this->
IsNode(inSlicePointingCluster, candidatePointingCluster))
265 for (
const auto &orderedList1 : pClusterInSlice->GetOrderedCaloHitList())
267 for (
const CaloHit *
const pCaloHit1 : *(orderedList1.second))
269 const CartesianVector &positionVector1(pCaloHit1->GetPositionVector());
271 for (
const auto &orderedList2 : pCandidateCluster->GetOrderedCaloHitList())
273 for (
const CaloHit *
const pCaloHit2 : *(orderedList2.second))
291 if (showerConeFitResults.end() == fitIter)
294 float clusterLength(0.
f);
302 clusterLength = (slidingFitResult3D.GetGlobalMaxLayerPosition() - slidingFitResult3D.GetGlobalMinLayerPosition()).GetMagnitude();
304 catch (
const StatusCodeException &)
309 for (
const SimpleCone &simpleCone : simpleConeList)
339 CartesianVector intersectionPoint(0.
f, 0.
f, 0.
f);
346 catch (
const StatusCodeException &)
353 const float closestApproach((approach1 - approach2).GetMagnitude());
390 unsigned int index(0);
394 for (
const Cluster *
const pCluster3D : clusterList)
397 throw StatusCodeException(STATUS_CODE_INVALID_PARAMETER);
399 if (!clusterToSliceIndexMap.insert(ClusterToSliceIndexMap::value_type(pCluster3D, index)).second)
400 throw StatusCodeException(STATUS_CODE_ALREADY_PRESENT);
403 sliceList.push_back(
Slice());
411 SliceList &sliceList, ClusterSet &assignedClusters)
const 413 ClusterList clusterList;
414 for (
const auto &mapEntry : clusterToSliceIndexMap) clusterList.push_back(mapEntry.first);
417 for (
const Cluster *
const pCluster3D : clusterList)
419 const unsigned int index(clusterToSliceIndexMap.at(pCluster3D));
421 const Pfo *
const pPfo(clusterToPfoMap.at(pCluster3D));
422 Slice &slice(sliceList.at(index));
424 ClusterList clusters2D;
427 for (
const Cluster *
const pCluster2D : clusters2D)
431 if ((TPC_VIEW_U != hitType) && (TPC_VIEW_V != hitType) && (TPC_VIEW_W != hitType))
432 throw StatusCodeException(STATUS_CODE_INVALID_PARAMETER);
434 CaloHitList &targetList((TPC_VIEW_U == hitType) ? slice.m_caloHitListU : (TPC_VIEW_V == hitType) ? slice.m_caloHitListV : slice.m_caloHitListW);
436 pCluster2D->GetOrderedCaloHitList().FillCaloHitList(targetList);
437 targetList.insert(targetList.end(), pCluster2D->GetIsolatedCaloHitList().begin(), pCluster2D->GetIsolatedCaloHitList().end());
439 if (!assignedClusters.insert(pCluster2D).second)
440 throw StatusCodeException(STATUS_CODE_ALREADY_PRESENT);
448 const ClusterSet &assignedClusters, ClusterList &remainingClusters)
const 450 this->
GetRemainingClusters(pAlgorithm, clusterListNames.at(TPC_VIEW_U), assignedClusters, remainingClusters);
451 this->
GetRemainingClusters(pAlgorithm, clusterListNames.at(TPC_VIEW_V), assignedClusters, remainingClusters);
452 this->
GetRemainingClusters(pAlgorithm, clusterListNames.at(TPC_VIEW_W), assignedClusters, remainingClusters);
458 const ClusterSet &assignedClusters, ClusterList &remainingClusters)
const 460 const ClusterList *pClusterList(
nullptr);
461 PANDORA_THROW_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_INITIALIZED, !=, PandoraContentApi::GetList(*pAlgorithm, clusterListName, pClusterList));
463 if (!pClusterList || pClusterList->empty())
465 if (PandoraContentApi::GetSettings(*pAlgorithm)->ShouldDisplayAlgorithmInfo())
466 std::cout <<
"EventSlicingTool: unable to find cluster list " << clusterListName << std::endl;
471 for (
const Cluster *
const pCluster2D : *pClusterList)
475 if ((TPC_VIEW_U != hitType) && (TPC_VIEW_V != hitType) && (TPC_VIEW_W != hitType))
476 throw StatusCodeException(STATUS_CODE_INVALID_PARAMETER);
478 if (assignedClusters.count(pCluster2D))
481 if (remainingClusters.end() != std::find(remainingClusters.begin(), remainingClusters.end(), pCluster2D))
482 throw StatusCodeException(STATUS_CODE_ALREADY_PRESENT);
484 remainingClusters.push_back(pCluster2D);
491 SliceList &sliceList)
const 501 this->
GetKDTreeEntries3D(clusterToSliceIndexMap, pointsU, pointsV, pointsW, pointToSliceIndexMap);
513 kdTreeU.
build(kDNode2DListU, boundingRegionU);
514 kdTreeV.
build(kDNode2DListV, boundingRegionV);
515 kdTreeW.
build(kDNode2DListW, boundingRegionW);
517 ClusterVector sortedRemainingClusters(remainingClusters.begin(), remainingClusters.end());
520 for (
const Cluster *
const pCluster2D : sortedRemainingClusters)
524 if ((TPC_VIEW_U != hitType) && (TPC_VIEW_V != hitType) && (TPC_VIEW_W != hitType))
525 throw StatusCodeException(STATUS_CODE_INVALID_PARAMETER);
527 PointKDTree2D &kdTree((TPC_VIEW_U == hitType) ? kdTreeU : (TPC_VIEW_V == hitType) ? kdTreeV : kdTreeW);
530 if (!pBestResultPoint)
533 Slice &slice(sliceList.at(pointToSliceIndexMap.at(pBestResultPoint->
data)));
536 pCluster2D->GetOrderedCaloHitList().FillCaloHitList(targetList);
537 targetList.insert(targetList.end(), pCluster2D->GetIsolatedCaloHitList().begin(), pCluster2D->GetIsolatedCaloHitList().end());
542 std::cout <<
"EventSlicingTool::AssignRemainingHitsToSlices - exception " << std::endl;
543 for (
const auto &pointMap : pointToSliceIndexMap)
delete pointMap.first;
547 for (
const auto &pointMap : pointToSliceIndexMap)
delete pointMap.first;
555 unsigned int sliceIndex(0);
557 for (
const Slice &slice : sliceList)
559 for (
const CaloHit *
const pCaloHit : slice.m_caloHitListU)
561 const CartesianVector *
const pPoint(
new CartesianVector(pCaloHit->GetPositionVector()));
562 pointToSliceIndexMap.insert(PointToSliceIndexMap::value_type(pPoint, sliceIndex));
563 pointsU.push_back(pPoint);
566 for (
const CaloHit *
const pCaloHit : slice.m_caloHitListV)
568 const CartesianVector *
const pPoint(
new CartesianVector(pCaloHit->GetPositionVector()));
569 pointToSliceIndexMap.insert(PointToSliceIndexMap::value_type(pPoint, sliceIndex));
570 pointsV.push_back(pPoint);
573 for (
const CaloHit *
const pCaloHit : slice.m_caloHitListW)
575 const CartesianVector *
const pPoint(
new CartesianVector(pCaloHit->GetPositionVector()));
576 pointToSliceIndexMap.insert(PointToSliceIndexMap::value_type(pPoint, sliceIndex));
577 pointsW.push_back(pPoint);
589 ClusterList clusterList;
590 for (
const auto &mapEntry : clusterToSliceIndexMap) clusterList.push_back(mapEntry.first);
593 for (
const Cluster *
const pCluster3D : clusterList)
595 const unsigned int sliceIndex(clusterToSliceIndexMap.at(pCluster3D));
597 CaloHitList caloHitList;
598 pCluster3D->GetOrderedCaloHitList().FillCaloHitList(caloHitList);
600 for (
const CaloHit *
const pCaloHit3D : caloHitList)
602 if (TPC_3D != pCaloHit3D->GetHitType())
603 throw StatusCodeException(STATUS_CODE_FAILURE);
605 const CartesianVector &position3D(pCaloHit3D->GetPositionVector());
611 pointsU.push_back(pProjectionU);
612 pointsV.push_back(pProjectionV);
613 pointsW.push_back(pProjectionW);
615 pointToSliceIndexMap.insert(PointToSliceIndexMap::value_type(pProjectionU, sliceIndex));
616 pointToSliceIndexMap.insert(PointToSliceIndexMap::value_type(pProjectionV, sliceIndex));
617 pointToSliceIndexMap.insert(PointToSliceIndexMap::value_type(pProjectionW, sliceIndex));
631 clusterPointList.push_back(
new CartesianVector(pCluster2D->GetCentroid(pCluster2D->GetInnerPseudoLayer())));
632 clusterPointList.push_back(
new CartesianVector(pCluster2D->GetCentroid(pCluster2D->GetOuterPseudoLayer())));
633 clusterPointList.push_back(
new CartesianVector((pCluster2D->GetCentroid(pCluster2D->GetInnerPseudoLayer()) + pCluster2D->GetCentroid(pCluster2D->GetOuterPseudoLayer())) * 0.5f));
637 for (
const CartesianVector *
const pClusterPoint : clusterPointList)
641 const PointKDNode2D targetPoint(pClusterPoint, pClusterPoint->GetX(), pClusterPoint->GetZ());
644 if (pResultPoint && (resultDistance < bestDistance))
646 pBestResultPoint = pResultPoint;
647 bestDistance = resultDistance;
653 std::cout <<
"EventSlicingTool::MatchClusterToSlice - exception " << std::endl;
654 for (
const CartesianVector *
const pPoint : clusterPointList)
delete pPoint;
658 for (
const CartesianVector *
const pPoint : clusterPointList)
delete pPoint;
660 return pBestResultPoint;
667 const CartesianVector deltaPosition(*pRhs - *pLhs);
669 if (std::fabs(deltaPosition.GetZ()) > std::numeric_limits<float>::epsilon())
670 return (deltaPosition.GetZ() > std::numeric_limits<float>::epsilon());
672 if (std::fabs(deltaPosition.GetX()) > std::numeric_limits<float>::epsilon())
673 return (deltaPosition.GetX() > std::numeric_limits<float>::epsilon());
675 return (deltaPosition.GetY() > std::numeric_limits<float>::epsilon());
682 PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, XmlHelper::ReadValue(xmlHandle,
685 PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, XmlHelper::ReadValue(xmlHandle,
688 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
691 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
694 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
697 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
700 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
703 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
706 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
709 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
712 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
715 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
718 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
722 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
723 "MaxHitSeparation", maxHitSeparation));
726 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
729 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
732 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
735 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
738 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
741 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
744 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
747 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
750 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
753 PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
756 return STATUS_CODE_SUCCESS;
void GetThreeDClusters(const pandora::Algorithm *const pAlgorithm, const std::string &pfoListName, pandora::ClusterList &clusters3D, ClusterToPfoMap &clusterToPfoMap) const
Get the 3D clusters from a specified list of pfos, storing the 3D clusters in the provided list and p...
unsigned int m_nConeFits
The number of cone fits to perform, spread roughly uniformly along the shower length.
static bool SortByNHits(const pandora::Cluster *const pLhs, const pandora::Cluster *const pRhs)
Sort clusters by number of hits, then layer span, then inner layer, then position, then pulse-height.
void GetClusterSliceList(const pandora::ClusterList &trackClusters3D, const pandora::ClusterList &showerClusters3D, ClusterSliceList &clusterSliceList) const
Divide the provided lists of 3D track and shower clusters into slices.
unsigned int m_min3DHitsToSeedNewSlice
The minimum number of hits in a 3D cluster to seed a new slice.
void CopyPfoHitsToSlices(const ClusterToSliceIndexMap &clusterToSliceIndexMap, const ClusterToPfoMap &clusterToPfoMap, SlicingAlgorithm::SliceList &sliceList, pandora::ClusterSet &assignedClusters) const
Use 3D clusters in the cluster slice list, find their parent pfos and assign all hits in all 2D clust...
Header file for the kd tree linker algo template class.
Header file for the pfo helper class.
float m_maxHitSeparationSquared
Proximity association: max distance allowed between the closest pair of hits.
unsigned int m_nConeFitLayers
The number of layers over which to sum fitted direction to obtain cone fit.
float m_coneTanHalfAngle2
The cone tan half angle to use when calculating bounded cluster fractions 2.
SlicingAlgorithm::Slice Slice
pandora::StatusCode ReadSettings(const pandora::TiXmlHandle xmlHandle)
float m_maxVertexTransverseDistance
Pointing association check: max transverse distance cut.
static bool IsEmission(const pandora::CartesianVector &parentVertex, const LArPointingCluster::Vertex &daughterVertex, const float minLongitudinalDistance, const float maxLongitudinalDistance, const float maxTransverseDistance, const float angularAllowance)
Whether pointing vertex is emitted from a given position.
void AssignRemainingHitsToSlices(const pandora::ClusterList &remainingClusters, const ClusterToSliceIndexMap &clusterToSliceIndexMap, SlicingAlgorithm::SliceList &sliceList) const
Use the list of remaining 2D clusters to assign all remaining 2D hits to existing slices in the slice...
float m_coneBoundedFraction2
The minimum cluster bounded fraction for association 2.
std::string m_showerPfoListName
The name of the input shower pfo list.
static void GetIntersection(const LArPointingCluster::Vertex &firstVertex, const LArPointingCluster::Vertex &secondVertex, pandora::CartesianVector &intersectPosition, float &firstDisplacement, float &secondDisplacement)
Get intersection of two vertices.
static void GetTwoDClusterList(const pandora::ParticleFlowObject *const pPfo, pandora::ClusterList &clusterList)
Get the list of 2D clusters from an input pfo.
Class that implements the KDTree partition of 2D space and a closest point search algorithm...
Box structure used to define 2D field. It's used in KDTree building step to divide the detector space...
void GetRemainingClusters(const pandora::Algorithm *const pAlgorithm, const SlicingAlgorithm::HitTypeToNameMap &clusterListNames, const pandora::ClusterSet &assignedClusters, pandora::ClusterList &remainingClusters) const
Get the list of 2D clusters with hits yets to be assigned to slices.
std::vector< SimpleCone > SimpleConeList
SlicingAlgorithm::SliceList SliceList
bool PassShowerCone(const pandora::Cluster *const pConeCluster, const pandora::Cluster *const pNearbyCluster, const ThreeDSlidingConeFitResultMap &showerConeFitResults) const
Compare the provided clusters to assess whether they are associated via cone fits to the shower clust...
static pandora::CartesianVector ProjectPosition(const pandora::Pandora &pandora, const pandora::CartesianVector &position3D, const pandora::HitType view)
Project 3D position into a given 2D view.
std::unordered_map< const pandora::Cluster *, const pandora::ParticleFlowObject * > ClusterToPfoMap
bool PassPointing(const pandora::Cluster *const pClusterInSlice, const pandora::Cluster *const pCandidateCluster, const ThreeDSlidingFitResultMap &trackFitResults) const
Compare the provided clusters to assess whether they are associated via pointing (checks association ...
const ThreeDSlidingFitResult & GetSlidingFitResult() const
Get the sliding fit result for the full cluster.
unsigned int m_minHitsPer3DCluster
The minimum number of hits in a 3D cluster to warrant consideration in slicing.
LArPointingCluster class.
static pandora::HitType GetClusterHitType(const pandora::Cluster *const pCluster)
Get the hit type associated with a two dimensional cluster.
float m_coneTanHalfAngle1
The cone tan half angle to use when calculating bounded cluster fractions 1.
static float GetWireZPitch(const pandora::Pandora &pandora, const float maxWirePitchDiscrepancy=0.01)
Return the wire pitch.
void CollectAssociatedClusters(const pandora::Cluster *const pClusterInSlice, const pandora::ClusterVector &candidateClusters, const ThreeDSlidingFitResultMap &trackFitResults, const ThreeDSlidingConeFitResultMap &showerConeFitResults, pandora::ClusterVector &clusterSlice, pandora::ClusterSet &usedClusters) const
Collect all clusters associated with a provided cluster.
const PointKDNode2D * MatchClusterToSlice(const pandora::Cluster *const pCluster2D, PointKDTree2D &kdTree) const
Use the provided kd tree to efficiently identify the most appropriate slice for the provided 2D clust...
Header file for the lar three dimensional sliding cone fit result class.
void GetSimpleConeList(const unsigned int nLayersForConeFit, const unsigned int nCones, const ConeSelection coneSelection, SimpleConeList &simpleConeList) const
Get the list of simple cones fitted to the three dimensional cluster.
float m_maxVertexLongitudinalDistance
Pointing association check: max longitudinal distance cut.
void findNearestNeighbour(const KDTreeNodeInfoT< DATA, DIM > &point, const KDTreeNodeInfoT< DATA, DIM > *&result, float &distance)
findNearestNeighbour
Data stored in each KDTree node. The dim1/dim2 fields are usually the duplication of some PFRecHit va...
std::string m_trackPfoListName
The name of the input track pfo list.
std::unordered_map< const pandora::Cluster *, ThreeDSlidingConeFitResult > ThreeDSlidingConeFitResultMap
Header file for the geometry helper class.
bool m_useProximityAssociation
Whether to use proximity association.
float m_maxClosestApproach
Pointing association: max distance of closest approach between straight line fits.
std::unordered_map< const pandora::CartesianVector *, unsigned int > PointToSliceIndexMap
bool IsNode(const LArPointingCluster &cluster1, const LArPointingCluster &cluster2) const
Check whether a pair of pointing clusters are nodally associated.
static bool SortPoints(const pandora::CartesianVector *const pLhs, const pandora::CartesianVector *const pRhs)
Sort points (use Z, followed by X, followed by Y)
Header file for the cluster helper class.
bool m_usePointingAssociation
Whether to use pointing association.
float m_coneLengthMultiplier
The cone length multiplier to use when calculating bounded cluster fractions.
const Vertex & GetOuterVertex() const
Get the outer vertex.
const Vertex & GetInnerVertex() const
Get the inner vertex.
bool PassProximity(const pandora::Cluster *const pClusterInSlice, const pandora::Cluster *const pCandidateCluster) const
Compare the provided clusters to assess whether they are associated via pointing. ...
static void GetThreeDClusterList(const pandora::ParticleFlowObject *const pPfo, pandora::ClusterList &clusterList)
Get the list of 3D clusters from an input pfo.
pandora::CaloHitList m_caloHitListU
The u calo hit list.
std::vector< pandora::ClusterVector > ClusterSliceList
Header file for the lar three dimensional sliding fit result class.
const pandora::CartesianVector & GetDirection() const
Get the vertex direction.
std::unordered_map< const pandora::Cluster *, ThreeDSlidingFitResult > ThreeDSlidingFitResultMap
std::vector< art::Ptr< recob::Cluster > > ClusterVector
void CopyAllHitsToSingleSlice(const pandora::Algorithm *const pAlgorithm, const SlicingAlgorithm::HitTypeToNameMap &caloHitListNames, SlicingAlgorithm::SliceList &sliceList) const
Copy all the input hits in an event into a single slice.
SlicingAlgorithm::HitTypeToNameMap HitTypeToNameMap
bool CheckClosestApproach(const LArPointingCluster &cluster1, const LArPointingCluster &cluster2) const
Check closest approach metrics for a pair of pointing clusters.
std::vector< PointKDNode2D > PointKDNode2DList
ThreeDSlidingFitResult class.
pandora::CaloHitList m_caloHitListW
The w calo hit list.
float m_maxInterceptDistance
Pointing association: max distance from cluster vertex to point of closest approach.
void RunSlicing(const pandora::Algorithm *const pAlgorithm, const SlicingAlgorithm::HitTypeToNameMap &caloHitListNames, const SlicingAlgorithm::HitTypeToNameMap &clusterListNames, SlicingAlgorithm::SliceList &sliceList)
Run the slicing tool.
float m_minVertexLongitudinalDistance
Pointing association check: min longitudinal distance cut.
bool IsEmission(const LArPointingCluster &cluster1, const LArPointingCluster &cluster2) const
Check whether a pair of pointing clusters are consistent with an emission.
KDTreeBox fill_and_bound_2d_kd_tree(const MANAGED_CONTAINER< const T * > &points, std::vector< KDTreeNodeInfoT< const T *, 2 > > &nodes)
fill_and_bound_2d_kd_tree
bool m_use3DProjectionsInHitPickUp
Whether to include 3D cluster projections when assigning remaining clusters to slices.
ThreeDSlidingConeFitResult class.
std::list< const pandora::CartesianVector * > PointList
float m_maxConeLength
The maximum allowed cone length to use when calculating bounded cluster fractions.
bool m_useShowerConeAssociation
Whether to use shower cone association.
std::unordered_map< const pandora::Cluster *, unsigned int > ClusterToSliceIndexMap
float m_vertexAngularAllowance
Pointing association check: pointing angular allowance in degrees.
pandora::CaloHitList m_caloHitListV
The v calo hit list.
void GetKDTreeEntries2D(const SlicingAlgorithm::SliceList &sliceList, PointList &pointsU, PointList &pointsV, PointList &pointsW, PointToSliceIndexMap &pointToSliceIndexMap) const
Use projections of 3D hits already assigned to slices to populate kd trees to aid assignment of remai...
const pandora::CartesianVector & GetPosition() const
Get the vertex position.
void GetKDTreeEntries3D(const ClusterToSliceIndexMap &clusterToSliceIndexMap, PointList &pointsU, PointList &pointsV, PointList &pointsW, PointToSliceIndexMap &pointToSliceIndexMap) const
Use 2D hits already assigned to slices to populate kd trees to aid assignment of remaining clusters...
void CreateSlices(const ClusterSliceList &clusterSliceList, SlicingAlgorithm::SliceList &sliceList, ClusterToSliceIndexMap &clusterToSliceIndexMap) const
Create new slices for each of the groupings of 3D clusters in the provided cluster slice list...
float m_coneBoundedFraction1
The minimum cluster bounded fraction for association 1.
static bool IsNode(const pandora::CartesianVector &parentVertex, const LArPointingCluster::Vertex &daughterVertex, const float minLongitudinalDistance, const float maxTransverseDistance)
Whether pointing vertex is adjacent to a given position.
unsigned int m_halfWindowLayers
The number of layers to use for half-window of sliding fit.
void build(std::vector< KDTreeNodeInfoT< DATA, DIM > > &eltList, const KDTreeBoxT< DIM > ®ion)
Build the KD tree from the "eltList" in the space define by "region".