Speaker
A. Wildauer
(UNIVERSITY OF INNSBRUCK)
Description
For physics analysis in ATLAS, reliable vertex finding and
fitting algorithms are important. In the harsh enviroment
of the LHC (~ 23 inelastic collissions every 25 ns) this task
turns out to be particularily challenging. One of the guiding
principles in developing the vertexing packages is a strong
focus on modularity and defined interfaces using the advantages
of object oriented C++. The benefit is the easy expandability
of the vertexing with additional fitting strategies integrated
in the Athena framework.
Various implementations of algorithms and strategies dedicated
to primary and secondary vertex reconstruction using the full
reconstruction of simulated ATLAS events are presented.
Primary and secondary vertex finding is essential for the
identification of b-jets in a reconstructed event. Results from
a modular and expandable b-tagging algorithm are shown using
the presented strategies for vertexing.
Primary authors
A. Wildauer
(UNIVERSITY OF INNSBRUCK)
F. Akesson
(CERN)
