-
Notifications
You must be signed in to change notification settings - Fork 171
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat: Track parameters lookup estimation examples #3823
feat: Track parameters lookup estimation examples #3823
Conversation
Important Review skippedAuto reviews are limited to specific labels. 🏷️ Labels to auto review (1)
Please check the settings in the CodeRabbit UI or the You can disable this status message by setting the Thank you for using CodeRabbit. We offer it for free to the OSS community and would appreciate your support in helping us grow. If you find it useful, would you consider giving us a shout-out on your favorite social media? 🪧 TipsChatThere are 3 ways to chat with CodeRabbit:
Note: Be mindful of the bot's finite context window. It's strongly recommended to break down tasks such as reading entire modules into smaller chunks. For a focused discussion, use review comments to chat about specific files and their changes, instead of using the PR comments. CodeRabbit Commands (Invoked using PR comments)
Other keywords and placeholders
CodeRabbit Configuration File (
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is really could. A few thoughts:
- Could the logic be split up so that the accumulation code itself is reusable and in Core and the orchestration is in the examples?
- this is not tied to the gen2 geometry is it?
- Can this be generalized to bound parameters or do you need it to be curvilinear? In particular I imagine this could be useful in non-telescope setups, where you might want to use e.g. perigee parameters
Examples/Algorithms/TrackFinding/include/ActsExamples/TrackFinding/TrackParamsLookupTable.hpp
Outdated
Show resolved
Hide resolved
Examples/Algorithms/TrackFinding/src/TrackParamsLookupAccumulator.cpp
Outdated
Show resolved
Hide resolved
Examples/Algorithms/TrackFinding/include/ActsExamples/TrackFinding/TrackParamsLookupTable.hpp
Outdated
Show resolved
Hide resolved
Examples/Algorithms/TrackFinding/src/TrackParamsLookupEstimation.cpp
Outdated
Show resolved
Hide resolved
Examples/Io/Json/include/ActsExamples/Io/Json/JsonTrackParamsLookupWriter.hpp
Outdated
Show resolved
Hide resolved
Examples/Algorithms/TrackFinding/src/TrackParamsLookupAccumulator.cpp
Outdated
Show resolved
Hide resolved
Core/include/Acts/TrackFinding/TrackParamsLookupAccumulator.hpp
Outdated
Show resolved
Hide resolved
Core/include/Acts/TrackFinding/TrackParamsLookupAccumulator.hpp
Outdated
Show resolved
Hide resolved
Quality Gate passedIssues Measures |
The PR adding the simulation based track parameter estimation.
The algorithm runs the
Fatras
simulation of the detector setup. A set of grids is imposed onto the user-defined reference layers of the tracking detector (e.g. first tracking layers sensitive surfaces).CurvilinearTrackParameters
at the vertex and the reference tracking layers are recorded for the simulated particles and stored into the bins of the grids.After the simulation is finished, the contents of the grids' bins are averaged and the grids containing the correspondence between the particles' intersection points at the reference layers, track parameters at the vertex and track parameters at the reference layers are constructed.
The constructed grids are stored into the json files. The grids are then readout and used for track parameters estimation in seeding algorithms, e.g. connected to the
PathSeeder
.This PR contains the lookup generation part of the algorithm. When the interfaces, realisation and the general idea are agreed upon, the second part with the validation of the estimated lookups is going to be put up.