genie::geometry::FidPolyhedron Class Reference

#include <FidShape.h>

Inheritance diagram for genie::geometry::FidPolyhedron:

Public Member Functions
	FidPolyhedron ()
	convex polyhedron is made of multiple planar equations More...
void	push_back (const PlaneParam &pln)
void	clear ()
RayIntercept	Intercept (const TVector3 &start, const TVector3 &dir) const
void	ConvertMaster2Top (const ROOTGeomAnalyzer *rgeom)
void	Print (std::ostream &stream) const
Public Member Functions inherited from genie::geometry::FidShape
	FidShape ()
virtual	~FidShape ()

Protected Attributes
std::vector< PlaneParam >	fPolyFaces

Detailed Description

Definition at line 136 of file FidShape.h.

Constructor & Destructor Documentation

genie::geometry::FidPolyhedron::FidPolyhedron ( )

inline

convex polyhedron is made of multiple planar equations

Definition at line 139 of file FidShape.h.

{ ; }

Member Function Documentation

void genie::geometry::FidPolyhedron::clear ( )

inline

Definition at line 141 of file FidShape.h.

{ fPolyFaces.clear(); }

void FidPolyhedron::ConvertMaster2Top ( const ROOTGeomAnalyzer *  rgeom )

virtual

derived classes must implement the ConvertMaster2Top() method which transforms the shape specification from master coordinates to "top vol"

Implements genie::geometry::FidShape.

Definition at line 296 of file FidShape.cxx.

{
  for (unsigned int i = 0; i < fPolyFaces.size(); ++i ) {
    PlaneParam& aplane = fPolyFaces[i];
    aplane.ConvertMaster2Top(rgeom);
  }
}

RayIntercept FidPolyhedron::Intercept ( const TVector3 &  start, const TVector3 &  dir  ) const

virtual

derived classes must implement the Intercept() method which calculates the entry/exit point of a ray w/ the shape

Implements genie::geometry::FidShape.

Definition at line 216 of file FidShape.cxx.

{
  // A new neutrino ray has been set, calculate the entrance/exit distances.
  // Calculate the point of intersection of a ray (directed line) and a
  // *convex* polyhedron constructed from the intersection of a list
  // of planar equations (no check on convex condition).

  RayIntercept intercept;

  Double_t tnear = -DBL_MAX;
  Double_t tfar  =  DBL_MAX;
  Int_t surfNear = -1;
  Int_t surfFar  = -1;
  Bool_t parallel = false;

  // test each plane in the polyhedron
  for ( size_t iface=0; iface < fPolyFaces.size(); ++iface ) {
    const PlaneParam& pln = fPolyFaces[iface];
    if ( ! pln.IsValid() ) continue;

    // calculate numerator, denominator to "t" = distance along ray to intersection w/ pln
    Double_t vd = pln.Vd(dir);
    Double_t vn = pln.Vn(start);

    //LOG("GeomVolSel", pNOTICE)
    //  << " face " << iface << " [" << pln.a << "," << pln.b << "," << pln.c << "," << pln.d
    //  << "] vd=" << vd << " vn=" << vn;

    if ( vd == 0.0 ) {
      // ray is parallel to plane - check if ray origin is inside plane's half-space
      //LOG("GeomVolSel", pNOTICE)
      //  << " vd=0, " << " possibly parallel ";
      if ( vn > 0.0 ) { parallel = true; break; }  // wrong side ... complete miss
    } else {
      // ray is not parallel to plane -- get the distance to the plane
      Double_t t = -vn / vd; // notice negative sign!
      //LOG("GeomVolSel", pNOTICE) << "   t=" << t << " tnear=" << tnear << " tfar=" << tfar;
      if ( vd < 0.0 ) {
        // front face: t is a near point
        if ( t > tnear ) {
          surfNear = iface;
          tnear    = t;
        }
      } else {
        // back face: t is a far point
        if ( t < tfar ) {
          surfFar = iface;
          tfar    = t;
        }
      }
      //LOG("GeomVolSel", pNOTICE) << "     new surf " <<  surfNear << "," << surfFar
      //                           << " tnear=" << tnear << " tfar=" << tfar;
    }
  }
  if ( ! parallel ) {
    // survived all the tests
    if ( tnear > 0.0 ) {
      if ( tnear < tfar ) {
        //LOG("GeomVolSel", pNOTICE) << "is hit case1 ";
        intercept.fIsHit   = true;
        intercept.fSurfIn  = surfNear;
        intercept.fSurfOut = surfFar;
      }
    } else {
      if ( tfar > 0.0 ) {
        //LOG("GeomVolSel", pNOTICE) << "is hit case2 ";
        intercept.fIsHit   = true;
        intercept.fSurfIn  = -1;
        intercept.fSurfOut = surfFar;
      }
    }
  }
  intercept.fDistIn  = tnear;
  intercept.fDistOut = tfar;
  //LOG("GeomVolSel", pNOTICE) << " hit? " << (fIsHit?"true":"false")
  //                           << " dist in " << fDistIn << " out " << fDistOut;
  return intercept;
}

void FidPolyhedron::Print ( std::ostream &  stream ) const

virtual

Implements genie::geometry::FidShape.

Definition at line 303 of file FidShape.cxx.

{
  size_t nfaces = fPolyFaces.size();
  stream << "FidPolyhedron n=" << nfaces;
  for ( size_t i=0; i<nfaces; ++i) {
    const PlaneParam& aface = fPolyFaces[i];
    stream << std::endl << "[" << setw(2) << i << "]" << aface;
  }
}

void genie::geometry::FidPolyhedron::push_back ( const PlaneParam &  pln )

inline

Definition at line 140 of file FidShape.h.

{ fPolyFaces.push_back(pln); }

Member Data Documentation

std::vector<PlaneParam> genie::geometry::FidPolyhedron::fPolyFaces

protected

Definition at line 146 of file FidShape.h.

---

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

• Generator/src/Tools/Geometry/FidShape.h
• Generator/src/Tools/Geometry/FidShape.cxx