#include <G4GenericPolycone.hh>

Inheritance diagram for G4GenericPolycone:

Collaboration diagram for G4GenericPolycone:

Public Member Functions
	G4GenericPolycone (const G4String &name, G4double phiStart, G4double phiTotal, G4int numRZ, const G4double r[], const G4double z[])

virtual	~G4GenericPolycone ()

EInside	Inside (const G4ThreeVector &p) const

G4double	DistanceToIn (const G4ThreeVector &p, const G4ThreeVector &v) const

G4double	DistanceToIn (const G4ThreeVector &p) const

void	Extent (G4ThreeVector &pMin, G4ThreeVector &pMax) const

G4bool	CalculateExtent (const EAxis pAxis, const G4VoxelLimits &pVoxelLimit, const G4AffineTransform &pTransform, G4double &pmin, G4double &pmax) const

G4ThreeVector	GetPointOnSurface () const

G4GeometryType	GetEntityType () const

G4VSolid *	Clone () const

std::ostream &	StreamInfo (std::ostream &os) const

G4Polyhedron *	CreatePolyhedron () const

G4bool	Reset ()

G4double	GetStartPhi () const

G4double	GetEndPhi () const

G4double	GetSinStartPhi () const

G4double	GetCosStartPhi () const

G4double	GetSinEndPhi () const

G4double	GetCosEndPhi () const

G4bool	IsOpen () const

G4int	GetNumRZCorner () const

G4PolyconeSideRZ	GetCorner (G4int index) const

	G4GenericPolycone (__void__ &)

	G4GenericPolycone (const G4GenericPolycone &source)

G4GenericPolycone &	operator= (const G4GenericPolycone &source)

Public Member Functions inherited from G4VCSGfaceted
	G4VCSGfaceted (const G4String &name)

virtual	~G4VCSGfaceted ()

	G4VCSGfaceted (const G4VCSGfaceted &source)

G4VCSGfaceted &	operator= (const G4VCSGfaceted &source)

virtual G4ThreeVector	SurfaceNormal (const G4ThreeVector &p) const

virtual G4double	DistanceToOut (const G4ThreeVector &p, const G4ThreeVector &v, const G4bool calcNorm=false, G4bool validNorm=0, G4ThreeVector n=0) const

virtual G4double	DistanceToOut (const G4ThreeVector &p) const

virtual void	DescribeYourselfTo (G4VGraphicsScene &scene) const

virtual G4VisExtent	GetExtent () const

virtual G4Polyhedron *	GetPolyhedron () const

G4int	GetCubVolStatistics () const

G4double	GetCubVolEpsilon () const

void	SetCubVolStatistics (G4int st)

void	SetCubVolEpsilon (G4double ep)

G4int	GetAreaStatistics () const

G4double	GetAreaAccuracy () const

void	SetAreaStatistics (G4int st)

void	SetAreaAccuracy (G4double ep)

virtual G4double	GetCubicVolume ()

virtual G4double	GetSurfaceArea ()

	G4VCSGfaceted (__void__ &)

Public Member Functions inherited from G4VSolid
	G4VSolid (const G4String &name)

virtual	~G4VSolid ()

G4bool	operator== (const G4VSolid &s) const

G4String	GetName () const

void	SetName (const G4String &name)

G4double	GetTolerance () const

virtual void	ComputeDimensions (G4VPVParameterisation p, const G4int n, const G4VPhysicalVolume pRep)

void	DumpInfo () const

virtual const G4VSolid *	GetConstituentSolid (G4int no) const

virtual G4VSolid *	GetConstituentSolid (G4int no)

virtual const G4DisplacedSolid *	GetDisplacedSolidPtr () const

virtual G4DisplacedSolid *	GetDisplacedSolidPtr ()

	G4VSolid (__void__ &)

	G4VSolid (const G4VSolid &rhs)

G4VSolid &	operator= (const G4VSolid &rhs)

G4double	EstimateCubicVolume (G4int nStat, G4double epsilon) const

G4double	EstimateSurfaceArea (G4int nStat, G4double ell) const

Protected Member Functions
void	Create (G4double phiStart, G4double phiTotal, G4ReduciblePolygon *rz)

void	CopyStuff (const G4GenericPolycone &source)

Protected Member Functions inherited from G4VCSGfaceted
virtual G4double	DistanceTo (const G4ThreeVector &p, const G4bool outgoing) const

G4ThreeVector	GetPointOnSurfaceGeneric () const

void	CopyStuff (const G4VCSGfaceted &source)

void	DeleteStuff ()

Protected Member Functions inherited from G4VSolid
void	CalculateClippedPolygonExtent (G4ThreeVectorList &pPolygon, const G4VoxelLimits &pVoxelLimit, const EAxis pAxis, G4double &pMin, G4double &pMax) const

void	ClipCrossSection (G4ThreeVectorList *pVertices, const G4int pSectionIndex, const G4VoxelLimits &pVoxelLimit, const EAxis pAxis, G4double &pMin, G4double &pMax) const

void	ClipBetweenSections (G4ThreeVectorList *pVertices, const G4int pSectionIndex, const G4VoxelLimits &pVoxelLimit, const EAxis pAxis, G4double &pMin, G4double &pMax) const

void	ClipPolygon (G4ThreeVectorList &pPolygon, const G4VoxelLimits &pVoxelLimit, const EAxis pAxis) const

Protected Attributes
G4double	startPhi

G4double	endPhi

G4bool	phiIsOpen

G4int	numCorner

G4PolyconeSideRZ *	corners

G4EnclosingCylinder *	enclosingCylinder

Protected Attributes inherited from G4VCSGfaceted
G4int	numFace

G4VCSGface **	faces

G4double	fCubicVolume

G4double	fSurfaceArea

G4bool	fRebuildPolyhedron

G4Polyhedron *	fpPolyhedron

Protected Attributes inherited from G4VSolid
G4double	kCarTolerance

Detailed Description

Definition at line 70 of file G4GenericPolycone.hh.

Constructor & Destructor Documentation

G4GenericPolycone::G4GenericPolycone	(	const G4String &	name,
		G4double	phiStart,
		G4double	phiTotal,
		G4int	numRZ,
		const G4double	r[],
		const G4double	z[]
	)

Definition at line 64 of file G4GenericPolycone.cc.

   : G4VCSGfaceted( name )
 { 
   
   G4ReduciblePolygon *rz = new G4ReduciblePolygon( r, z, numRZ );
   
   Create( phiStart, phiTotal, rz );
   
   // Set original_parameters struct for consistency
   //
   //SetOriginalParameters(rz);
 
   delete rz;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

G4GenericPolycone::~G4GenericPolycone ( )

virtual

Definition at line 270 of file G4GenericPolycone.cc.

 {
   delete [] corners;
   delete enclosingCylinder;
 }

G4GenericPolycone::G4GenericPolycone ( __void__ & a )

Definition at line 260 of file G4GenericPolycone.cc.

   : G4VCSGfaceted(a), startPhi(0.),  endPhi(0.), phiIsOpen(false),
      numCorner(0), corners(0), enclosingCylinder(0)
 {
 }

G4GenericPolycone::G4GenericPolycone ( const G4GenericPolycone & source )

Definition at line 280 of file G4GenericPolycone.cc.

   : G4VCSGfaceted( source )
 {
   CopyStuff( source );
 }

Here is the call graph for this function:

Member Function Documentation

G4bool G4GenericPolycone::CalculateExtent	(	const EAxis	pAxis,
		const G4VoxelLimits &	pVoxelLimit,
		const G4AffineTransform &	pTransform,
		G4double &	pmin,
		G4double &	pmax
	)		const

virtual

Reimplemented from G4VCSGfaceted.

Definition at line 464 of file G4GenericPolycone.cc.

 {
   G4ThreeVector bmin, bmax;
   G4bool exist;
 
   // Check bounding box (bbox)
   //
   Extent(bmin,bmax);
   G4BoundingEnvelope bbox(bmin,bmax);
 #ifdef G4BBOX_EXTENT
   if (true) return bbox.CalculateExtent(pAxis,pVoxelLimit,pTransform,pMin,pMax);
 #endif
   if (bbox.BoundingBoxVsVoxelLimits(pAxis,pVoxelLimit,pTransform,pMin,pMax))
   {
     return exist = (pMin < pMax) ? true : false;
   }
 
   // To find the extent, RZ contour of the polycone is subdivided
   // in triangles. The extent is calculated as cumulative extent of
   // all sub-polycones formed by rotation of triangles around Z
   //
   G4TwoVectorList contourRZ;
   G4TwoVectorList triangles;
   G4double eminlim = pVoxelLimit.GetMinExtent(pAxis);
   G4double emaxlim = pVoxelLimit.GetMaxExtent(pAxis);
 
   // get RZ contour, ensure anticlockwise order of corners
   for (G4int i=0; i<GetNumRZCorner(); ++i)
   {
     G4PolyconeSideRZ corner = GetCorner(i);
     contourRZ.push_back(G4TwoVector(corner.r,corner.z));
   }
   G4double area = G4GeomTools::PolygonArea(contourRZ);
   if (area < 0.) std::reverse(contourRZ.begin(),contourRZ.end());
 
   // triangulate RZ countour
   if (!G4GeomTools::TriangulatePolygon(contourRZ,triangles))
   {
     std::ostringstream message;
     message << "Triangulation of RZ contour has failed for solid: "
             << GetName() << " !"
             << "\nExtent has been calculated using boundary box";
     G4Exception("G4GenericPolycone::CalculateExtent()",
                 "GeomMgt1002", JustWarning, message);
     return bbox.CalculateExtent(pAxis,pVoxelLimit,pTransform,pMin,pMax);
   }
 
   // set trigonometric values
   const G4int NSTEPS = 24;            // number of steps for whole circle
   G4double astep  = twopi/NSTEPS;     // max angle for one step
 
   G4double sphi   = GetStartPhi();
   G4double ephi   = GetEndPhi();
   G4double dphi   = IsOpen() ? ephi-sphi : twopi;
   G4int    ksteps = (dphi <= astep) ? 1 : (G4int)((dphi-deg)/astep) + 1;
   G4double ang    = dphi/ksteps;
 
   G4double sinHalf = std::sin(0.5*ang);
   G4double cosHalf = std::cos(0.5*ang);
   G4double sinStep = 2.*sinHalf*cosHalf;
   G4double cosStep = 1. - 2.*sinHalf*sinHalf;
 
   G4double sinStart = GetSinStartPhi();
   G4double cosStart = GetCosStartPhi();
   G4double sinEnd   = GetSinEndPhi();
   G4double cosEnd   = GetCosEndPhi();
 
   // define vectors and arrays
   std::vector<const G4ThreeVectorList *> polygons;
   polygons.resize(ksteps+2);
   G4ThreeVectorList pols[NSTEPS+2];
   for (G4int k=0; k<ksteps+2; ++k) pols[k].resize(6);
   for (G4int k=0; k<ksteps+2; ++k) polygons[k] = &pols[k];
   G4double r0[6],z0[6]; // contour with original edges of triangle
   G4double r1[6];       // shifted radii of external edges of triangle
 
   // main loop along triangles
   pMin = kInfinity;
   pMax =-kInfinity;
   G4int ntria = triangles.size()/3;
   for (G4int i=0; i<ntria; ++i)
   {
     G4int i3 = i*3;
     for (G4int k=0; k<3; ++k)
     {
       G4int e0 = i3+k, e1 = (k<2) ? e0+1 : i3;
       G4int k2 = k*2;
       // set contour with original edges of triangle
       r0[k2+0] = triangles[e0].x(); z0[k2+0] = triangles[e0].y();
       r0[k2+1] = triangles[e1].x(); z0[k2+1] = triangles[e1].y();
       // set shifted radii
       r1[k2+0] = r0[k2+0];
       r1[k2+1] = r0[k2+1];
       if (z0[k2+1] - z0[k2+0] <= 0) continue;
       r1[k2+0] /= cosHalf;
       r1[k2+1] /= cosHalf;
     }
 
     // rotate countour, set sequence of 6-sided polygons
     G4double sinCur = sinStart*cosHalf + cosStart*sinHalf;
     G4double cosCur = cosStart*cosHalf - sinStart*sinHalf;
     for (G4int j=0; j<6; ++j)
     {
       pols[0][j].set(r0[j]*cosStart,r0[j]*sinStart,z0[j]);
     }
     for (G4int k=1; k<ksteps+1; ++k)
     {
       for (G4int j=0; j<6; ++j)
       {
         pols[k][j].set(r1[j]*cosCur,r1[j]*sinCur,z0[j]);
       }
       G4double sinTmp = sinCur;
       sinCur = sinCur*cosStep + cosCur*sinStep;
       cosCur = cosCur*cosStep - sinTmp*sinStep;
     }
     for (G4int j=0; j<6; ++j)
     {
       pols[ksteps+1][j].set(r0[j]*cosEnd,r0[j]*sinEnd,z0[j]);
     }
 
     // set sub-envelope and adjust extent
     G4double emin,emax;
     G4BoundingEnvelope benv(polygons);
     if (!benv.CalculateExtent(pAxis,pVoxelLimit,pTransform,emin,emax)) continue;
     if (emin < pMin) pMin = emin;
     if (emax > pMax) pMax = emax;
     if (eminlim > pMin && emaxlim < pMax) return true; // max possible extent
   }
   return (pMin < pMax);
 }

Here is the call graph for this function:

G4VSolid * G4GenericPolycone::Clone ( ) const

virtual

Reimplemented from G4VSolid.

Definition at line 620 of file G4GenericPolycone.cc.

 {
   return new G4GenericPolycone(*this);
 }

Here is the call graph for this function:

void G4GenericPolycone::CopyStuff ( const G4GenericPolycone & source )

protected

Definition at line 311 of file G4GenericPolycone.cc.

 {
   //
   // Simple stuff
   //
   startPhi  = source.startPhi;
   endPhi    = source.endPhi;
   phiIsOpen  = source.phiIsOpen;
   numCorner  = source.numCorner;
 
   //
   // The corner array
   //
   corners = new G4PolyconeSideRZ[numCorner];
   
   G4PolyconeSideRZ  *corn = corners,
         *sourceCorn = source.corners;
   do    // Loop checking, 13.08.2015, G.Cosmo
   {
     *corn = *sourceCorn;
   } while( ++sourceCorn, ++corn < corners+numCorner );
   
   //
   // Enclosing cylinder
   //
   enclosingCylinder = new G4EnclosingCylinder( *source.enclosingCylinder );
 
   fRebuildPolyhedron = false;
   fpPolyhedron = 0;
 }

Here is the caller graph for this function:

void G4GenericPolycone::Create	(	G4double	phiStart,
		G4double	phiTotal,
		G4ReduciblePolygon *	rz
	)

protected

Definition at line 90 of file G4GenericPolycone.cc.

 {
   //
   // Perform checks of rz values
   //
   if (rz->Amin() < 0.0)
   {
     std::ostringstream message;
     message << "Illegal input parameters - " << GetName() << G4endl
             << "        All R values must be >= 0 !";
     G4Exception("G4GenericPolycone::Create()", "GeomSolids0002",
                 FatalErrorInArgument, message);
   }
     
   G4double rzArea = rz->Area();
   if (rzArea < -kCarTolerance)
   {
     rz->ReverseOrder();
   }
   else if (rzArea < kCarTolerance)
   {
     std::ostringstream message;
     message << "Illegal input parameters - " << GetName() << G4endl
             << "        R/Z cross section is zero or near zero: " << rzArea;
     G4Exception("G4GenericPolycone::Create()", "GeomSolids0002",
                 FatalErrorInArgument, message);
   }
     
   if ( (!rz->RemoveDuplicateVertices( kCarTolerance ))
     || (!rz->RemoveRedundantVertices( kCarTolerance ))     ) 
   {
     std::ostringstream message;
     message << "Illegal input parameters - " << GetName() << G4endl
             << "        Too few unique R/Z values !";
     G4Exception("G4GenericPolycone::Create()", "GeomSolids0002",
                 FatalErrorInArgument, message);
   }
 
   if (rz->CrossesItself(1/kInfinity)) 
   {
     std::ostringstream message;
     message << "Illegal input parameters - " << GetName() << G4endl
             << "        R/Z segments cross !";
     G4Exception("G4GenericPolycone::Create()", "GeomSolids0002",
                 FatalErrorInArgument, message);
   }
 
   numCorner = rz->NumVertices();
 
   //
   // Phi opening? Account for some possible roundoff, and interpret
   // nonsense value as representing no phi opening
   //
   if (phiTotal <= 0 || phiTotal > twopi-1E-10)
   {
     phiIsOpen = false;
     startPhi = 0;
     endPhi = twopi;
   }
   else
   {
     phiIsOpen = true;
     
     //
     // Convert phi into our convention
     //
     startPhi = phiStart;
     while( startPhi < 0 )    // Loop checking, 13.08.2015, G.Cosmo
       startPhi += twopi;
     
     endPhi = phiStart+phiTotal;
     while( endPhi < startPhi )    // Loop checking, 13.08.2015, G.Cosmo
       endPhi += twopi;
   }
   
   //
   // Allocate corner array. 
   //
   corners = new G4PolyconeSideRZ[numCorner];
 
   //
   // Copy corners
   //
   G4ReduciblePolygonIterator iterRZ(rz);
   
   G4PolyconeSideRZ *next = corners;
   iterRZ.Begin();
   do    // Loop checking, 13.08.2015, G.Cosmo
   {
     next->r = iterRZ.GetA();
     next->z = iterRZ.GetB();
   } while( ++next, iterRZ.Next() );
   
   //
   // Allocate face pointer array
   //
   numFace = phiIsOpen ? numCorner+2 : numCorner;
   faces = new G4VCSGface*[numFace];
   
   //
   // Construct conical faces
   //
   // But! Don't construct a face if both points are at zero radius!
   //
   G4PolyconeSideRZ *corner = corners,
                    *prev = corners + numCorner-1,
                    *nextNext;
   G4VCSGface  **face = faces;
   do    // Loop checking, 13.08.2015, G.Cosmo
   {
     next = corner+1;
     if (next >= corners+numCorner) next = corners;
     nextNext = next+1;
     if (nextNext >= corners+numCorner) nextNext = corners;
     
     if (corner->r < 1/kInfinity && next->r < 1/kInfinity) continue;
     
     //
     // We must decide here if we can dare declare one of our faces
     // as having a "valid" normal (i.e. allBehind = true). This
     // is never possible if the face faces "inward" in r.
     //
     G4bool allBehind;
     if (corner->z > next->z)
     {
       allBehind = false;
     }
     else
     {
       //
       // Otherwise, it is only true if the line passing
       // through the two points of the segment do not
       // split the r/z cross section
       //
       allBehind = !rz->BisectedBy( corner->r, corner->z,
                  next->r, next->z, kCarTolerance );
     }
     
     *face++ = new G4PolyconeSide( prev, corner, next, nextNext,
                 startPhi, endPhi-startPhi, phiIsOpen, allBehind );
   } while( prev=corner, corner=next, corner > corners );
   
   if (phiIsOpen)
   {
     //
     // Construct phi open edges
     //
     *face++ = new G4PolyPhiFace( rz, startPhi, 0, endPhi  );
     *face++ = new G4PolyPhiFace( rz, endPhi,   0, startPhi );
   }
   
   //
   // We might have dropped a face or two: recalculate numFace
   //
   numFace = face-faces;
   
   //
   // Make enclosingCylinder
   //
   enclosingCylinder =
     new G4EnclosingCylinder( rz, phiIsOpen, phiStart, phiTotal );
 }

Here is the call graph for this function:

Here is the caller graph for this function:

G4Polyhedron * G4GenericPolycone::CreatePolyhedron ( ) const

virtual

Creates user defined polyhedron. This function allows to the user to define arbitrary polyhedron. The faces of the polyhedron should be either triangles or planar quadrilateral. Nodes of a face are defined by indexes pointing to the elements in the xyz array. Numeration of the elements in the array starts from 1 (like in fortran). The indexes can be positive or negative. Negative sign means that the corresponding edge is invisible. The normal of the face should be directed to exterior of the polyhedron.

Parameters

Nnodes	number of nodes
Nfaces	number of faces
xyz	nodes
faces_vec	faces (quadrilaterals or triangles)

Returns: status of the operation - is non-zero in case of problem

Implements G4VCSGfaceted.

Definition at line 667 of file G4GenericPolycone.cc.

 { 
     // The following code prepares for:
     // HepPolyhedron::createPolyhedron(int Nnodes, int Nfaces,
     //                                  const double xyz[][3],
     //                                  const int faces_vec[][4])
     // Here is an extract from the header file HepPolyhedron.h:
     const G4int numSide =
           G4int(G4Polyhedron::GetNumberOfRotationSteps()
                 * (endPhi - startPhi) / twopi) + 1;
     G4int nNodes;
     G4int nFaces;
     typedef G4double double3[3];
     double3* xyz;
     typedef G4int int4[4];
     int4* faces_vec;
     if (phiIsOpen)
     {
       // Triangulate open ends. Simple ear-chopping algorithm...
       // I'm not sure how robust this algorithm is (J.Allison).
       //
       std::vector<G4bool> chopped(numCorner, false);
       std::vector<G4int*> triQuads;
       G4int remaining = numCorner;
       G4int iStarter = 0;
       while (remaining >= 3)    // Loop checking, 13.08.2015, G.Cosmo
       {
         // Find unchopped corners...
         //
         G4int A = -1, B = -1, C = -1;
         G4int iStepper = iStarter;
         do    // Loop checking, 13.08.2015, G.Cosmo
         {
           if (A < 0)      { A = iStepper; }
           else if (B < 0) { B = iStepper; }
           else if (C < 0) { C = iStepper; }
           do    // Loop checking, 13.08.2015, G.Cosmo
           {
             if (++iStepper >= numCorner) { iStepper = 0; }
           }
           while (chopped[iStepper]);
         }
         while (C < 0 && iStepper != iStarter);
 
         // Check triangle at B is pointing outward (an "ear").
         // Sign of z cross product determines...
         //
         G4double BAr = corners[A].r - corners[B].r;
         G4double BAz = corners[A].z - corners[B].z;
         G4double BCr = corners[C].r - corners[B].r;
         G4double BCz = corners[C].z - corners[B].z;
         if (BAr * BCz - BAz * BCr < kCarTolerance)
         {
           G4int* tq = new G4int[3];
           tq[0] = A + 1;
           tq[1] = B + 1;
           tq[2] = C + 1;
           triQuads.push_back(tq);
           chopped[B] = true;
           --remaining;
         }
         else
         {
           do    // Loop checking, 13.08.2015, G.Cosmo
           {
             if (++iStarter >= numCorner) { iStarter = 0; }
           }
           while (chopped[iStarter]);
         }
       }
       // Transfer to faces...
       //
       nNodes = (numSide + 1) * numCorner;
       nFaces = numSide * numCorner + 2 * triQuads.size();
       faces_vec = new int4[nFaces];
       G4int iface = 0;
       G4int addition = numCorner * numSide;
       G4int d = numCorner - 1;
       for (G4int iEnd = 0; iEnd < 2; ++iEnd)
       {
         for (size_t i = 0; i < triQuads.size(); ++i)
         {
           // Negative for soft/auxiliary/normally invisible edges...
           //
           G4int a, b, c;
           if (iEnd == 0)
           {
             a = triQuads[i][0];
             b = triQuads[i][1];
             c = triQuads[i][2];
           }
           else
           {
             a = triQuads[i][0] + addition;
             b = triQuads[i][2] + addition;
             c = triQuads[i][1] + addition;
           }
           G4int ab = std::abs(b - a);
           G4int bc = std::abs(c - b);
           G4int ca = std::abs(a - c);
           faces_vec[iface][0] = (ab == 1 || ab == d)? a: -a;
           faces_vec[iface][1] = (bc == 1 || bc == d)? b: -b;
           faces_vec[iface][2] = (ca == 1 || ca == d)? c: -c;
           faces_vec[iface][3] = 0;
           ++iface;
         }
       }
 
       // Continue with sides...
 
       xyz = new double3[nNodes];
       const G4double dPhi = (endPhi - startPhi) / numSide;
       G4double phi = startPhi;
       G4int ixyz = 0;
       for (G4int iSide = 0; iSide < numSide; ++iSide)
       {
         for (G4int iCorner = 0; iCorner < numCorner; ++iCorner)
         {
           xyz[ixyz][0] = corners[iCorner].r * std::cos(phi);
           xyz[ixyz][1] = corners[iCorner].r * std::sin(phi);
           xyz[ixyz][2] = corners[iCorner].z;
           if (iSide == 0)   // startPhi
           {
             if (iCorner < numCorner - 1)
             {
               faces_vec[iface][0] = ixyz + 1;
               faces_vec[iface][1] = -(ixyz + numCorner + 1);
               faces_vec[iface][2] = ixyz + numCorner + 2;
               faces_vec[iface][3] = ixyz + 2;
             }
             else
             {
               faces_vec[iface][0] = ixyz + 1;
               faces_vec[iface][1] = -(ixyz + numCorner + 1);
               faces_vec[iface][2] = ixyz + 2;
               faces_vec[iface][3] = ixyz - numCorner + 2;
             }
           }
           else if (iSide == numSide - 1)   // endPhi
           {
             if (iCorner < numCorner - 1)
               {
                 faces_vec[iface][0] = ixyz + 1;
                 faces_vec[iface][1] = ixyz + numCorner + 1;
                 faces_vec[iface][2] = ixyz + numCorner + 2;
                 faces_vec[iface][3] = -(ixyz + 2);
               }
             else
               {
                 faces_vec[iface][0] = ixyz + 1;
                 faces_vec[iface][1] = ixyz + numCorner + 1;
                 faces_vec[iface][2] = ixyz + 2;
                 faces_vec[iface][3] = -(ixyz - numCorner + 2);
               }
           }
           else
           {
             if (iCorner < numCorner - 1)
               {
                 faces_vec[iface][0] = ixyz + 1;
                 faces_vec[iface][1] = -(ixyz + numCorner + 1);
                 faces_vec[iface][2] = ixyz + numCorner + 2;
                 faces_vec[iface][3] = -(ixyz + 2);
               }
               else
               {
                 faces_vec[iface][0] = ixyz + 1;
                 faces_vec[iface][1] = -(ixyz + numCorner + 1);
                 faces_vec[iface][2] = ixyz + 2;
                 faces_vec[iface][3] = -(ixyz - numCorner + 2);
               }
             }
             ++iface;
             ++ixyz;
         }
         phi += dPhi;
       }
 
       // Last corners...
 
       for (G4int iCorner = 0; iCorner < numCorner; ++iCorner)
       {
         xyz[ixyz][0] = corners[iCorner].r * std::cos(phi);
         xyz[ixyz][1] = corners[iCorner].r * std::sin(phi);
         xyz[ixyz][2] = corners[iCorner].z;
         ++ixyz;
       }
     }
     else  // !phiIsOpen - i.e., a complete 360 degrees.
     {
       nNodes = numSide * numCorner;
       nFaces = numSide * numCorner;;
       xyz = new double3[nNodes];
       faces_vec = new int4[nFaces];
       const G4double dPhi = (endPhi - startPhi) / numSide;
       G4double phi = startPhi;
       G4int ixyz = 0, iface = 0;
       for (G4int iSide = 0; iSide < numSide; ++iSide)
       {
         for (G4int iCorner = 0; iCorner < numCorner; ++iCorner)
         {
           xyz[ixyz][0] = corners[iCorner].r * std::cos(phi);
           xyz[ixyz][1] = corners[iCorner].r * std::sin(phi);
           xyz[ixyz][2] = corners[iCorner].z;
 
           if (iSide < numSide - 1)
           {
             if (iCorner < numCorner - 1)
             {
               faces_vec[iface][0] = ixyz + 1;
               faces_vec[iface][1] = -(ixyz + numCorner + 1);
               faces_vec[iface][2] = ixyz + numCorner + 2;
               faces_vec[iface][3] = -(ixyz + 2);
             }
             else
             {
               faces_vec[iface][0] = ixyz + 1;
               faces_vec[iface][1] = -(ixyz + numCorner + 1);
               faces_vec[iface][2] = ixyz + 2;
               faces_vec[iface][3] = -(ixyz - numCorner + 2);
             }
           }
           else   // Last side joins ends...
           {
             if (iCorner < numCorner - 1)
             {
               faces_vec[iface][0] = ixyz + 1;
               faces_vec[iface][1] = -(ixyz + numCorner - nFaces + 1);
               faces_vec[iface][2] = ixyz + numCorner - nFaces + 2;
               faces_vec[iface][3] = -(ixyz + 2);
             }
             else
             {
               faces_vec[iface][0] = ixyz + 1;
               faces_vec[iface][1] = -(ixyz - nFaces + numCorner + 1);
               faces_vec[iface][2] = ixyz - nFaces + 2;
               faces_vec[iface][3] = -(ixyz - numCorner + 2);
             }
           }
           ++ixyz;
           ++iface;
         }
         phi += dPhi;
       }
     }
     G4Polyhedron* polyhedron = new G4Polyhedron;
     G4int prob = polyhedron->createPolyhedron(nNodes, nFaces, xyz, faces_vec);
     delete [] faces_vec;
     delete [] xyz;
     if (prob)
     {
       std::ostringstream message;
       message << "Problem creating G4Polyhedron for: " << GetName();
       G4Exception("G4GenericPolycone::CreatePolyhedron()", "GeomSolids1002",
                   JustWarning, message);
       delete polyhedron;
       return 0;
     }
     else
     {
       return polyhedron;
     }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

G4double G4GenericPolycone::DistanceToIn	(	const G4ThreeVector &	p,
		const G4ThreeVector &	v
	)		const

virtual

Reimplemented from G4VCSGfaceted.

Definition at line 385 of file G4GenericPolycone.cc.

 {
   //
   // Quick test
   //
   if (enclosingCylinder->ShouldMiss(p,v))
     return kInfinity;
   
   //
   // Long answer
   //
   return G4VCSGfaceted::DistanceToIn( p, v );
 }

Here is the call graph for this function:

G4double G4GenericPolycone::DistanceToIn ( const G4ThreeVector & p ) const

virtual

Reimplemented from G4VCSGfaceted.

Definition at line 404 of file G4GenericPolycone.cc.

 {
   return G4VCSGfaceted::DistanceToIn(p);
 }

Here is the call graph for this function:

void G4GenericPolycone::Extent	(	G4ThreeVector &	pMin,
		G4ThreeVector &	pMax
	)		const

virtual

Reimplemented from G4VSolid.

Definition at line 414 of file G4GenericPolycone.cc.

 {
   G4double rmin = kInfinity, rmax = -kInfinity;
   G4double zmin = kInfinity, zmax = -kInfinity;
 
   for (G4int i=0; i<GetNumRZCorner(); ++i)
   {
     G4PolyconeSideRZ corner = GetCorner(i);
     if (corner.r < rmin) rmin = corner.r;
     if (corner.r > rmax) rmax = corner.r;
     if (corner.z < zmin) zmin = corner.z;
     if (corner.z > zmax) zmax = corner.z;
   }
 
   if (IsOpen())
   {
     G4TwoVector vmin,vmax;
     G4GeomTools::DiskExtent(rmin,rmax,
                             GetSinStartPhi(),GetCosStartPhi(),
                             GetSinEndPhi(),GetCosEndPhi(),
                             vmin,vmax);
     pMin.set(vmin.x(),vmin.y(),zmin);
     pMax.set(vmax.x(),vmax.y(),zmax);
   }
   else
   {
     pMin.set(-rmax,-rmax, zmin);
     pMax.set( rmax, rmax, zmax);
   }
 
   // Check correctness of the bounding box
   //
   if (pMin.x() >= pMax.x() || pMin.y() >= pMax.y() || pMin.z() >= pMax.z())
   {
     std::ostringstream message;
     message << "Bad bounding box (min >= max) for solid: "
             << GetName() << " !"
             << "\npMin = " << pMin
             << "\npMax = " << pMax;
     G4Exception("GenericG4Polycone::Extent()", "GeomMgt0001",
                 JustWarning, message);
     DumpInfo();
   }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

G4PolyconeSideRZ G4GenericPolycone::GetCorner ( G4int index ) const

inline

Here is the caller graph for this function:

G4double G4GenericPolycone::GetCosEndPhi ( ) const

inline

Here is the caller graph for this function:

G4double G4GenericPolycone::GetCosStartPhi ( ) const

inline

Here is the caller graph for this function:

G4double G4GenericPolycone::GetEndPhi ( ) const

inline

Here is the caller graph for this function:

G4GeometryType G4GenericPolycone::GetEntityType ( ) const

virtual

Reimplemented from G4VCSGfaceted.

Definition at line 611 of file G4GenericPolycone.cc.

 {
   return G4String("G4GenericPolycone");
 }

G4int G4GenericPolycone::GetNumRZCorner ( ) const

inline

Here is the caller graph for this function:

G4ThreeVector G4GenericPolycone::GetPointOnSurface ( ) const

virtual

Reimplemented from G4VSolid.

Definition at line 658 of file G4GenericPolycone.cc.

 {
   return GetPointOnSurfaceGeneric();  
 
 }

Here is the call graph for this function:

G4double G4GenericPolycone::GetSinEndPhi ( ) const

inline

Here is the caller graph for this function:

G4double G4GenericPolycone::GetSinStartPhi ( ) const

inline

Here is the caller graph for this function:

G4double G4GenericPolycone::GetStartPhi ( ) const

inline

Here is the caller graph for this function:

EInside G4GenericPolycone::Inside ( const G4ThreeVector & p ) const

virtual

Reimplemented from G4VCSGfaceted.

Definition at line 365 of file G4GenericPolycone.cc.

 {
   //
   // Quick test
   //
   if (enclosingCylinder->MustBeOutside(p)) return kOutside;
 
   //
   // Long answer
   //
   return G4VCSGfaceted::Inside(p);
 }

Here is the call graph for this function:

G4bool G4GenericPolycone::IsOpen ( ) const

inline

Here is the caller graph for this function:

G4GenericPolycone & G4GenericPolycone::operator= ( const G4GenericPolycone & source )

Definition at line 291 of file G4GenericPolycone.cc.

 {
   if (this == &source) return *this;
   
   G4VCSGfaceted::operator=( source );
   
   delete [] corners;
   // if (original_parameters) delete original_parameters;
   
   delete enclosingCylinder;
   
   CopyStuff( source );
   
   return *this;
 }

Here is the call graph for this function:

G4bool G4GenericPolycone::Reset ( )

Definition at line 346 of file G4GenericPolycone.cc.

 {
  
     std::ostringstream message;
     message << "Solid " << GetName() << " built using generic construct."
             << G4endl << "Not applicable to the generic construct !";
     G4Exception("G4GenericPolycone::Reset()", "GeomSolids1001",
                 JustWarning, message, "Parameters NOT resetted.");
     return 1;
  
 }

Here is the call graph for this function:

std::ostream & G4GenericPolycone::StreamInfo ( std::ostream & os ) const

virtual

Reimplemented from G4VCSGfaceted.

Definition at line 628 of file G4GenericPolycone.cc.

 {
   G4int oldprc = os.precision(16);
   os << "-----------------------------------------------------------\n"
      << "    *** Dump for solid - " << GetName() << " ***\n"
      << "    ===================================================\n"
      << " Solid type: G4GenericPolycone\n"
      << " Parameters: \n"
      << "    starting phi angle : " << startPhi/degree << " degrees \n"
      << "    ending phi angle   : " << endPhi/degree << " degrees \n";
   G4int i=0;
  
   os << "    number of RZ points: " << numCorner << "\n"
      << "              RZ values (corners): \n";
      for (i=0; i<numCorner; i++)
      {
        os << "                         "
           << corners[i].r << ", " << corners[i].z << "\n";
      }
   os << "-----------------------------------------------------------\n";
   os.precision(oldprc);
 
   return os;
 }

Here is the call graph for this function:

Member Data Documentation

G4PolyconeSideRZ* G4GenericPolycone::corners

protected

Definition at line 153 of file G4GenericPolycone.hh.

G4EnclosingCylinder* G4GenericPolycone::enclosingCylinder

protected

Definition at line 157 of file G4GenericPolycone.hh.

G4double G4GenericPolycone::endPhi

protected

Definition at line 150 of file G4GenericPolycone.hh.

G4int G4GenericPolycone::numCorner

protected

Definition at line 152 of file G4GenericPolycone.hh.

G4bool G4GenericPolycone::phiIsOpen

protected

Definition at line 151 of file G4GenericPolycone.hh.

G4double G4GenericPolycone::startPhi

protected

Definition at line 149 of file G4GenericPolycone.hh.

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

source/geant4.10.03.p03/source/geometry/solids/specific/include/G4GenericPolycone.hh
source/geant4.10.03.p03/source/geometry/solids/specific/src/G4GenericPolycone.cc

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation