Difference: VeloGenericTracking (1 vs. 2)

Revision 22008-05-21 - TomasLastovicka

Line: 1 to 1
 
META TOPICPARENT name="LHCbPatternRecognition"

VeloGenericTracking

Changed:
<
<
A space point based tracking algorithm. The R and Phi clusters are combined into space points which are linked into tracks. This method is slower than other pattern recognition algorithms, but provides very clean tracks. It was used to reconstruct the ACDC3 testbeam data. An LHCb internal note written by Tomas Lastoviicka (Tomas.Lastovicka@cernNOSPAMPLEASE.ch) details the algorithm.
>
>
A generic tracking algorithm. The R and Phi clusters are linked into tracks if they can be fitted with a 3D straight line. This method is slower than other pattern recognition algorithms, but provides very clean tracks. It was used to reconstruct the ACDC3 testbeam data. An LHCb internal note written by Tomas Lastovicka (Tomas.Lastovicka@cernNOSPAMPLEASE.ch) details the algorithm.
 

-- DavidHutchcroft - 30 Apr 2008

Added:
>
>
-- TomasLastovicka - 21 May 2008
 \ No newline at end of file

Revision 12008-04-30 - DavidHutchcroft

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="LHCbPatternRecognition"

VeloGenericTracking

A space point based tracking algorithm. The R and Phi clusters are combined into space points which are linked into tracks. This method is slower than other pattern recognition algorithms, but provides very clean tracks. It was used to reconstruct the ACDC3 testbeam data. An LHCb internal note written by Tomas Lastoviicka (Tomas.Lastovicka@cernNOSPAMPLEASE.ch) details the algorithm.

-- DavidHutchcroft - 30 Apr 2008

 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright & 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback