CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
DivisiveVertexFinder.h
Go to the documentation of this file.
1 #ifndef RecoPixelVertexing_DivisiveVertexFinder_h
2 #define RecoPixelVertexing_DivisiveVertexFinder_h
3 
24 #include <vector>
29 //#include "CommonTools/Clustering1D/interface/DivisiveClusterizer1D.h"
31 
33 
35  public:
36  DivisiveVertexFinder(double track_pt_min, double track_pt_max, double track_chi2_max, double track_prob_min,
37  double zOffset=5.0, int ntrkMin=5, bool useError=true,
38  double zSeparation=0.05, bool wtAverage=true, int verbosity=0);
40 
42  bool findVertexes(const reco::TrackRefVector &trks, // input
43  reco::VertexCollection &vertexes); // output
44  bool findVertexesAlt(const reco::TrackRefVector &trks, // input
45  reco::VertexCollection &vertexes, const math::XYZPoint & bs); // output
46  private:
49  int ntrkMin_;
51 
54  // DivisiveClusterizer1D< reco::Track > divmeth_;
55 
56  // How loud should I be?
57  int verbose_;
58 
59 
61 
62 };
63 #endif
pixeltemp::DivisiveClusterizer1D< reco::Track > divmeth_
We use Wolfgang&#39;s templated class that implements the actual divisive method.
bool findVertexesAlt(const reco::TrackRefVector &trks, reco::VertexCollection &vertexes, const math::XYZPoint &bs)
PVClusterComparer * pvComparer_
std::vector< Vertex > VertexCollection
collection of Vertex objects
Definition: VertexFwd.h:9
bool findVertexes(const reco::TrackRefVector &trks, reco::VertexCollection &vertexes)
Run the divisive algorithm and return a vector of vertexes for the input track collection.
XYZPointD XYZPoint
point in space with cartesian internal representation
Definition: Point3D.h:12
DivisiveVertexFinder(double track_pt_min, double track_pt_max, double track_chi2_max, double track_prob_min, double zOffset=5.0, int ntrkMin=5, bool useError=true, double zSeparation=0.05, bool wtAverage=true, int verbosity=0)
double zOffset_
Cuts on vertex formation and other options.