LegendreSegmentFinderTool.cxx File Reference

Temporary and simplified Athena-native Legendre segment finder for MDT studies. More...

#include "LegendreSegmentFinderTool.h"
#include "L0MuonMDTTools/L0MDTSegment.h"
#include "MuonReadoutGeometryR4/MdtReadoutElement.h"
#include <algorithm>
#include <cmath>
#include <numeric>

Include dependency graph for LegendreSegmentFinderTool.cxx:

Go to the source code of this file.

Namespaces
namespace	L0MDT
	Compact Segment Finder algorithm overview.

Detailed Description

Temporary and simplified Athena-native Legendre segment finder for MDT studies.

This implementation is intended only as an early integration and validation tool. It provides a first Legendre-transform-based segment-finding chain in the (z, R) plane, using the same external interface as the CSF-based segment finder.

Important limitations of the current implementation:

• this is not a 1:1 port of the old standalone implementation
• only a simplified (z, R) treatment is used
• no phi-sector-dependent corrections are applied
• no dedicated window offsets or geometry-dependent tuning are included
• no smearing or sliding-window logic is included
• no ambiguity-resolution refinements beyond the current simple bin logic are included
• the output segment container is not yet fully populated; at present this tool is mainly used to validate the Legendre maximum and fitted line parameters

Main steps:

1. Build compact hit information from MDT drift circles
2. Define a Legendre window around the RPC seed
3. Fill the sinogram using the two left/right ambiguity branches
4. Find the most populated bin
5. Convert the maximum bin back to a line R = m*z + b
6. Optionally refine the line with a straight-line fit to tangent points

This tool is expected to be refined in follow-up work.

Definition in file LegendreSegmentFinderTool.cxx.