ATLAS Offline Software
Loading...
Searching...
No Matches
MdtSegmentSeedGenerator.cxx
Go to the documentation of this file.
1/*
2 Copyright (C) 2002-2025 CERN for the benefit of the ATLAS collaboration
3*/
9
10#include <Acts/Utilities/Enumerate.hpp>
11#include <Acts/Definitions/Units.hpp>
12#include <Acts/Utilities/UnitVectors.hpp>
13
14#include <CxxUtils/sincos.h>
15#include <format>
16
17using namespace Acts;
18using namespace Acts::UnitLiterals;
19namespace MuonR4::SegmentFit{
22 constexpr auto covIdx = Acts::toUnderlying(AxisDefs::etaCov);
23
24
28 return static_cast<const xAOD::MdtDriftCircle*>(prd)->status();
29 }
30 return Muon::MdtDriftCircleStatus::MdtStatusUnDefined;
31 }
32
33 inline bool isGoodDC(const SpacePoint& dc) {
34 return dcStatus(dc) == Muon::MdtDriftCircleStatus::MdtStatusDriftTime;
35 }
36
39 inline bool moveToNextHit(const HitVec& hits, std::size_t& hitIdx) {
40 while(++hitIdx < hits.size() && !isGoodDC(*hits[hitIdx])) {
41 }
42 return hitIdx < hits.size() && isGoodDC(*hits[hitIdx]);
43 }
44
47 inline bool firstGoodHit(const HitVec& hits, std::size_t& hitIdx) {
48 hitIdx = 0;
49 return isGoodDC(*hits[hitIdx]) || moveToNextHit(hits, hitIdx);
50 }
51
52 void MdtSegmentSeedGenerator::SeedSolution::print(std::ostream& ostr) const{
53 ostr<<"two circle solution with ";
54 ostr<<"theta: "<<(theta / 1._degree) <<" pm "<<(dTheta / 1._degree)<<", ";
55 ostr<<"y0: "<<y0<<" pm "<<dY0;
56 }
60
63 const SegmentSeed* segmentSeed,
64 const Config& configuration):
65 AthMessaging{name},
66 m_cfg{configuration},
67 m_segmentSeed{segmentSeed} {
68
69 if (m_hitLayers.mdtHits().empty()) return;
70
71 if (std::ranges::any_of(m_hitLayers.mdtHits(), [this](const HitVec& vec){
72 return vec.size() > m_cfg.busyLayerLimit;
73 })) {
74 m_cfg.startWithPattern = false;
75 }
76 // Set the start for the upper layer
77 m_upperLayer = m_hitLayers.mdtHits().size()-1;
78
80 while (m_lowerLayer < m_upperLayer){
81 const HitVec& lower{m_hitLayers.mdtHits()[m_lowerLayer]};
82 if (lower.size() > m_cfg.busyLayerLimit || !firstGoodHit(lower, m_lowerHitIndex)) {
84 } else {
85 break;
86 }
87
88 }
90 while (m_lowerLayer < m_upperLayer){
91 const HitVec& upper{m_hitLayers.mdtHits()[m_upperLayer]};
92 if (upper.size() > m_cfg.busyLayerLimit || !firstGoodHit(upper, m_upperHitIndex)) {
94 } else {
95 break;
96 }
97
98 }
99
100 if (msgLvl(MSG::VERBOSE)) {
101 std::stringstream sstr{};
102 for (const auto [layCount, layer] : Acts::enumerate(m_hitLayers.mdtHits())) {
103 sstr<<"Mdt-hits in layer "<<layCount<<": "<<layer.size()<<std::endl;
104 for (const HoughHitType& hit : layer) {
105 sstr<<" **** "<<(*hit)<<std::endl;
106 }
107 }
108 for (const auto [layCount, layer] : Acts::enumerate(m_hitLayers.stripHits())) {
109 sstr<<"Hits in layer "<<layCount<<": "<<layer.size()<<std::endl;
110 for (const HoughHitType& hit : layer) {
111 sstr<<" **** "<<(*hit)<<std::endl;
112 }
113 }
114 ATH_MSG_VERBOSE("SeedGenerator - sorting of hits done. Mdt layers: "<<m_hitLayers.mdtHits().size()
115 <<", strip layers: "<<m_hitLayers.stripHits().size()<<std::endl<<sstr.str()<<std::endl<<std::endl);
116 }
117 }
118
120 return m_nGenSeeds;
121 }
123 const HitVec& lower = m_hitLayers.mdtHits()[m_lowerLayer];
124 const HitVec& upper = m_hitLayers.mdtHits()[m_upperLayer];
126 if (++m_signComboIndex < s_signCombos.size()) {
127 return;
128 }
129 m_signComboIndex = 0;
130
132 if (moveToNextHit(lower, m_lowerHitIndex)) {
133 return;
134 }
136 if (firstGoodHit(lower, m_lowerHitIndex)) {
139 return;
140 }
141 }
144 while (m_lowerLayer < m_upperLayer) {
145 const HitVec& nextLower{m_hitLayers.mdtHits()[++m_lowerLayer]};
146 if (nextLower.size() > m_cfg.busyLayerLimit) {
147 continue;
148 }
150 if (firstGoodHit(nextLower, m_lowerHitIndex)) {
151 break;
152 }
153 }
154
157 return;
158 }
160 if (m_lowerLayer >= m_hitLayers.firstLayerFrom2ndMl() && numGenerated()){
162 return;
163 }
165 m_lowerLayer = 0;
166 do {
168 const HitVec& nextLower{m_hitLayers.mdtHits()[m_lowerLayer]};
169 if (nextLower.size() > m_cfg.busyLayerLimit) {
170 continue;
171 }
173 if (firstGoodHit(nextLower, m_lowerHitIndex)) {
174 break;
175 }
176 } while (++m_lowerLayer < m_upperLayer);
177
178 while (m_lowerLayer < m_upperLayer) {
179 const HitVec& nextUpper{m_hitLayers.mdtHits()[--m_upperLayer]};
180 if (nextUpper.size() > m_cfg.busyLayerLimit) {
181 continue;
182 }
183 if (firstGoodHit(nextUpper, m_upperHitIndex)) {
184 break;
185 }
186 }
187 }
188 std::optional<MdtSegmentSeedGenerator::DriftCircleSeed>
189 MdtSegmentSeedGenerator::nextSeed(const EventContext& ctx) {
190 std::optional<DriftCircleSeed> found = std::nullopt;
191 if (!m_nGenSeeds && m_cfg.startWithPattern) {
192 ++m_nGenSeeds;
193 found = std::make_optional<DriftCircleSeed>();
194 found->parameters = m_segmentSeed->parameters();
195 found->measurements = m_cfg.calibrator->calibrate(ctx,
196 m_segmentSeed->getHitsInMax(),
197 m_segmentSeed->localPosition(),
198 m_segmentSeed->localDirection(),0.);
199 found->parentBucket = m_segmentSeed->parentBucket();
200 found->nMdt = std::ranges::count_if(m_segmentSeed->getHitsInMax(),
201 [](const SpacePoint* hit){
202 return hit->type() == xAOD::UncalibMeasType::MdtDriftCircleType;
203 });
204 SeedSolution patternSeed{};
205 patternSeed.seedHits = m_segmentSeed->getHitsInMax();
206 patternSeed.solutionSigns.resize(2*m_hitLayers.mdtHits().size());
207 patternSeed.y0 = m_segmentSeed->interceptY();
208 patternSeed.theta = m_segmentSeed->tanBeta();
209 m_seenSolutions.push_back(std::move(patternSeed));
210 return found;
211 }
212
213 while (m_lowerLayer < m_upperLayer) {
214 const HitVec& lower = m_hitLayers.mdtHits().at(m_lowerLayer);
215 const HitVec& upper = m_hitLayers.mdtHits().at(m_upperLayer);
216 ATH_MSG_VERBOSE("Layers with hits: "<<m_hitLayers.mdtHits().size()
217 <<" -- next bottom hit: "<<m_lowerLayer<<", hit: "<<m_lowerHitIndex
218 <<" ("<<lower.size()<<"), top hit " <<m_upperLayer<<", "<<m_upperHitIndex
219 <<" ("<<upper.size()<<") - ambiguity "
220 <<LineSeeder_t::toString(s_signCombos[m_signComboIndex]));
221
226 if (found) {
227 return found;
228 }
229 }
230 return std::nullopt;
231 }
232 Line_t::ParamVector MdtSegmentSeedGenerator::constructLinePars(const double theta, const double y0) const {
233 Line_t::ParamVector pars{};
234 pars[Acts::toUnderlying(ParamDefs::y0)] = y0;
235 pars[Acts::toUnderlying(ParamDefs::x0)] = m_segmentSeed->interceptX();
236 if (Acts::abs(m_segmentSeed->tanAlpha()) > std::numeric_limits<double>::epsilon()) {
237 const Amg::Vector3D dirFromTan = Acts::makeDirectionFromAxisTangents(m_segmentSeed->tanAlpha(),
238 std::tan(theta));
239 pars[Acts::toUnderlying(ParamDefs::phi)] = dirFromTan.phi();
240 pars[Acts::toUnderlying(ParamDefs::theta)] = dirFromTan.theta();
241 } else {
242 pars[Acts::toUnderlying(ParamDefs::phi)] = 90._degree;
243 pars[Acts::toUnderlying(ParamDefs::theta)] = theta;
244 }
245 return pars;
246 }
248 if (solution.theta < m_cfg.thetaRange[0] ||
249 solution.theta > m_cfg.thetaRange[1]) {
250 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": The theta angle: "
251 <<(solution.theta / 1._degree)
252 <<" is out of the valid range ["<<(m_cfg.thetaRange[0] / 1._degree)
253 <<"-"<<(m_cfg.thetaRange[1] / 1._degree)<<"].");
254 return false;
255 }
256 if (solution.y0 < m_cfg.interceptRange[0] ||
257 solution.y0 > m_cfg.interceptRange[1]) {
258 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": The intercept: "
259 <<solution.y0
260 <<" is out of the valid range ["<<m_cfg.interceptRange[0]
261 <<"-"<<m_cfg.interceptRange[1] <<"].");
262 return false;
263 }
264 return true;
265
266 }
267 std::optional<MdtSegmentSeedGenerator::DriftCircleSeed>
268 MdtSegmentSeedGenerator::buildSeed(const EventContext& ctx,
269 const HoughHitType& topHit,
270 const HoughHitType& bottomHit,
271 const TangentAmbi ambi) {
272
273 const Muon::IMuonIdHelperSvc* idHelperSvc{topHit->msSector()->idHelperSvc()};
274 if (!isGoodDC(*bottomHit) || !isGoodDC(*topHit)) {
275 THROW_EXCEPTION("Bad hit detected, despite that should have been captured upstream "
276 <<isGoodDC(*bottomHit)<<", "<<isGoodDC(*topHit)<<" - lowerLayer: "<<m_lowerLayer
277 <<", upperLayer"<<m_upperLayer<<", "<<"upperHit: "<<m_upperHitIndex<<", lowerHit: "<<m_lowerHitIndex<<" - "
278 <<m_hitLayers.mdtHits().at(m_lowerLayer).size()<<", "<<m_hitLayers.mdtHits().at(m_upperLayer).size());
279 }
280
281 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Attempt to construct seed from "<<idHelperSvc->toString(bottomHit->identify())
282 <<" && top tube "<<idHelperSvc->toString(topHit->identify()));
283
284 SeedSolution solCandidate{};
285 static_cast<TangentLine&>(solCandidate) = LineSeeder_t::constructTangentLine(*topHit, *bottomHit, ambi);
286
287 solCandidate.theta = LineSeeder_t::makeDirection(*bottomHit, solCandidate.theta).theta();
288
289 if (!isValidLine(solCandidate)) {
290 return std::nullopt;
291 }
292
293 std::unique_ptr<CalibratedSpacePoint> calibBottom{}, calibTop{};
295 const double t0 = m_segmentSeed->parameters()[Acts::toUnderlying(ParamDefs::t0)];
296 if (m_cfg.recalibSeedCircles) {
297 m_line.updateParameters(constructLinePars(solCandidate.theta, solCandidate.y0));
300 calibBottom = m_cfg.calibrator->calibrate(ctx, bottomHit, m_line.position(), m_line.direction(), t0);
301 calibTop = m_cfg.calibrator->calibrate(ctx, topHit, m_line.position(), m_line.direction(), t0);
302 static_cast<TangentLine&>(solCandidate) = LineSeeder_t::constructTangentLine(*calibTop, *calibBottom, ambi);
303 solCandidate.theta = LineSeeder_t::makeDirection(*calibBottom, solCandidate.theta).theta();
304 if (!isValidLine(solCandidate)) {
305 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Recalibrated segment seed is invalid");
306 return std::nullopt;
307 }
308 }
309
310 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Test new "<<solCandidate<<". "<<m_seenSolutions.size());
311
312 if (std::ranges::find_if(m_seenSolutions,
313 [&solCandidate, this] (const SeedSolution& seen) {
314 const double deltaY = std::abs(seen.y0 - solCandidate.y0);
315 const double limitY = std::hypot(seen.dY0, solCandidate.dY0);
316 const double dTheta = std::abs(seen.theta - solCandidate.theta);
317 const double limitTh = std::hypot(seen.dTheta, solCandidate.dTheta);
318 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": "<<seen
319 <<std::format(" delta Y: {:.2f} {:} {:.2f}", deltaY, deltaY < limitY ? '<' : '>', limitY)
320 <<std::format(" delta theta: {:.2f} {:} {:.2f}", dTheta, dTheta < limitTh ? '<' : '>', limitTh) );
321 return deltaY < limitY && dTheta < limitTh;;
322 }) != m_seenSolutions.end()){
323 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Reject due to similarity");
324 return std::nullopt;
325 }
326
327 DriftCircleSeed candidateSeed{};
328 candidateSeed.parentBucket = m_segmentSeed->parentBucket();
329
330 const auto finalSeedPars = constructLinePars(solCandidate.theta,solCandidate.y0);
331 m_line.updateParameters(finalSeedPars);
333 for (const auto [layerNr, hitsInLayer] : Acts::enumerate(m_hitLayers.mdtHits())) {
334 ATH_MSG_VERBOSE( __func__<<"() "<<__LINE__<<": "<<hitsInLayer.size()<<" hits in layer "<<(layerNr +1));
335 bool hadGoodHit{false};
336 for (const HoughHitType testMe : hitsInLayer) {
337 using namespace Acts::detail::LineHelper;
338 const double distance = Acts::abs(signedDistance(testMe->localPosition(), testMe->sensorDirection(),
339 m_line.position(), m_line.direction()));
340 const double pull = Acts::abs(distance - testMe->driftRadius()) / std::sqrt(testMe->covariance()[covIdx]);
341
342 const auto* re = static_cast<const xAOD::MdtDriftCircle*>(testMe->primaryMeasurement())->readoutElement();
343
344 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Test hit "<<idHelperSvc->toString(testMe->identify())
345 <<" "<<Amg::toString(testMe->localPosition())<<", pull: "<<pull<<", distance: "<<distance);
346 if (pull < m_cfg.hitPullCut && distance < re->tubeRadius()) {
347 hadGoodHit = true;
348 solCandidate.seedHits.emplace_back(testMe);
349 candidateSeed.nMdt += isGoodDC(*testMe);
350 }
351 else if (hadGoodHit) {
352 break;
353 }
354 }
355 }
357 const unsigned hitCut = std::max(1.*m_cfg.nMdtHitCut,
358 m_cfg.nMdtLayHitCut * m_hitLayers.mdtHits().size());
359
360 if (1.*candidateSeed.nMdt < hitCut) {
361 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Too few hits associated "<<candidateSeed.nMdt<<", expect: "<<hitCut<<" hits.");
362 return std::nullopt;
363 }
364 /* Calculate the left-right signs of the used hits */
365 if (m_cfg.overlapCorridor) {
366 solCandidate.solutionSigns = SeedingAux::strawSigns(m_line, solCandidate.seedHits);
367 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Circle solutions for seed "
368 <<idHelperSvc->toStringChamber(bottomHit->identify())<<" - "<<solCandidate);
370 for (unsigned int a = m_cfg.startWithPattern; a< m_seenSolutions.size() ;++a) {
371 const SeedSolution& accepted = m_seenSolutions[a];
372 unsigned int nOverlap{0};
373 std::vector<int> corridor = SeedingAux::strawSigns(m_line, accepted.seedHits);
374 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Test seed against accepted "<<accepted<<", updated signs: "<<corridor);
376 for (unsigned int l = 0; l < accepted.seedHits.size(); ++l){
377 nOverlap += (corridor[l] == accepted.solutionSigns[l]);
378 }
381 if (nOverlap == corridor.size() && accepted.seedHits.size() >= solCandidate.seedHits.size()) {
382 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Same set of hits collected within the same corridor");
383 return std::nullopt;
384 }
385 }
386 }
387 candidateSeed.parameters[Acts::toUnderlying(ParamDefs::t0)] = t0;
388 for (const auto p : { ParamDefs::x0, ParamDefs::theta, ParamDefs::phi, ParamDefs::y0}) {
389 candidateSeed.parameters[Acts::toUnderlying(p)] = finalSeedPars[Acts::toUnderlying(p)];
390 }
392 for (const HoughHitType& hit : solCandidate.seedHits){
393 //calibBottom is nullptr after it has been moved, so...
394 //cppcheck-suppress accessMoved
395 if (hit == bottomHit && calibBottom) {
396 candidateSeed.measurements.emplace_back(std::move(calibBottom));
397 }
398 //calibTop is nullptr after it has been moved, so...
399 //cppcheck-suppress accessMoved
400 else if (hit == topHit && calibTop) {
401 candidateSeed.measurements.emplace_back(std::move(calibTop));
402 } else {
403 candidateSeed.measurements.emplace_back(m_cfg.calibrator->calibrate(ctx, hit, m_line.position(),
404 m_line.direction(), t0));
405 }
406 }
407
409 m_seenSolutions.emplace_back(std::move(solCandidate));
412 if (m_cfg.tightenHitCut) {
413 m_cfg.nMdtHitCut = std::max(m_cfg.nMdtHitCut, candidateSeed.nMdt);
414 }
415 ++m_nGenSeeds;
416 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": In event "<<ctx.eventID().event_number()<<" found new seed solution "<<toString(candidateSeed.parameters));
417
419 for (const std::vector<HoughHitType>& hitsInLayer : m_hitLayers.stripHits()) {
420 HoughHitType bestHitLoc0{nullptr}, bestHitLoc1{nullptr};
421 double bestPullLoc0{m_cfg.hitPullCut}, bestPullLoc1{m_cfg.hitPullCut};
422 for (const HoughHitType testMe : hitsInLayer) {
423 const double pull = std::sqrt(SeedingAux::chi2Term(m_line, *testMe));
424 ATH_MSG_VERBOSE(__func__<<"() "<<__LINE__<<": Test hit "<<idHelperSvc->toString(testMe->identify())
425 <<" "<<Amg::toString(testMe->localPosition())<<", pull: "<<pull<<".");
426 if (testMe->measuresLoc0() && pull < bestPullLoc0) {
427 bestPullLoc0 = pull;
428 bestHitLoc0 = testMe;
429 }
430 if (testMe->measuresLoc1() && pull < bestPullLoc1) {
431 bestPullLoc1 = pull;
432 bestHitLoc1 = testMe;
433 }
434 }
435 if (bestHitLoc0) {
436 candidateSeed.measurements.push_back(m_cfg.calibrator->calibrate(ctx, bestHitLoc0, m_line.position(),
437 m_line.direction(), t0));
438 }
439 if (bestHitLoc1 && bestHitLoc1 != bestHitLoc0) {
440 candidateSeed.measurements.push_back(m_cfg.calibrator->calibrate(ctx, bestHitLoc1, m_line.position(),
441 m_line.direction(), t0));
442 }
443
444 }
445 return candidateSeed;
446 }
447}
const boost::regex re(r_e)
Scalar theta() const
theta method
#define ATH_MSG_VERBOSE(x)
std::vector< size_t > vec
int upper(int c)
static Double_t a
static Double_t t0
bool msgLvl(const MSG::Level lvl) const
Test the output level.
AthMessaging(IMessageSvc *msgSvc, const std::string &name)
Constructor.
const Muon::IMuonIdHelperSvc * idHelperSvc() const
Returns the IdHelpeSvc.
std::size_t m_signComboIndex
Index of the left-right ambiguity between the circles.
Line_t m_line
Line to instantiate the seed parameters.
bool isValidLine(const TangentLine &solution) const
Checks whether the intercept and the angle are witihn the allowed ranges.
LineSeeder_t::TwoCircleTangentPars TangentLine
unsigned int numGenerated() const
Returns how many seeds have been generated.
std::size_t m_upperLayer
Considered layer to pick the top drift circle from.
std::size_t m_lowerHitIndex
Explicit hit to pick in the selected bottom layer.
std::size_t m_lowerLayer
Considered layer to pick the bottom drift circle from.
std::vector< SeedSolution > m_seenSolutions
Vector caching equivalent solutions to avoid double seeding.
static constexpr std::array< TangentAmbi, 4 > s_signCombos
std::optional< DriftCircleSeed > buildSeed(const EventContext &ctx, const HoughHitType &topHit, const HoughHitType &bottomHit, const TangentAmbi ambi)
Tries to build the seed from the two hits.
const Config & config() const
Returns the current seed configuration.
MdtSegmentSeedGenerator(const std::string &name, const SegmentSeed *segmentSeed, const Config &configuration)
Standard constructor taking the segmentSeed to start with and then few configuration tunes.
Line_t::ParamVector constructLinePars(const double theta, const double y0) const
Construct the 3D-Line parameters from the estimates theta & y0 from the tangent line.
void moveToNextCandidate()
Prepares the generator to generate the seed from the next pair of drift circles.
unsigned int m_nGenSeeds
Counter on how many seeds have been generated.
std::size_t m_upperHitIndex
Explicit hit to pick in the selected top layer.
std::optional< DriftCircleSeed > nextSeed(const EventContext &ctx)
returns the next seed in the row
Representation of a segment seed (a fully processed hough maximum) produced by the hough transform.
Definition SegmentSeed.h:14
std::vector< const SpacePoint * > HitVec
The muon space point is the combination of two uncalibrated measurements one of them measures the eta...
const Identifier & identify() const
: Identifier of the primary measurement
const xAOD::UncalibratedMeasurement * primaryMeasurement() const
Interface for Helper service that creates muon Identifiers and can be used to print Identifiers.
virtual std::string toStringChamber(const Identifier &id) const =0
print all fields up to chamber to string
virtual std::string toString(const Identifier &id) const =0
print all fields to string
virtual xAOD::UncalibMeasType type() const =0
Returns the type of the measurement type as a simple enumeration.
std::string toString(const Translation3D &translation, int precision=4)
GeoPrimitvesToStringConverter.
Eigen::Matrix< double, 3, 1 > Vector3D
SpacePointPerLayerSplitter::HitLayVec HitLayerVec
Muon::MdtDriftCircleStatus dcStatus(const SpacePoint &dc)
bool moveToNextHit(const HitVec &hits, std::size_t &hitIdx)
Move to the next space point with valid drift radius.
SpacePointPerLayerSplitter::HitVec HitVec
bool isGoodDC(const SpacePoint &dc)
Returns whether the Mdt measurement has a valid space point.
std::string toString(const Parameters &pars)
Dumps the parameters into a string with labels in front of each number.
bool firstGoodHit(const HitVec &hits, std::size_t &hitIdx)
Find the first good hit in a layer.
const SpacePoint * HoughHitType
MdtDriftCircleStatus
Enum to represent the 'status' of Mdt measurements e.g.
MdtDriftCircle_v1 MdtDriftCircle
UncalibratedMeasurement_v1 UncalibratedMeasurement
Define the version of the uncalibrated measurement class.
Helper to simultaneously calculate sin and cos of the same angle.
std::vector< std::unique_ptr< CalibratedSpacePoint > > measurements
List of calibrated measurements.
const SpacePointBucket * parentBucket
Pointer to the parent bucket.
std::vector< int > solutionSigns
Vector of radial signs of the valid hits.
#define THROW_EXCEPTION(MESSAGE)
Definition throwExcept.h:10