Flash-Fit Algorithms for Circles in Particle Physics
Circle fit routines are used in helix reconstruction for tracking and in ring reconstruction for particle ID. While accurate fits can be achieved with iterative fits, often resolution can be relaxed in favor of speed. We present and compare two flash-algorithms in terms of resolution, CPU speed and mathematical advantage (linearity). The second algorithm is novel.
Authors
- M. Dima (ORCID: https://orcid.org/0000-0002-9307-5321)
- M.-T. Dima
- M. Mihailescu
Institutions
- Joint Institute for Nuclear Research (RU)
- Hyperion University (RO)
Publication Details
- Journal
- Physics of Particles and Nuclei Letters
- Published
- 2024-08-01
- DOI
- https://doi.org/10.1134/s1547477124701395
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 0.00