LGADHitClustering.h

Go to the documentation of this file.

// SPDX-License-Identifier: LGPL-3.0-or-later
// Copyright (C) 2025 Chun Yuen Tsang
 
#pragma once
#include <DD4hep/DetElement.h>
#include <DD4hep/Detector.h>
#include <DD4hep/Segmentations.h>
#include <DDRec/CellIDPositionConverter.h>
#include <DDSegmentation/BitFieldCoder.h>
#include <DDSegmentation/CartesianGridXY.h>
#include <algorithms/algorithm.h>
#include <edm4eic/Measurement2DCollection.h>
#include <edm4eic/TrackerHitCollection.h>
#include <spdlog/logger.h>
#include <memory>
#include <string>
#include <string_view>
#include <unordered_map>
#include <vector>
 
#include "LGADHitClusteringConfig.h"
#include "algorithms/interfaces/WithPodConfig.h"
#include "algorithms/tracking/ActsGeometryProvider.h"
 
namespace eicrecon {
 
using LGADHitClusteringAlgorithm =
    algorithms::Algorithm<algorithms::Input<edm4eic::TrackerHitCollection>,
                          algorithms::Output<edm4eic::Measurement2DCollection>>;
 
class LGADHitClustering : public LGADHitClusteringAlgorithm,
                          public WithPodConfig<LGADHitClusteringConfig> {
 
public:
  LGADHitClustering(std::string_view name)
      : LGADHitClusteringAlgorithm{name, {"TOFBarrelCalHit"}, {"TOFBarrelRecHit"}, ""} {};
 
  void init() final;
  void process(const Input&, const Output&) const final;
 
private:
  void _calcCluster(const Output& output, const std::vector<edm4eic::TrackerHit>& hits) const;
 
  std::shared_ptr<spdlog::logger> m_log;
 
  const dd4hep::rec::CellIDPositionConverter* m_converter = nullptr;
 
  const dd4hep::DDSegmentation::BitFieldCoder* m_decoder = nullptr;
 
  const dd4hep::Detector* m_detector = nullptr;
 
  dd4hep::Segmentation m_seg;
 
  std::shared_ptr<const ActsGeometryProvider> m_acts_context;
 
  // neighbor finding algorithm copied from SiliconChargeSharing
  const dd4hep::DDSegmentation::CartesianGridXY*
  getLocalSegmentation(const dd4hep::rec::CellID& cellID) const;
 
  mutable std::unordered_map<const dd4hep::DetElement*,
                             const dd4hep::DDSegmentation::CartesianGridXY*>
      m_segmentation_map;
 
  // union-find algorithm to group contiguous clusters
  class UnionFind {
  private:
    std::vector<int> mParent, mRank;
 
  public:
    UnionFind(int n);
    int find(int id);
    void merge(int id1, int id2);
  };
};
} // namespace eicrecon