Skip to content
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

Border problem #33

Open
MaxSac opened this issue Jan 14, 2020 · 1 comment
Open

Border problem #33

MaxSac opened this issue Jan 14, 2020 · 1 comment

Comments

@MaxSac
Copy link
Contributor

MaxSac commented Jan 14, 2020

Muons are particle which are for the most part deflect by multiple scattering. In the most cases, their direction of propagation as an approximation can be assumed to be a straight line, because their losses causes small deflections d as shown in figure.
As a consequence that distance calculation to the next border is quite expensive, algorithm have been developed which calculated them as less than possible.
They are based on the assumption that the propagated distance through a sector can fully describe through a straight line. The highest sector will be chosen and the distance from particle position to the expected border calculated. There will be so many propagation steps in the sector until the supposed border is reached and the distance to the next sector border is calculated.
If a particle leaf the sector earlier than described by the straight line, the particle is propagated a part through the other sector with wrong condition. (Path 2 in figure) The same failure causes, that there will be more corner clipper measured as simulated. This can be avoided by oversizing the detector.

border_problem

@sudojan
Copy link
Contributor

sudojan commented Mar 12, 2022

This should have been solved in parts in #137 and finally in #267 or?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants