Go to the source code of this file.
Classes | |
struct | brokenline::PreparedBrokenLineData< n > |
data needed for the Broken Line fit procedure. More... | |
Namespaces | |
brokenline | |
Typedefs | |
using | brokenline::karimaki_circle_fit = riemannFit::CircleFit |
< Karimäki's parameters: (phi, d, k=1/R) More... | |
Functions | |
template<typename M3xN , typename M6xN , typename V4 , int n> | |
__host__ __device__ void | brokenline::circleFit (const M3xN &hits, const M6xN &hits_ge, const V4 &fast_fit, const double bField, PreparedBrokenLineData< n > &data, karimaki_circle_fit &circle_results) |
Performs the Broken Line fit in the curved track case (that is, the fit parameters are the interceptions u and the curvature correction ). More... | |
template<typename M3xN , typename V4 > | |
__host__ __device__ void | brokenline::fastFit (const M3xN &hits, V4 &result) |
A very fast helix fit. More... | |
template<int n> | |
riemannFit::HelixFit | brokenline::helixFit (const riemannFit::Matrix3xNd< n > &hits, const Eigen::Matrix< float, 6, 4 > &hits_ge, const double bField) |
Helix fit by three step: -fast pre-fit (see Fast_fit() for further info); -circle fit of the hits projected in the transverse plane by Broken Line algorithm (see BL_Circle_fit() for further info); -line fit of the hits projected on the (pre-fitted) cilinder surface by Broken Line algorithm (see BL_Line_fit() for further info); Points must be passed ordered (from inner to outer layer). More... | |
template<typename V4 , typename M6xN , int n> | |
__host__ __device__ void | brokenline::lineFit (const M6xN &hits_ge, const V4 &fast_fit, const double bField, const PreparedBrokenLineData< n > &data, riemannFit::LineFit &line_results) |
Performs the Broken Line fit in the straight track case (that is, the fit parameters are only the interceptions u). More... | |
template<int n> | |
__host__ __device__ riemannFit::MatrixNd< n > | brokenline::matrixC_u (const riemannFit::VectorNd< n > &weights, const riemannFit::VectorNd< n > &sTotal, const riemannFit::VectorNd< n > &varBeta) |
Computes the n-by-n band matrix obtained minimizing the Broken Line's cost function w.r.t u. This is the whole matrix in the case of the line fit and the main n-by-n block in the case of the circle fit. More... | |
__host__ __device__ double | brokenline::multScatt (const double &length, const double bField, const double radius, int layer, double slope) |
Computes the Coulomb multiple scattering variance of the planar angle. More... | |
template<typename M3xN , typename V4 , int n> | |
__host__ __device__ void | brokenline::prepareBrokenLineData (const M3xN &hits, const V4 &fast_fit, const double bField, PreparedBrokenLineData< n > &results) |
Computes the data needed for the Broken Line fit procedure that are mainly common for the circle and the line fit. More... | |
__host__ __device__ riemannFit::Matrix2d | brokenline::rotationMatrix (double slope) |
Computes the 2D rotation matrix that transforms the line y=slope*x into the line y=0. More... | |
__host__ __device__ void | brokenline::translateKarimaki (karimaki_circle_fit &circle, double x0, double y0, riemannFit::Matrix3d &jacobian) |
Changes the Karimäki parameters (and consequently their covariance matrix) under a translation of the coordinate system, such that the old origin has coordinates (x0,y0) in the new coordinate system. The formulas are taken from Karimäki V., 1990, Effective circle fitting for particle trajectories, Nucl. Instr. and Meth. A305 (1991) 187. More... | |