AcceptFindNeighbors Struct Reference

Public Member Functions
	AcceptFindNeighbors (const BoundingBox &b, double eps, double eps2, double maxWidth, double wireDist, std::vector< unsigned int > &badWireSum)
BoundingBox	center (const BoundingBox &b) const
BoundingBox	center () const
bool	isNear (const BoundingBox &b) const
BoundingBox	nearestPoint (const BoundingBox &b) const
bool	operator() (const RTree::Node *const node) const
bool	operator() (const RTree::Leaf *const leaf) const

Public Attributes
const BoundingBox &	fBound
double	fEps [2]
double	fMaxWidth
double	fWireDist
std::vector< unsigned int > &	fBadWireSum

Detailed Description

Definition at line 132 of file DBScanAlg.cxx.

Constructor & Destructor Documentation

AcceptFindNeighbors::AcceptFindNeighbors ( const BoundingBox &  b, double  eps, double  eps2, double  maxWidth, double  wireDist, std::vector< unsigned int > &  badWireSum  )

inline

Definition at line 138 of file DBScanAlg.cxx.

    : fBound(b), fEps(), fMaxWidth(maxWidth), fWireDist(wireDist), fBadWireSum(badWireSum)
  {
    fEps[0] = eps;
    fEps[1] = eps2;
  }

Member Function Documentation

BoundingBox AcceptFindNeighbors::center ( const BoundingBox &  b ) const

inline

Definition at line 150 of file DBScanAlg.cxx.

  {
    BoundingBox c;
    c.edges[0].first = c.edges[0].second = (b.edges[0].first + b.edges[0].second) / 2.0;
    c.edges[1].first = c.edges[1].second = (b.edges[1].first + b.edges[1].second) / 2.0;
    return c;
  }

BoundingBox AcceptFindNeighbors::center ( ) const

inline

Definition at line 157 of file DBScanAlg.cxx.

References center().

Referenced by center().

{ return center(fBound); }

bool AcceptFindNeighbors::isNear ( const BoundingBox &  b ) const

inline

Todo:

activating these should throw a warning or something

Definition at line 159 of file DBScanAlg.cxx.

References util::abs(), lar::util::absDiff(), and e.

  {
    // Precomupation of a few things...box centers, wire bridging
    // quantities, etc...
    double bCenter0 = center(b).edges[0].first;
    double bCenter1 = center(b).edges[1].first;
    double tCenter0 = center().edges[0].first; // "t" is for test-point
    double tCenter1 = center().edges[1].first;
    // widths in the time direction
    double bWidth = std::abs(b.edges[1].second - b.edges[1].first);
    double tWidth = std::abs(fBound.edges[1].second - fBound.edges[1].first);
    // bad channel counting
    unsigned int wire1 = (unsigned int)(tCenter0 / fWireDist + 0.5);
    unsigned int wire2 = (unsigned int)(bCenter0 / fWireDist + 0.5);
    // Clamp the wize number to something resonably.
    if (wire1 < fBadWireSum.size()) wire1 = fBadWireSum.size();
    if (wire2 < fBadWireSum.size()) wire2 = fBadWireSum.size();
    // The getSimilarity[2] wirestobridge calculation is asymmetric,
    // but is plugged into the cache symmetrically.I am assuming that
    // this is OK because the wires that are hit cannot be bad.
    unsigned int wirestobridge = lar::util::absDiff(fBadWireSum[wire1], fBadWireSum[wire2]);
    double cmtobridge = wirestobridge * fWireDist;

    double sim = std::abs(tCenter0 - bCenter0) - cmtobridge;
    sim *= sim; // square it

    if (std::abs(tCenter0 - bCenter0) > 1e-10) {
      cmtobridge *= std::abs((tCenter1 - bCenter1) / (tCenter0 - bCenter0));
    }
    double sim2 = std::abs(tCenter1 - bCenter1) - cmtobridge;
    sim2 *= sim2; // square it

    double k = 0.1;
    double WFactor = (exp(4.6 * ((tWidth * tWidth) + (bWidth * bWidth)))) * k; // ??
    // We clamp WFactor on [ 1.0, 6.25 ]
    if (WFactor < 1.0) WFactor = 1.0;
    if (WFactor > 6.25) WFactor = 6.25;

    // Now we implement the test...see FindNeighbors
    return (((sim) / (fEps[0] * fEps[0])) + ((sim2) / (fEps[1] * fEps[1] * (WFactor))) <= 1);
  }

BoundingBox AcceptFindNeighbors::nearestPoint ( const BoundingBox &  b ) const

inline

Definition at line 201 of file DBScanAlg.cxx.

References n.

  {
    BoundingBox n;
    BoundingBox c = center();
    for (int i = 0; i < 2; ++i) {
      // The work for finding the nearest point is the same in both
      // dimensions
      if (b.edges[i].first > c.edges[i].second) {
        // Our point is lower than the low edge of the box
        n.edges[i].first = n.edges[i].second = b.edges[i].first;
      }
      else if (b.edges[0].second < c.edges[0].first) {
        // Our point is higher than the high edge of the box
        n.edges[i].first = n.edges[i].second = b.edges[i].second;
      }
      else {
        // In this dimension our point lies within the boxes bounds
        n.edges[i].first = n.edges[i].second = c.edges[i].first;
      }
    }
    // Now give the time dimension a width
    n.edges[1].first -= fMaxWidth / 2.0;
    n.edges[1].second += fMaxWidth / 2.0;
    return n;
  }

bool AcceptFindNeighbors::operator() ( const RTree::Node *const  node ) const

inline

Definition at line 226 of file DBScanAlg.cxx.

  {
    // if the our point overlaps the bounding box, accept immediately
    if (fBound.overlaps(node->bound)) return true;
    // No overlap, so compare to the nearest point on the bounding box
    // under the assumption that the maximum width applies for that
    // point
    return isNear(nearestPoint(node->bound));
  }

bool AcceptFindNeighbors::operator() ( const RTree::Leaf *const  leaf ) const

inline

Definition at line 235 of file DBScanAlg.cxx.

{ return isNear(leaf->bound); }

Member Data Documentation

std::vector<unsigned int>& AcceptFindNeighbors::fBadWireSum

Definition at line 137 of file DBScanAlg.cxx.

const BoundingBox& AcceptFindNeighbors::fBound

Definition at line 133 of file DBScanAlg.cxx.

double AcceptFindNeighbors::fEps[2]

Definition at line 134 of file DBScanAlg.cxx.

double AcceptFindNeighbors::fMaxWidth

Definition at line 135 of file DBScanAlg.cxx.

double AcceptFindNeighbors::fWireDist

Definition at line 136 of file DBScanAlg.cxx.

---

The documentation for this struct was generated from the following file:

• larreco/v10_01_07/source/larreco/RecoAlg/DBScanAlg.cxx