#include <RecoVertex/LinearizationPointFinders/interface/FsmwLinearizationPointFinder.h>
Public Member Functions | ||||
virtual FsmwLinearizationPointFinder * | clone () const | |||
Clone method. | ||||
FsmwLinearizationPointFinder (const RecTracksDistanceMatrix *m, signed int n_pairs=250, float weight_exp=-2., float fraction=.5, float cut=10, int no_weight_above=10) | ||||
FsmwLinearizationPointFinder (signed int n_pairs=250, float weight_exp=-2., float fraction=.5, float cut=10, int no_weight_above=10) | ||||
|
It works the following way: 1. Calculate in an optimal way 'n_pairs' different crossing points. Optimal in this context means the following: a. Try to use as many different tracks as possible; avoid using the same track all the time. b. Use the most energetic tracks. c. Try not to group the most energetic tracks together. Try to group more energetic tracks with less energetic tracks. We assume collimated bundles here, so this is why. d. Perform optimally. Do not sort more tracks (by total energy, see b) than necessary. e. If n_pairs >= (number of all possible combinations), do not leave any combinations out. ( a. and e. are almost but not entirely fulfilled in the current impl ) 2. Do a Fsmw on the n points.
Definition at line 23 of file FsmwLinearizationPointFinder.h.
FsmwLinearizationPointFinder::FsmwLinearizationPointFinder | ( | signed int | n_pairs = 250 , |
|
float | weight_exp = -2. , |
|||
float | fraction = .5 , |
|||
float | cut = 10 , |
|||
int | no_weight_above = 10 | |||
) |
n_pairs | how many track pairs are considered The weight is defined as w = ( d + cut )^weight_exp Where d and cut are given in microns. |
weight_exp | exponent of the weight function | |
cut | cut parameter of the weight function | |
fraction | Fraction that is considered |
Definition at line 4 of file FsmwLinearizationPointFinder.cc.
Referenced by clone().
00005 : 00006 CrossingPtBasedLinearizationPointFinder ( FsmwModeFinder3d(frac,we,cut,nwa), n_pairs ) 00007 { }
FsmwLinearizationPointFinder::FsmwLinearizationPointFinder | ( | const RecTracksDistanceMatrix * | m, | |
signed int | n_pairs = 250 , |
|||
float | weight_exp = -2. , |
|||
float | fraction = .5 , |
|||
float | cut = 10 , |
|||
int | no_weight_above = 10 | |||
) |
Definition at line 9 of file FsmwLinearizationPointFinder.cc.
00011 : 00012 CrossingPtBasedLinearizationPointFinder ( m , 00013 FsmwModeFinder3d( frac,we,cut,nwa ), n_pairs ) 00014 { }
FsmwLinearizationPointFinder * FsmwLinearizationPointFinder::clone | ( | ) | const [virtual] |
Clone method.
Reimplemented from CrossingPtBasedLinearizationPointFinder.
Definition at line 16 of file FsmwLinearizationPointFinder.cc.
References FsmwLinearizationPointFinder().
00018 { 00019 return new FsmwLinearizationPointFinder ( * this ); 00020 }