AcceptEllipse Struct Reference

Public Member Functions
	AcceptEllipse (const BoundingBox &b, double r1, double r2)
bool	operator() (const RTree::Node *const node) const
bool	operator() (const RTree::Leaf *const leaf) const

Public Attributes
const BoundingBox &	m_bound
double	r [2]
double	c [2]
	center of the bounding box More...
double	d [2]
	half More...

Private Member Functions
	AcceptEllipse ()

Static Private Attributes
static const BoundingBox	EmptyBoundingBox

Detailed Description

Definition at line 85 of file DBScanAlg.cxx.

Constructor & Destructor Documentation

AcceptEllipse::AcceptEllipse ( const BoundingBox &  b, double  r1, double  r2  )

inlineexplicit

Definition at line 90 of file DBScanAlg.cxx.

References RStarBoundingBox< dimensions >::edges.

                                              :m_bound(b),r(),c(){
    r[0] = r1;
    r[1] = r2;
    c[0] = (m_bound.edges[0].second+m_bound.edges[0].first)/2.0;
    c[1] = (m_bound.edges[1].second+m_bound.edges[1].first)/2.0;
    d[0] = (m_bound.edges[0].second-m_bound.edges[0].first)/2.0;
    d[1] = (m_bound.edges[1].second-m_bound.edges[1].first)/2.0;
  }

AcceptEllipse::AcceptEllipse ( )

inlineprivate

Definition at line 121 of file DBScanAlg.cxx.

References RStarBoundingBox< dimensions >::edges, and EmptyBoundingBox.

    :m_bound(EmptyBoundingBox),r(),c(){
    r[0] = r[1] = 1.0;
    c[0] = (m_bound.edges[0].second-m_bound.edges[0].first)/2.0;
    c[1] = (m_bound.edges[1].second-m_bound.edges[1].first)/2.0;
  }

Member Function Documentation

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

inline

Definition at line 99 of file DBScanAlg.cxx.

References RStarBoundingBox< dimensions >::overlaps().

                                                      {
    // At the node level we use a rectangualr overlap condition
    return m_bound.overlaps(node->bound);
  }

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

inline

Definition at line 103 of file DBScanAlg.cxx.

                                                      {
    // At the leaf level we have to more careful
    double C[2], D[2];
    C[0] = (leaf->bound.edges[0].second + leaf->bound.edges[0].first)/2.0;
    C[1] = (leaf->bound.edges[1].second + leaf->bound.edges[1].first)/2.0;
    D[0] = (leaf->bound.edges[0].second - leaf->bound.edges[0].first)/2.0;
    D[1] = (leaf->bound.edges[1].second - leaf->bound.edges[1].first)/2.0;
    double t=0;
    for (int i=0; i<2; ++i){
      // This is only approximate, it will accept a few classes of
      // non-overlapping ellipses
      t += ((c[i]-C[i])*(c[i]-C[i]))/((d[i]+D[i])*(d[i]+D[i]));
    }
    return (t < 1);
  }

Member Data Documentation

double AcceptEllipse::c[2]

center of the bounding box

Definition at line 88 of file DBScanAlg.cxx.

double AcceptEllipse::d[2]

half

Definition at line 89 of file DBScanAlg.cxx.

const BoundingBox AcceptEllipse::EmptyBoundingBox

staticprivate

Definition at line 119 of file DBScanAlg.cxx.

Referenced by AcceptEllipse().

const BoundingBox& AcceptEllipse::m_bound

Definition at line 86 of file DBScanAlg.cxx.

double AcceptEllipse::r[2]

Definition at line 87 of file DBScanAlg.cxx.

---

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

• /cvmfs/larsoft.opensciencegrid.org/products/larreco/v07_10_02/source/larreco/RecoAlg/DBScanAlg.cxx