CurvBinsSpec Class Reference

Strategy to construct discrete curve points from discrete overlap specifications. More...

#include <CurvRep.h>

Public Member Functions
	CurvBinsSpec (double lowerBound, double upperBound, long nBins, int nOverlap, int nWidth)
	Constructs a specification for equally spaced discrete curvature values with discrete overlap specification.
DiscreteCurv::Array	constructArray () const
	Construct the array of discrete curve positions.
DiscreteCurv::Array	constructInvLinearArray () const
	Construct the array of discrete curve positions such that the inverse curvatures are distributed equally.
DiscreteCurv::Array	constructLinearArray () const
	Construct the array of discrete curve positions such that the curvatures are distributed equally.
DiscreteCurvWithArcLength2DCache::Array	constructCacheArray () const
	Construct the array of discrete curve positions including cache for the two dimensional arc length.
long	getNPositions () const
	Getter for the number of bounds.
double	getBinWidth () const
	Getter for the bin width in real curve to investigate the value that results from the discrete overlap specification.
double	getOverlap () const
	Getter for the overlap in real curve to investigate the value that results from the discrete overlap specification.
int	getNOverlap () const
	Getter for the overlap in discrete number of positions.

Private Attributes
double	m_lowerBound
	Lower bound of the binning range.
double	m_upperBound
	Upper bound of the binning range.
long	m_nBins
	Number of accessible bins.
int	m_nOverlap = 1
	Overlap of the leaves in curve counted in number of discrete values.
int	m_nWidth = 3
	Width of the leaves at the maximal level in curve counted in number of discrete values.

Detailed Description

Strategy to construct discrete curve points from discrete overlap specifications.

Definition at line 23 of file CurvRep.h.

Constructor & Destructor Documentation

CurvBinsSpec()

CurvBinsSpec	(	double	lowerBound,
		double	upperBound,
		long	nBins,
		int	nOverlap,
		int	nWidth
	)

Constructs a specification for equally spaced discrete curvature values with discrete overlap specification.

Parameters

lowerBound	Lower bound of the value range
upperBound	Upper bound of the value range
nBins	Total number of final bins to be constructed
nWidth	Number of discrete values in each bin (counted semi open [start, stop)).
nOverlap	Number of discrete values that overlapping bins have in common (counted semi open [start, stop)).

Definition at line 15 of file CurvRep.cc.

  : m_lowerBound(lowerBound)
  , m_upperBound(upperBound)
  , m_nBins(nBins)
  , m_nOverlap(nOverlap)
  , m_nWidth(nWidth)
{
  B2ASSERT("Overlap must be smaller than the width.", m_nWidth > m_nOverlap);
  B2ASSERT("Upper curvature bound must be higher than the lower bound.", m_upperBound > m_lowerBound);
}

Member Function Documentation

constructArray()

DiscreteCurv::Array constructArray ( ) const

inline

Construct the array of discrete curve positions.

Definition at line 40 of file CurvRep.h.

      { return constructLinearArray(); }

constructCacheArray()

DiscreteCurvWithArcLength2DCache::Array constructCacheArray

(

)

const

Construct the array of discrete curve positions including cache for the two dimensional arc length.

Definition at line 76 of file CurvRep.cc.

{
  std::vector<float> discreteCurvs = constructArray();
  std::vector<CurvWithArcLength2DCache> result;
  result.reserve(discreteCurvs.size());
  for (float curv : discreteCurvs) {
    result.emplace_back(curv);
  }
  return result;
}

constructInvLinearArray()

DiscreteCurv::Array constructInvLinearArray

(

)

const

Construct the array of discrete curve positions such that the inverse curvatures are distributed equally.

Definition at line 41 of file CurvRep.cc.

{
  const long nPositions = getNPositions();
 
  long nCurlingCurvs = 3 * nPositions / 10;
 
  std::vector<float> curlingCurvs = linspace<float>(1 / fabs(m_upperBound),
                                                    1 / fabs(m_lowerBound),
                                                    nCurlingCurvs + 1,
  [](float f) {return 1 / f;});
 
  std::sort(curlingCurvs.begin(), curlingCurvs.end());
  float minWidthCurling =  curlingCurvs[1] - curlingCurvs[0];
 
 
  std::vector<float> nonCurlingCurvs = linspace<float>(-fabs(m_lowerBound),
                                                       fabs(m_lowerBound),
                                                       nPositions - nCurlingCurvs);
 
  float widthNonCurling = nonCurlingCurvs[1] - nonCurlingCurvs[0];
 
  B2INFO("Min Width curling" <<  minWidthCurling);
  B2INFO("Width non curling" << widthNonCurling);
  assert(minWidthCurling > widthNonCurling);
 
  // ++ skips duplication of the identical curvature at m_lowerBound.
  nonCurlingCurvs.insert(nonCurlingCurvs.end(), ++(curlingCurvs.begin()), curlingCurvs.end());
  B2INFO(nonCurlingCurvs.size());
  B2INFO(nPositions);
 
  assert(nPositions == static_cast<long>(nonCurlingCurvs.size()));
  assert(std::is_sorted(nonCurlingCurvs.begin(), nonCurlingCurvs.end()));
  return nonCurlingCurvs;
}

constructLinearArray()

DiscreteCurv::Array constructLinearArray

(

)

const

Construct the array of discrete curve positions such that the curvatures are distributed equally.

Definition at line 26 of file CurvRep.cc.

{
  const long nPositions = getNPositions();
  if (m_lowerBound == 0) {
    // Determining the lower bound such that the first bin is symmetric around zero
    // This prevents some cut of effects if the hit happens to lean to
    // the negative curvature spaces.
    const double width = getBinWidth();
    const double expandedLowerBound = -width / 2;
    return linspace<float>(expandedLowerBound, m_upperBound, nPositions);
  } else {
    return linspace<float>(m_lowerBound, m_upperBound, nPositions);
  }
}

getBinWidth()

double getBinWidth

(

)

const

Getter for the bin width in real curve to investigate the value that results from the discrete overlap specification.

Definition at line 94 of file CurvRep.cc.

{
  const double overlapWidthRatio = static_cast<double>(m_nOverlap) / m_nWidth;
  if (m_lowerBound == 0) {
    // Determining the lower bound such that the first bin is symmetric around zero
    // This prevents some cut of effects if the hit happens to lean to
    // the negative curvature spaces.
    const double width = m_upperBound / (m_nBins * (1 - overlapWidthRatio) + overlapWidthRatio - 0.5);
    return width;
  } else {
    const double width = (m_upperBound - m_lowerBound) / (m_nBins * (1 - overlapWidthRatio) + overlapWidthRatio);
    return width;
  }
}

getNOverlap()

int getNOverlap ( ) const

inline

Getter for the overlap in discrete number of positions.

Definition at line 68 of file CurvRep.h.

      {
        return m_nOverlap;
      }

getNPositions()

long getNPositions

(

)

const

Getter for the number of bounds.

Definition at line 87 of file CurvRep.cc.

{
  assert(m_nWidth > m_nOverlap);
  const long nPositions = (m_nWidth - m_nOverlap) * m_nBins + m_nOverlap + 1;
  return nPositions;
}

getOverlap()

double getOverlap

(

)

const

Getter for the overlap in real curve to investigate the value that results from the discrete overlap specification.

Definition at line 109 of file CurvRep.cc.

{
  return getBinWidth() * m_nOverlap / m_nWidth;
}

Member Data Documentation

m_lowerBound

double m_lowerBound

private

Lower bound of the binning range.

Definition at line 75 of file CurvRep.h.

m_nBins

long m_nBins

private

Number of accessible bins.

Definition at line 81 of file CurvRep.h.

m_nOverlap

int m_nOverlap = 1

private

Overlap of the leaves in curve counted in number of discrete values.

Definition at line 84 of file CurvRep.h.

m_nWidth

int m_nWidth = 3

private

Width of the leaves at the maximal level in curve counted in number of discrete values.

Definition at line 87 of file CurvRep.h.

m_upperBound

double m_upperBound

private

Upper bound of the binning range.

Definition at line 78 of file CurvRep.h.

---

The documentation for this class was generated from the following files:

• tracking/trackFindingCDC/hough/perigee/include/CurvRep.h
• tracking/trackFindingCDC/hough/perigee/src/CurvRep.cc