Gabriele Cosmo
229 lines
7.3 KiB
C++
229 lines
7.3 KiB
C++
//
|
|
// ********************************************************************
|
|
// * License and Disclaimer *
|
|
// * *
|
|
// * The Geant4 software is copyright of the Copyright Holders of *
|
|
// * the Geant4 Collaboration. It is provided under the terms and *
|
|
// * conditions of the Geant4 Software License, included in the file *
|
|
// * LICENSE and available at http://cern.ch/geant4/license . These *
|
|
// * include a list of copyright holders. *
|
|
// * *
|
|
// * Neither the authors of this software system, nor their employing *
|
|
// * institutes,nor the agencies providing financial support for this *
|
|
// * work make any representation or warranty, express or implied, *
|
|
// * regarding this software system or assume any liability for its *
|
|
// * use. Please see the license in the file LICENSE and URL above *
|
|
// * for the full disclaimer and the limitation of liability. *
|
|
// * *
|
|
// * This code implementation is the intellectual property of the *
|
|
// * Vanderbilt University Free Electron Laser Center *
|
|
// * Vanderbilt University, Nashville, TN, USA *
|
|
// * Development supported by: *
|
|
// * United States MFEL program under grant FA9550-04-1-0045 *
|
|
// * and NASA under contract number NNG04CT05P *
|
|
// * Written by Marcus H. Mendenhall and Robert A. Weller. *
|
|
// * *
|
|
// * Contributed to the Geant4 Core, January, 2005. *
|
|
// * *
|
|
// ********************************************************************
|
|
//
|
|
// $Id:$
|
|
//
|
|
//
|
|
// Implementation for G4UTet wrapper class
|
|
// --------------------------------------------------------------------
|
|
|
|
#include "G4Tet.hh"
|
|
#if 0
|
|
#include "G4UTet.hh"
|
|
|
|
#if ( defined(G4GEOM_USE_USOLIDS) || defined(G4GEOM_USE_PARTIAL_USOLIDS) )
|
|
|
|
#include "G4AffineTransform.hh"
|
|
#include "G4VPVParameterisation.hh"
|
|
#include "G4BoundingEnvelope.hh"
|
|
|
|
using namespace CLHEP;
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Constructor - create a tetrahedron
|
|
// This class is implemented separately from general polyhedra,
|
|
// because the simplex geometry can be computed very quickly,
|
|
// which may become important in situations imported from mesh generators,
|
|
// in which a very large number of G4Tets are created.
|
|
// A Tet has all of its geometrical information precomputed
|
|
//
|
|
G4UTet::G4UTet(const G4String& pName,
|
|
G4ThreeVector anchor,
|
|
G4ThreeVector p2,
|
|
G4ThreeVector p3,
|
|
G4ThreeVector p4, G4bool* degeneracyFlag)
|
|
: G4USolid(pName, new UTet(pName,
|
|
UVector3(anchor.x(),anchor.y(),anchor.z()),
|
|
UVector3(p2.x(), p2.y(), p2.z()),
|
|
UVector3(p3.x(), p3.y(), p3.z()),
|
|
UVector3(p4.x(), p4.y(), p4.z()),
|
|
degeneracyFlag))
|
|
{
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Fake default constructor - sets only member data and allocates memory
|
|
// for usage restricted to object persistency.
|
|
//
|
|
G4UTet::G4UTet( __void__& a )
|
|
: G4USolid(a)
|
|
{
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Destructor
|
|
//
|
|
G4UTet::~G4UTet()
|
|
{
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copy constructor
|
|
//
|
|
G4UTet::G4UTet(const G4UTet& rhs)
|
|
: G4USolid(rhs)
|
|
{
|
|
}
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Assignment operator
|
|
//
|
|
G4UTet& G4UTet::operator = (const G4UTet& rhs)
|
|
{
|
|
// Check assignment to self
|
|
//
|
|
if (this == &rhs) { return *this; }
|
|
|
|
// Copy base class data
|
|
//
|
|
G4USolid::operator=(rhs);
|
|
|
|
return *this;
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Accessors
|
|
//
|
|
std::vector<G4ThreeVector> G4UTet::GetVertices() const
|
|
{
|
|
std::vector<UVector3> vec = GetShape()->GetVertices();
|
|
std::vector<G4ThreeVector> vertices;
|
|
for (unsigned int i=0; i<vec.size(); ++i)
|
|
{
|
|
G4ThreeVector v(vec[i].x(), vec[i].y(), vec[i].z());
|
|
vertices.push_back(v);
|
|
}
|
|
return vertices;
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Get bounding box
|
|
|
|
void G4UTet::BoundingLimits(G4ThreeVector& pMin, G4ThreeVector& pMax) const
|
|
{
|
|
UVector3 vmin, vmax;
|
|
GetShape()->Extent(vmin,vmax);
|
|
pMin.set(vmin.x(),vmin.y(),vmin.z());
|
|
pMax.set(vmax.x(),vmax.y(),vmax.z());
|
|
|
|
// 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("G4UTet::BoundingLimits()", "GeomMgt0001",
|
|
JustWarning, message);
|
|
StreamInfo(G4cout);
|
|
}
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Calculate extent under transform and specified limit
|
|
|
|
G4bool
|
|
G4UTet::CalculateExtent(const EAxis pAxis,
|
|
const G4VoxelLimits& pVoxelLimit,
|
|
const G4AffineTransform& pTransform,
|
|
G4double& pMin, G4double& pMax) const
|
|
{
|
|
G4ThreeVector bmin, bmax;
|
|
G4bool exist;
|
|
|
|
// Check bounding box (bbox)
|
|
//
|
|
BoundingLimits(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;
|
|
}
|
|
|
|
// Set bounding envelope (benv) and calculate extent
|
|
//
|
|
std::vector<UVector3> vec = GetShape()->GetVertices();
|
|
|
|
G4ThreeVectorList anchor(1);
|
|
anchor[0].set(vec[0].x(),vec[0].y(),vec[0].z());
|
|
|
|
G4ThreeVectorList base(3);
|
|
base[0].set(vec[1].x(),vec[1].y(),vec[1].z());
|
|
base[1].set(vec[2].x(),vec[2].y(),vec[2].z());
|
|
base[2].set(vec[3].x(),vec[3].y(),vec[3].z());
|
|
|
|
std::vector<const G4ThreeVectorList *> polygons(2);
|
|
polygons[0] = &anchor;
|
|
polygons[1] = &base;
|
|
|
|
G4BoundingEnvelope benv(bmin,bmax,polygons);
|
|
exist = benv.CalculateExtent(pAxis,pVoxelLimit,pTransform,pMin,pMax);
|
|
return exist;
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// CreatePolyhedron
|
|
//
|
|
G4Polyhedron* G4UTet::CreatePolyhedron() const
|
|
{
|
|
G4int index = 0;
|
|
G4double array[12];
|
|
GetShape()->GetParametersList(index, array);
|
|
|
|
G4Polyhedron *ph=new G4Polyhedron;
|
|
G4double xyz[4][3];
|
|
const G4int faces[4][4]={{1,3,2,0},{1,4,3,0},{1,2,4,0},{2,3,4,0}};
|
|
xyz[0][0]=array[0]; xyz[0][1]=array[1]; xyz[0][2]=array[2]; // fAnchor
|
|
xyz[1][0]=array[3]; xyz[1][1]=array[4]; xyz[1][2]=array[5]; // fP2
|
|
xyz[2][0]=array[6]; xyz[2][1]=array[7]; xyz[2][2]=array[8]; // fP3
|
|
xyz[3][0]=array[9]; xyz[3][1]=array[10]; xyz[3][2]=array[11]; // fP4
|
|
|
|
ph->createPolyhedron(4,4,xyz,faces);
|
|
|
|
return ph;
|
|
}
|
|
|
|
#endif // G4GEOM_USE_USOLIDS
|
|
#endif
|