CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
List of all members | Public Types | Public Member Functions | Protected Member Functions | Private Member Functions | Private Attributes
SequentialVertexFitter< N > Class Template Reference

#include <SequentialVertexFitter.h>

Inheritance diagram for SequentialVertexFitter< N >:
VertexFitter< N >

Public Types

typedef
ReferenceCountingPointer
< LinearizedTrackState< N > > 
RefCountedLinearizedTrackState
 
typedef
ReferenceCountingPointer
< RefittedTrackState< N > > 
RefCountedRefittedTrackState
 
typedef
ReferenceCountingPointer
< VertexTrack< N > > 
RefCountedVertexTrack
 

Public Member Functions

SequentialVertexFitterclone () const
 
const LinearizationPointFinderlinearizationPointFinder () const
 
const AbstractLTSFactory< N > * linearizedTrackStateFactory () const
 
const float maxShift () const
 
const int maxStep () const
 
const edm::ParameterSet parameterSet () const
 
 SequentialVertexFitter (const LinearizationPointFinder &linP, const VertexUpdator< N > &updator, const VertexSmoother< N > &smoother, const AbstractLTSFactory< N > &ltsf)
 
 SequentialVertexFitter (const edm::ParameterSet &pSet, const LinearizationPointFinder &linP, const VertexUpdator< N > &updator, const VertexSmoother< N > &smoother, const AbstractLTSFactory< N > &ltsf)
 
 SequentialVertexFitter (const SequentialVertexFitter &original)
 
void setMaximumDistance (float maxShift)
 
void setMaximumNumberOfIterations (int maxIterations)
 
virtual CachingVertex< Nvertex (const std::vector< reco::TransientTrack > &tracks) const
 
virtual CachingVertex< Nvertex (const std::vector< RefCountedVertexTrack > &tracks) const
 
virtual CachingVertex< Nvertex (const std::vector< RefCountedVertexTrack > &tracks, const reco::BeamSpot &spot) const
 
virtual CachingVertex< Nvertex (const std::vector< reco::TransientTrack > &tracks, const GlobalPoint &linPoint) const
 
virtual CachingVertex< Nvertex (const std::vector< reco::TransientTrack > &tracks, const reco::BeamSpot &beamSpot) const
 
virtual CachingVertex< Nvertex (const std::vector< reco::TransientTrack > &tracks, const GlobalPoint &priorPos, const GlobalError &priorError) const
 
virtual CachingVertex< Nvertex (const std::vector< RefCountedVertexTrack > &tracks, const GlobalPoint &priorPos, const GlobalError &priorError) const
 
const VertexSmoother< N > * vertexSmoother () const
 
const VertexUpdator< N > * vertexUpdator () const
 
virtual ~SequentialVertexFitter ()
 
- Public Member Functions inherited from VertexFitter< N >
virtual CachingVertex< Nvertex (const std::vector< typename CachingVertex< N >::RefCountedVertexTrack > &tracks) const =0
 
virtual CachingVertex< Nvertex (const std::vector< typename CachingVertex< N >::RefCountedVertexTrack > &tracks, const reco::BeamSpot &spot) const =0
 
virtual CachingVertex< Nvertex (const std::vector< typename CachingVertex< N >::RefCountedVertexTrack > &tracks, const GlobalPoint &priorPos, const GlobalError &priorError) const =0
 
 VertexFitter ()
 
virtual ~VertexFitter ()
 

Protected Member Functions

 SequentialVertexFitter ()
 

Private Member Functions

CachingVertex< Nfit (const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
 
bool hasNan (const GlobalPoint &point) const
 
std::vector
< RefCountedVertexTrack
linearizeTracks (const std::vector< reco::TransientTrack > &tracks, const VertexState state) const
 
void readParameters ()
 
std::vector
< RefCountedVertexTrack
reLinearizeTracks (const std::vector< RefCountedVertexTrack > &tracks, const VertexState state) const
 
void setDefaultParameters ()
 

Private Attributes

LinearizationPointFindertheLinP
 
const AbstractLTSFactory< N > * theLTrackFactory
 
float theMaxShift
 
int theMaxStep
 
edm::ParameterSet thePSet
 
VertexSmoother< N > * theSmoother
 
VertexUpdator< N > * theUpdator
 
VertexTrackFactory< NtheVTrackFactory
 

Detailed Description

template<unsigned int N>
class SequentialVertexFitter< N >

Sequential vertex fitter, where the vertex is updated one track at the time. The fitter will iterate over the set of tracks until the transverse distance between vertices computed in the previous and the current iterations is less than the specified convergence criteria, or until the maximum number of iterations is reached. The transverse distance determines the linearization error. The default convergence criterion is 1 mm. The default maximum number of steps is 10. These parameters can be configured in .orcarc ( SequentialVertexFitter:maximumDistance and SequentialVertexFitter:maximumNumberOfIterations). After the vertex fit, the tracks can be refit with the additional constraint of the vertex position.

Definition at line 35 of file SequentialVertexFitter.h.

Member Typedef Documentation

Definition at line 41 of file SequentialVertexFitter.h.

Definition at line 39 of file SequentialVertexFitter.h.

Definition at line 40 of file SequentialVertexFitter.h.

Constructor & Destructor Documentation

template<unsigned int N>
SequentialVertexFitter< N >::SequentialVertexFitter ( const LinearizationPointFinder linP,
const VertexUpdator< N > &  updator,
const VertexSmoother< N > &  smoother,
const AbstractLTSFactory< N > &  ltsf 
)

Reimplemented constructors to use any kind of linearisation point finder, vertex updator and smoother. If no smoother is to be used, do not specify an instance for it.

Definition at line 23 of file SequentialVertexFitter.cc.

References SequentialVertexFitter< N >::setDefaultParameters().

26  :
27  theLinP(linP.clone()), theUpdator(updator.clone()),
28  theSmoother(smoother.clone()), theLTrackFactory ( ltsf.clone() )
29 {
31 }
LinearizationPointFinder * theLinP
VertexUpdator< N > * theUpdator
virtual VertexSmoother * clone() const =0
const AbstractLTSFactory< N > * theLTrackFactory
virtual const AbstractLTSFactory * clone() const =0
virtual LinearizationPointFinder * clone() const =0
virtual VertexUpdator * clone() const =0
VertexSmoother< N > * theSmoother
template<unsigned int N>
SequentialVertexFitter< N >::SequentialVertexFitter ( const edm::ParameterSet pSet,
const LinearizationPointFinder linP,
const VertexUpdator< N > &  updator,
const VertexSmoother< N > &  smoother,
const AbstractLTSFactory< N > &  ltsf 
)

Same as above, using a ParameterSet to set the convergence criteria

Definition at line 34 of file SequentialVertexFitter.cc.

References SequentialVertexFitter< N >::readParameters().

37  :
38  thePSet(pSet), theLinP(linP.clone()), theUpdator(updator.clone()),
39  theSmoother(smoother.clone()), theLTrackFactory ( ltsf.clone() )
40 {
42 }
LinearizationPointFinder * theLinP
VertexUpdator< N > * theUpdator
virtual VertexSmoother * clone() const =0
const AbstractLTSFactory< N > * theLTrackFactory
virtual const AbstractLTSFactory * clone() const =0
virtual LinearizationPointFinder * clone() const =0
virtual VertexUpdator * clone() const =0
VertexSmoother< N > * theSmoother
template<unsigned int N>
SequentialVertexFitter< N >::SequentialVertexFitter ( const SequentialVertexFitter< N > &  original)

Copy constructor

Definition at line 46 of file SequentialVertexFitter.cc.

References LinearizationPointFinder::clone(), SequentialVertexFitter< N >::linearizationPointFinder(), SequentialVertexFitter< N >::linearizedTrackStateFactory(), SequentialVertexFitter< N >::maxShift(), SequentialVertexFitter< N >::maxStep(), SequentialVertexFitter< N >::parameterSet(), SequentialVertexFitter< N >::vertexSmoother(), and SequentialVertexFitter< N >::vertexUpdator().

48 {
49  thePSet = original.parameterSet();
50  theLinP = original.linearizationPointFinder()->clone();
51  theUpdator = original.vertexUpdator()->clone();
52  theSmoother = original.vertexSmoother()->clone();
53  theMaxShift = original.maxShift();
54  theMaxStep = original.maxStep();
55  theLTrackFactory = original.linearizedTrackStateFactory()->clone();
56 }
LinearizationPointFinder * theLinP
const VertexUpdator< N > * vertexUpdator() const
VertexUpdator< N > * theUpdator
const AbstractLTSFactory< N > * theLTrackFactory
const AbstractLTSFactory< N > * linearizedTrackStateFactory() const
const VertexSmoother< N > * vertexSmoother() const
const edm::ParameterSet parameterSet() const
virtual LinearizationPointFinder * clone() const =0
const float maxShift() const
VertexSmoother< N > * theSmoother
const LinearizationPointFinder * linearizationPointFinder() const
template<unsigned int N>
SequentialVertexFitter< N >::~SequentialVertexFitter ( )
virtual

Definition at line 60 of file SequentialVertexFitter.cc.

61 {
62  delete theLinP;
63  delete theUpdator;
64  delete theSmoother;
65  delete theLTrackFactory;
66 }
LinearizationPointFinder * theLinP
VertexUpdator< N > * theUpdator
const AbstractLTSFactory< N > * theLTrackFactory
VertexSmoother< N > * theSmoother
template<unsigned int N>
SequentialVertexFitter< N >::SequentialVertexFitter ( )
inlineprotected

Default constructor. Is here, as we do not want anybody to use it.

Definition at line 193 of file SequentialVertexFitter.h.

Referenced by SequentialVertexFitter< 5 >::clone().

193 {}

Member Function Documentation

template<unsigned int N>
SequentialVertexFitter* SequentialVertexFitter< N >::clone ( ) const
inlinevirtual

Fit vertex out of a VertexSeed

Implements VertexFitter< N >.

Definition at line 180 of file SequentialVertexFitter.h.

Referenced by GsfVertexFitter::GsfVertexFitter().

180  {
181  return new SequentialVertexFitter(* this);
182  }
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::fit ( const std::vector< RefCountedVertexTrack > &  tracks,
const VertexState  priorVertex,
bool  withPrior 
) const
private

The methode where the vrte fit is actually done. The seed is used as the prior estimate in the vertex fit (in case its error is large, it will have little influence on the fit. The tracks will be relinearized in case further loops are needed. tracks The tracks to use in the fit. priorVertex The prior estimate of the vertex

Returns
The fitted vertex

Definition at line 258 of file SequentialVertexFitter.cc.

References VertexState::error(), relativeConstraints::error, i, CachingVertex< N >::isValid(), LogDebug, VertexState::position(), CachingVertex< N >::position(), relval_parameters_module::step, testEve_cfg::tracks, transverse(), and CachingVertex< N >::vertexState().

260 {
261  std::vector<RefCountedVertexTrack> initialTracks;
262  GlobalPoint priorVertexPosition = priorVertex.position();
263  GlobalError priorVertexError = priorVertex.error();
264 
265  CachingVertex<N> returnVertex(priorVertexPosition,priorVertexError,initialTracks,0);
266  if (withPrior) {
267  returnVertex = CachingVertex<N>(priorVertexPosition,priorVertexError,
268  priorVertexPosition,priorVertexError,initialTracks,0);
269  }
270  CachingVertex<N> initialVertex = returnVertex;
271  std::vector<RefCountedVertexTrack> globalVTracks = tracks;
272 
273  // main loop through all the VTracks
274  bool validVertex = true;
275  int step = 0;
276  GlobalPoint newPosition = priorVertexPosition;
277  GlobalPoint previousPosition;
278  do {
279  CachingVertex<N> fVertex = initialVertex;
280  // make new linearized and vertex tracks for the next iteration
281  if(step != 0) globalVTracks = reLinearizeTracks(tracks,
282  returnVertex.vertexState());
283 
284  // update sequentially the vertex estimate
285  for (typename std::vector<RefCountedVertexTrack>::const_iterator i
286  = globalVTracks.begin(); i != globalVTracks.end(); i++) {
287  fVertex = theUpdator->add(fVertex,*i);
288  if (!fVertex.isValid()) break;
289  }
290 
291  validVertex = fVertex.isValid();
292  // check tracker bounds and NaN in position
293  if (validVertex && hasNan(fVertex.position())) {
294  LogDebug("RecoVertex/SequentialVertexFitter")
295  << "Fitted position is NaN.\n";
296  validVertex = false;
297  }
298 
299  if (validVertex && !insideTrackerBounds(fVertex.position())) {
300  LogDebug("RecoVertex/SequentialVertexFitter")
301  << "Fitted position is out of tracker bounds.\n";
302  validVertex = false;
303  }
304 
305  if (!validVertex) {
306  // reset initial vertex position to (0,0,0) and force new iteration
307  // if number of steps not exceeded
308  ROOT::Math::SMatrixIdentity id;
309  AlgebraicSymMatrix33 we(id);
310  GlobalError error(we*10000);
311  fVertex = CachingVertex<N>(GlobalPoint(0,0,0), error,
312  initialTracks, 0);
313  }
314 
315  previousPosition = newPosition;
316  newPosition = fVertex.position();
317 
318  returnVertex = fVertex;
319  globalVTracks.clear();
320  step++;
321  } while ( (step != theMaxStep) &&
322  (((previousPosition - newPosition).transverse() > theMaxShift) ||
323  (!validVertex) ) );
324 
325  if (!validVertex) {
326  LogDebug("RecoVertex/SequentialVertexFitter")
327  << "Fitted position is invalid (out of tracker bounds or has NaN). Returned vertex is invalid\n";
328  return CachingVertex<N>(); // return invalid vertex
329  }
330 
331  if (step >= theMaxStep) {
332  LogDebug("RecoVertex/SequentialVertexFitter")
333  << "The maximum number of steps has been exceeded. Returned vertex is invalid\n";
334  return CachingVertex<N>(); // return invalid vertex
335  }
336 
337  // smoothing
338  returnVertex = theSmoother->smooth(returnVertex);
339 
340  return returnVertex;
341 }
#define LogDebug(id)
int i
Definition: DBlmapReader.cc:9
std::vector< RefCountedVertexTrack > reLinearizeTracks(const std::vector< RefCountedVertexTrack > &tracks, const VertexState state) const
VertexUpdator< N > * theUpdator
Global3DPoint GlobalPoint
Definition: GlobalPoint.h:10
GlobalPoint position() const
Definition: VertexState.h:50
ROOT::Math::SMatrix< double, 3, 3, ROOT::Math::MatRepSym< double, 3 > > AlgebraicSymMatrix33
tuple tracks
Definition: testEve_cfg.py:39
GlobalPoint position() const
T transverse() const
Another name for perp()
bool isValid() const
Definition: CachingVertex.h:96
GlobalError error() const
Definition: VertexState.h:55
bool hasNan(const GlobalPoint &point) const
VertexSmoother< N > * theSmoother
template<unsigned int N>
bool SequentialVertexFitter< N >::hasNan ( const GlobalPoint point) const
inlineprivate

Checks whether any of the three coordinates is a Nan

Definition at line 244 of file SequentialVertexFitter.h.

244  {
245  using namespace std;
246  return (edm::isNotFinite(point.x())|| edm::isNotFinite(point.y()) || edm::isNotFinite(point.z()));
247  }
T y() const
Definition: PV3DBase.h:63
bool isNotFinite(T x)
Definition: isFinite.h:10
T z() const
Definition: PV3DBase.h:64
T x() const
Definition: PV3DBase.h:62
template<unsigned int N>
const LinearizationPointFinder* SequentialVertexFitter< N >::linearizationPointFinder ( ) const
inline

Method returning the fitted vertex, from a VertexSeed. For the first loop, the position of the VertexSeed will be used as linearization point. If subsequent loops are needed, the new VertexTracks will be created with the last estimate of the vertex as linearization point. In case a non-sero error is given, the position and error of the VertexSeed will be used as prior estimate in the vertex fit.

Parameters
seedThe VertexSeed to fit.
Returns
The fitted vertex Access methods

Definition at line 162 of file SequentialVertexFitter.h.

Referenced by SequentialVertexFitter< N >::SequentialVertexFitter().

163  {return theLinP;}
LinearizationPointFinder * theLinP
template<unsigned int N>
const AbstractLTSFactory<N>* SequentialVertexFitter< N >::linearizedTrackStateFactory ( ) const
inline

Definition at line 184 of file SequentialVertexFitter.h.

Referenced by SequentialVertexFitter< N >::SequentialVertexFitter().

185  { return theLTrackFactory;}
const AbstractLTSFactory< N > * theLTrackFactory
template<unsigned int N>
vector< typename SequentialVertexFitter< N >::RefCountedVertexTrack > SequentialVertexFitter< N >::linearizeTracks ( const std::vector< reco::TransientTrack > &  tracks,
const VertexState  state 
) const
private

Construct a container of VertexTrack from a set of RecTracks.

Parameters
tracksThe container of RecTracks.
seedThe seed to use for the VertexTracks. This position will also be used as the new linearization point.
Returns
The container of VertexTracks which are to be used in the next fit.

Definition at line 207 of file SequentialVertexFitter.cc.

References i, and VertexState::position().

210 {
211  GlobalPoint linP = state.position();
212  std::vector<RefCountedVertexTrack> finalTracks;
213  finalTracks.reserve(tracks.size());
214  for(vector<reco::TransientTrack>::const_iterator i = tracks.begin();
215  i != tracks.end(); i++) {
217  = theLTrackFactory->linearizedTrackState(linP, *i);
218  RefCountedVertexTrack vTrData = theVTrackFactory.vertexTrack(lTrData,state);
219  finalTracks.push_back(vTrData);
220  }
221  return finalTracks;
222 }
int i
Definition: DBlmapReader.cc:9
VertexTrackFactory< N > theVTrackFactory
const AbstractLTSFactory< N > * theLTrackFactory
GlobalPoint position() const
Definition: VertexState.h:50
ReferenceCountingPointer< VertexTrack< N > > RefCountedVertexTrack
tuple tracks
Definition: testEve_cfg.py:39
ReferenceCountingPointer< LinearizedTrackState< N > > RefCountedLinearizedTrackState
template<unsigned int N>
const float SequentialVertexFitter< N >::maxShift ( ) const
inline
template<unsigned int N>
const int SequentialVertexFitter< N >::maxStep ( ) const
inline
template<unsigned int N>
const edm::ParameterSet SequentialVertexFitter< N >::parameterSet ( ) const
inline

Definition at line 177 of file SequentialVertexFitter.h.

Referenced by SequentialVertexFitter< N >::SequentialVertexFitter().

178  {return thePSet;}
template<unsigned int N>
void SequentialVertexFitter< N >::readParameters ( )
private

Reads the configurable parameters.

Definition at line 70 of file SequentialVertexFitter.cc.

Referenced by SequentialVertexFitter< N >::SequentialVertexFitter().

71 {
72  theMaxShift = thePSet.getParameter<double>("maxDistance"); //0.01
73  theMaxStep = thePSet.getParameter<int>("maxNbrOfIterations"); //10
74 }
T getParameter(std::string const &) const
template<unsigned int N>
vector< typename SequentialVertexFitter< N >::RefCountedVertexTrack > SequentialVertexFitter< N >::reLinearizeTracks ( const std::vector< RefCountedVertexTrack > &  tracks,
const VertexState  state 
) const
private

Construct new a container of VertexTrack with a new linearization point and vertex seed, from an existing set of VertexTrack, from which only the recTracks will be used.

Parameters
tracksThe original container of VertexTracks, from which the RecTracks will be extracted.
seedThe seed to use for the VertexTracks. This position will also be used as the new linearization point.
Returns
The container of VertexTracks which are to be used in the next fit.

Definition at line 231 of file SequentialVertexFitter.cc.

References i, VertexState::position(), and VertexState::weight().

234 {
235 
236  GlobalPoint linP = state.position();
237  std::vector<RefCountedVertexTrack> finalTracks;
238  finalTracks.reserve(tracks.size());
239  for(typename std::vector<RefCountedVertexTrack>::const_iterator i = tracks.begin();
240  i != tracks.end(); i++) {
242  (**i).linearizedTrack()->stateWithNewLinearizationPoint(linP);
243  // RefCountedLinearizedTrackState lTrData =
244  // theLTrackFactory->linearizedTrackState(linP,
245  // (**i).linearizedTrack()->track());
246  RefCountedVertexTrack vTrData =
247  theVTrackFactory.vertexTrack(lTrData,state, (**i).weight() );
248  finalTracks.push_back(vTrData);
249  }
250  return finalTracks;
251 }
int i
Definition: DBlmapReader.cc:9
VertexTrackFactory< N > theVTrackFactory
GlobalPoint position() const
Definition: VertexState.h:50
ReferenceCountingPointer< VertexTrack< N > > RefCountedVertexTrack
GlobalWeight weight() const
Definition: VertexState.h:60
tuple tracks
Definition: testEve_cfg.py:39
ReferenceCountingPointer< LinearizedTrackState< N > > RefCountedLinearizedTrackState
template<unsigned int N>
void SequentialVertexFitter< N >::setDefaultParameters ( )
private

Definition at line 77 of file SequentialVertexFitter.cc.

Referenced by SequentialVertexFitter< N >::SequentialVertexFitter().

78 {
79  thePSet.addParameter<double>("maxDistance", 0.01);
80  thePSet.addParameter<int>("maxNbrOfIterations", 10); //10
82 }
void addParameter(std::string const &name, T const &value)
Definition: ParameterSet.h:142
template<unsigned int N>
void SequentialVertexFitter< N >::setMaximumDistance ( float  maxShift)
inline

Method to set the convergence criterion (the maximum distance between the vertex computed in the previous and the current iterations to consider the fit to have converged)

Definition at line 79 of file SequentialVertexFitter.h.

template<unsigned int N>
void SequentialVertexFitter< N >::setMaximumNumberOfIterations ( int  maxIterations)
inline

Method to set the maximum number of iterations to perform

Definition at line 86 of file SequentialVertexFitter.h.

87  {theMaxStep = maxIterations;}
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::vertex ( const std::vector< reco::TransientTrack > &  tracks) const
virtual

Method returning the fitted vertex, from a container of reco::TransientTracks. The linearization point will be searched with the given LP finder. No prior vertex position will be used in the vertex fit.

Parameters
tracksThe container of RecTracks to fit.
Returns
The fitted vertex

Implements VertexFitter< N >.

Definition at line 86 of file SequentialVertexFitter.cc.

References relativeConstraints::error.

Referenced by GsfVertexFitter::vertex(), and KalmanVertexFitter::vertex().

87 {
88  // Linearization Point
90  if (!insideTrackerBounds(linP)) linP = GlobalPoint(0,0,0);
91 
92  // Initial vertex state, with a very large error matrix
93  ROOT::Math::SMatrixIdentity id;
94  AlgebraicSymMatrix33 we(id);
95  GlobalError error(we*10000);
96  VertexState state(linP, error);
97  std::vector<RefCountedVertexTrack> vtContainer = linearizeTracks(tracks, state);
98  return fit(vtContainer, state, false);
99 }
LinearizationPointFinder * theLinP
CachingVertex< N > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
Global3DPoint GlobalPoint
Definition: GlobalPoint.h:10
ROOT::Math::SMatrix< double, 3, 3, ROOT::Math::MatRepSym< double, 3 > > AlgebraicSymMatrix33
tuple tracks
Definition: testEve_cfg.py:39
virtual GlobalPoint getLinearizationPoint(const std::vector< reco::TransientTrack > &) const =0
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &tracks, const VertexState state) const
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::vertex ( const std::vector< RefCountedVertexTrack > &  tracks) const
virtual

Method returning the fitted vertex, from a container of VertexTracks. For the first loop, the LinearizedTrackState contained in the VertexTracks will be used. If subsequent loops are needed, the new VertexTracks will be created with the last estimate of the vertex as linearization point. No prior vertex position will be used in the vertex fit.

Parameters
tracksThe container of VertexTracks to fit.
Returns
The fitted vertex

Definition at line 112 of file SequentialVertexFitter.cc.

References relativeConstraints::error.

113 {
114  // Initial vertex state, with a very small weight matrix
115  GlobalPoint linP = tracks[0]->linearizedTrack()->linearizationPoint();
116  ROOT::Math::SMatrixIdentity id;
117  AlgebraicSymMatrix33 we(id);
118  GlobalError error(we*10000);
119  VertexState state(linP, error);
120  return fit(tracks, state, false);
121 }
CachingVertex< N > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
ROOT::Math::SMatrix< double, 3, 3, ROOT::Math::MatRepSym< double, 3 > > AlgebraicSymMatrix33
tuple tracks
Definition: testEve_cfg.py:39
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::vertex ( const std::vector< RefCountedVertexTrack > &  tracks,
const reco::BeamSpot spot 
) const
virtual

Same as above, only now also with BeamSpot!

Definition at line 102 of file SequentialVertexFitter.cc.

105 {
106  VertexState state(spot);
107  return fit(tracks, state, true );
108 }
CachingVertex< N > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::vertex ( const std::vector< reco::TransientTrack > &  tracks,
const GlobalPoint linPoint 
) const
virtual

Fit vertex out of a set of RecTracks. Uses the specified linearization point.

Implements VertexFitter< N >.

Definition at line 129 of file SequentialVertexFitter.cc.

References relativeConstraints::error.

131 {
132  // Initial vertex state, with a very large error matrix
133  ROOT::Math::SMatrixIdentity id;
134  AlgebraicSymMatrix33 we(id);
135  GlobalError error(we*10000);
136  VertexState state(linPoint, error);
137  std::vector<RefCountedVertexTrack> vtContainer = linearizeTracks(tracks, state);
138  return fit(vtContainer, state, false);
139 }
CachingVertex< N > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
ROOT::Math::SMatrix< double, 3, 3, ROOT::Math::MatRepSym< double, 3 > > AlgebraicSymMatrix33
tuple tracks
Definition: testEve_cfg.py:39
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &tracks, const VertexState state) const
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::vertex ( const std::vector< reco::TransientTrack > &  tracks,
const reco::BeamSpot beamSpot 
) const
virtual

Fit vertex out of a set of TransientTracks. The specified BeamSpot will be used as priot, but NOT for the linearization. The specified LinearizationPointFinder will be used to find the linearization point.

Implements VertexFitter< N >.

Definition at line 148 of file SequentialVertexFitter.cc.

References relativeConstraints::error.

150 {
151  VertexState beamSpotState(beamSpot);
152  std::vector<RefCountedVertexTrack> vtContainer;
153 
154  if (tracks.size() > 1) {
155  // Linearization Point search if there are more than 1 track
157  if (!insideTrackerBounds(linP)) linP = GlobalPoint(0,0,0);
158  ROOT::Math::SMatrixIdentity id;
159  AlgebraicSymMatrix33 we(id);
160  GlobalError error(we*10000);
161  VertexState lpState(linP, error);
162  vtContainer = linearizeTracks(tracks, lpState);
163  } else {
164  // otherwise take the beamspot position.
165  vtContainer = linearizeTracks(tracks, beamSpotState);
166  }
167 
168  return fit(vtContainer, beamSpotState, true);
169 }
LinearizationPointFinder * theLinP
CachingVertex< N > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
Global3DPoint GlobalPoint
Definition: GlobalPoint.h:10
ROOT::Math::SMatrix< double, 3, 3, ROOT::Math::MatRepSym< double, 3 > > AlgebraicSymMatrix33
tuple tracks
Definition: testEve_cfg.py:39
virtual GlobalPoint getLinearizationPoint(const std::vector< reco::TransientTrack > &) const =0
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &tracks, const VertexState state) const
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::vertex ( const std::vector< reco::TransientTrack > &  tracks,
const GlobalPoint priorPos,
const GlobalError priorError 
) const
virtual

Fit vertex out of a set of RecTracks. Uses the position as both the linearization point AND as prior estimate of the vertex position. The error is used for the weight of the prior estimate.

Implements VertexFitter< N >.

Definition at line 178 of file SequentialVertexFitter.cc.

182 {
183  VertexState state(priorPos, priorError);
184  std::vector<RefCountedVertexTrack> vtContainer = linearizeTracks(tracks, state);
185  return fit(vtContainer, state, true);
186 }
CachingVertex< N > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &tracks, const VertexState state) const
template<unsigned int N>
CachingVertex< N > SequentialVertexFitter< N >::vertex ( const std::vector< RefCountedVertexTrack > &  tracks,
const GlobalPoint priorPos,
const GlobalError priorError 
) const
virtual

Fit vertex out of a set of VertexTracks Uses the position and error for the prior estimate of the vertex. This position is not used to relinearize the tracks.

Definition at line 193 of file SequentialVertexFitter.cc.

197 {
198  VertexState state(priorPos, priorError);
199  return fit(tracks, state, true);
200 }
CachingVertex< N > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState priorVertex, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
template<unsigned int N>
const VertexSmoother<N>* SequentialVertexFitter< N >::vertexSmoother ( ) const
inline

Definition at line 168 of file SequentialVertexFitter.h.

Referenced by SequentialVertexFitter< N >::SequentialVertexFitter().

169  {return theSmoother;}
VertexSmoother< N > * theSmoother
template<unsigned int N>
const VertexUpdator<N>* SequentialVertexFitter< N >::vertexUpdator ( ) const
inline

Definition at line 165 of file SequentialVertexFitter.h.

Referenced by SequentialVertexFitter< N >::SequentialVertexFitter().

166  {return theUpdator;}
VertexUpdator< N > * theUpdator

Member Data Documentation

template<unsigned int N>
LinearizationPointFinder* SequentialVertexFitter< N >::theLinP
private
template<unsigned int N>
const AbstractLTSFactory<N>* SequentialVertexFitter< N >::theLTrackFactory
private
template<unsigned int N>
float SequentialVertexFitter< N >::theMaxShift
private
template<unsigned int N>
int SequentialVertexFitter< N >::theMaxStep
private
template<unsigned int N>
edm::ParameterSet SequentialVertexFitter< N >::thePSet
private

Definition at line 253 of file SequentialVertexFitter.h.

Referenced by SequentialVertexFitter< 5 >::parameterSet().

template<unsigned int N>
VertexSmoother<N>* SequentialVertexFitter< N >::theSmoother
private
template<unsigned int N>
VertexUpdator<N>* SequentialVertexFitter< N >::theUpdator
private
template<unsigned int N>
VertexTrackFactory<N> SequentialVertexFitter< N >::theVTrackFactory
private

Definition at line 259 of file SequentialVertexFitter.h.