Newer
Older
#include "DDRec/Surface.h"
#include "DD4hep/Detector.h"
#include <exception>
#include <memory>
#include "TGeoMatrix.h"
#include "TGeoShape.h"
#include "TRotation.h"
namespace DD4hep {
namespace DDRec {
using namespace Geometry ;
//--------------------------------------------------------
/** Copy c'tor - copies handle */
SurfaceMaterial::SurfaceMaterial( Geometry::Material m ) : Geometry::Material( m ) {}
SurfaceMaterial::SurfaceMaterial( const SurfaceMaterial& sm ) : Geometry::Material( sm ) {
// (*this).Geometry::Material::m_element = sm.Geometry::Material::m_element ;
}
SurfaceMaterial:: ~SurfaceMaterial() {}
//--------------------------------------------------------
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
SurfaceData::SurfaceData() : _type( SurfaceType() ) ,
_u( Vector3D() ) ,
_v( Vector3D() ) ,
_n( Vector3D() ) ,
_o( Vector3D() ) ,
_th_i( 0. ),
_th_o( 0. ),
_innerMat( Material() ),
_outerMat( Material() ) {
}
SurfaceData::SurfaceData( SurfaceType type , double thickness_inner ,double thickness_outer,
Vector3D u ,Vector3D v ,Vector3D n ,Vector3D o ) : _type(type ) ,
_u( u ) ,
_v( v ) ,
_n( n ) ,
_o( o ),
_th_i( thickness_inner ),
_th_o( thickness_outer ),
_innerMat( Material() ),
_outerMat( Material() ) {
}
VolSurface::VolSurface( Volume vol, SurfaceType type, double thickness_inner ,double thickness_outer,
Vector3D u ,Vector3D v ,Vector3D n ,Vector3D o ) :
Handle( new SurfaceData( type, thickness_inner ,thickness_outer, u,v,n,o) ) ,
_vol( vol ) {
}
/** Distance to surface */
double VolPlane::distance(const Vector3D& point ) const {
return ( point - origin() ) * normal() ;
}
/// Checks if the given point lies within the surface
bool VolPlane::insideBounds(const Vector3D& point, double epsilon) const {
double dist = std::abs ( distance( point ) ) ;
bool inShape = volume()->GetShape()->Contains( point ) ;
std::cout << " ** Surface::insideBound( " << point << " ) - distance = " << dist
<< " origin = " << origin() << " normal = " << normal()
<< " p * n = " << point * normal()
<< " isInShape : " << inShape << std::endl ;
return dist < epsilon && inShape ;
#else
return ( std::abs ( distance( point ) ) < epsilon ) && volume()->GetShape()->Contains( point ) ;
#endif
}
/** Distance to surface */
double VolCylinder::distance(const Vector3D& point ) const {
return point.rho() - origin().rho() ;
}
/// Checks if the given point lies within the surface
bool VolCylinder::insideBounds(const Vector3D& point, double epsilon) const {
double distR = std::abs( distance( point ) ) ;
bool inShapeT = volume()->GetShape()->Contains( point ) ;
std::cout << " ** Surface::insideBound( " << point << " ) - distance = " << distR
<< " origin = " << origin()
<< " isInShape : " << inShapeT << std::endl ;
return ( std::abs ( distance( point ) ) < epsilon ) && volume()->GetShape()->Contains( point ) ;
#endif
}
//====================
VolSurfaceList* volSurfaceList( DetElement& det ) {
VolSurfaceList* list = 0 ;
try {
list = det.extension< VolSurfaceList >() ;
} catch( std::runtime_error e){
list = det.addExtension<VolSurfaceList >( new VolSurfaceList ) ;
}
return list ;
}
//======================================================================================================================
bool findVolume( PlacedVolume pv, Volume theVol, std::list< PlacedVolume >& volList ) {
volList.push_back( pv ) ;
// unsigned count = volList.size() ;
// for(unsigned i=0 ; i < count ; ++i) {
// std::cout << " searching for volume: " << theVol.name() << " " << std::hex << theVol.ptr() << " <-> pv.volume : " << pv.name() << " " << pv.volume().ptr()
// << " pv.volume().ptr() == theVol.ptr() " << (pv.volume().ptr() == theVol.ptr() )
// << std::endl ;
if( pv.volume().ptr() == theVol.ptr() ) {
return true ;
} else {
//--------------------------------
const TGeoNode* node = pv.ptr();
if ( !node ) {
// std::cout << " *** findVolume: Invalid placement: - node pointer Null for volume: " << pv.name() << std::endl ;
throw std::runtime_error("*** findVolume: Invalid placement: - node pointer Null ! " + std::string( pv.name() ) );
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
// std::cout << " ndau = " << node->GetNdaughters() << std::endl ;
for (Int_t idau = 0, ndau = node->GetNdaughters(); idau < ndau; ++idau) {
TGeoNode* daughter = node->GetDaughter(idau);
PlacedVolume placement( daughter );
if ( !placement.data() ) {
throw std::runtime_error("*** findVolume: Invalid not instrumented placement:"+std::string(daughter->GetName())
+" [Internal error -- bad detector constructor]");
}
PlacedVolume pv_dau = Ref_t(daughter); // why use a Ref_t here ???
if( findVolume( pv_dau , theVol , volList ) ) {
// std::cout << " ----- found in daughter volume !!! " << std::hex << pv_dau.volume().ptr() << std::endl ;
return true ;
}
}
// ------- not found:
volList.pop_back() ;
return false ;
//--------------------------------
}
}
Surface::Surface( Geometry::DetElement det, VolSurface volSurf ) : _det( det) , _volSurf( volSurf ), _wtM(0) , _id( 0) , _type( _volSurf.type() ) {
initialize() ;
}
const IMaterial& Surface::innerMaterial() const {
if( ! mat.isValid() ) {
// fixme: for now just set the material of the volume holding the surface
// neeed averaged material in case of several volumes...
// _volSurf.setInnerMaterial( _volSurf.volume().material() ) ;
mat = _volSurf.volume().material() ;
// std::cout << " **** Surface::innerMaterial() - assigning volume material to surface : " << mat.name() << std::endl ;
}
return _volSurf.innerMaterial() ;
}
const IMaterial& Surface::outerMaterial() const {
if( ! mat.isValid() ) {
// fixme: for now just set the material of the volume holding the surface
// neeed averaged material in case of several volumes...
// _volSurf.setOuterMaterial( _volSurf.volume().material() ) ;
mat = _volSurf.volume().material() ;
//std::cout << " **** Surface::outerMaterial() - assigning volume material to surface : " << mat.name() << std::endl ;
return _volSurf.outerMaterial() ;
}
double Surface::distance(const Vector3D& point ) const {
double pa[3] ;
_wtM->MasterToLocal( point , pa ) ;
Vector3D localPoint( pa ) ;
return ( _volSurf.type().isPlane() ? VolPlane(_volSurf).distance( localPoint ) : VolCylinder(_volSurf).distance( localPoint ) ) ;
}
bool Surface::insideBounds(const Vector3D& point, double epsilon) const {
double pa[3] ;
_wtM->MasterToLocal( point , pa ) ;
Vector3D localPoint( pa ) ;
return ( _volSurf.type().isPlane() ? VolPlane(_volSurf).insideBounds( localPoint, epsilon ) : VolCylinder(_volSurf).insideBounds( localPoint , epsilon) ) ;
void Surface::initialize() {
// first we need to find the right volume for the local surface in the DetElement's volumes
std::list< PlacedVolume > pVList ;
PlacedVolume pv = _det.placement() ;
Volume theVol = _volSurf.volume() ;
if( ! findVolume( pv, theVol , pVList ) ){
throw std::runtime_error( " ***** ERROR: No Volume found for DetElement with surface " ) ;
}
// std::cout << " **** Surface::initialize() # placements for surface = " << pVList.size()
// << " worldTransform : "
// << std::endl ;
//=========== compute and cache world transform for surface ==========
TGeoMatrix* wm = _det.object<DetElement::Object>().worldTransformation() ;
wm->Print() ;
for( std::list<PlacedVolume>::iterator it= pVList.begin(), n = pVList.end() ; it != n ; ++it ){
PlacedVolume pv = *it ;
TGeoMatrix* m = pv->GetMatrix();
std::cout << " +++ matrix for placed volume : " << std::endl ;
m->Print() ;
}
#endif
// need to get the inverse transformation ( see Detector.cpp )
std::auto_ptr<TGeoHMatrix> wtI( new TGeoHMatrix( wm->Inverse() ) ) ;
//---- if the volSurface is not in the DetElement's volume, we need to mutliply the path to the volume to the
// DetElements world transform
for( std::list<PlacedVolume>::iterator it = ++( pVList.begin() ) , n = pVList.end() ; it != n ; ++it ){
PlacedVolume pv = *it ;
TGeoMatrix* m = pv->GetMatrix();
// std::cout << " +++ matrix for placed volume : " << std::endl ;
// m->Print() ;
// std::cout << " +++ new world transform matrix : " << std::endl ;
#if 0 //fixme: which convention to use here - the correct should be wtI, however it is the inverse of what is stored in DetElement ???
std::auto_ptr<TGeoHMatrix> wt( new TGeoHMatrix( wtI->Inverse() ) ) ;
wt->Print() ;
// cache the world transform for the surface
_wtM = wt.release() ;
#else
// wtI->Print() ;
// cache the world transform for the surface
_wtM = wtI.release() ;
#endif
// ============ now fill the global surface vectors ==========================
double ua[3], va[3], na[3], oa[3] ;
_wtM->LocalToMasterVect( _volSurf.u() , ua ) ;
_wtM->LocalToMasterVect( _volSurf.v() , va ) ;
_wtM->LocalToMasterVect( _volSurf.normal() , na ) ;
_wtM->LocalToMaster ( _volSurf.origin() , oa ) ;
_u.fill( ua ) ;
_v.fill( va ) ;
_n.fill( na ) ;
_o.fill( oa ) ;
// std::cout << " --- global surface vectors : ------- " << std::endl
// << " u : " << _u << std::endl
// << " v : " << _v << std::endl
// << " n : " << _n << std::endl
// << " o : " << _o << std::endl ;
// =========== check parallel and orthogonal to Z ===================
_type.checkOrthogonalToZ( *this ) ;
//======== set the unique surface ID from the DetElement ( and placements below ? )
// just use the DetElement ID for now ...
_id = _det.volumeID() ;
// typedef PlacedVolume::VolIDs IDV ;
// DetElement d = _det ;
// while( d.isValid() && d.parent().isValid() ){
// PlacedVolume pv = d.placement() ;
// if( pv.isValid() ){
// const IDV& idV = pv.volIDs() ;
// std::cout << " VolIDs : " << d.name() << std::endl ;
// for( unsigned i=0, n=idV.size() ; i<n ; ++i){
// std::cout << " " << idV[i].first << " - " << idV[i].second << std::endl ;
// }
// }
// d = d.parent() ;
// }
}
//===================================================================================================================
std::vector< std::pair<Vector3D, Vector3D> > Surface::getLines(unsigned nMax) {
const static double epsilon = 1e-6 ;
std::vector< std::pair<Vector3D, Vector3D> > _vert ;
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
// get local and global surface vectors
const DDSurfaces::Vector3D& lu = _volSurf.u() ;
const DDSurfaces::Vector3D& lv = _volSurf.v() ;
const DDSurfaces::Vector3D& ln = _volSurf.normal() ;
const DDSurfaces::Vector3D& lo = _volSurf.origin() ;
Volume vol = volume() ;
const TGeoShape* shape = vol->GetShape() ;
if( type().isPlane() ) {
if( shape->IsA() == TGeoBBox::Class() ) {
TGeoBBox* box = ( TGeoBBox* ) shape ;
DDSurfaces::Vector3D boxDim( box->GetDX() , box->GetDY() , box->GetDZ() ) ;
bool isYZ = std::fabs( ln.x() - 1.0 ) < epsilon ; // normal parallel to x
bool isXZ = std::fabs( ln.y() - 1.0 ) < epsilon ; // normal parallel to y
bool isXY = std::fabs( ln.z() - 1.0 ) < epsilon ; // normal parallel to z
if( isYZ || isXZ || isXY ) { // plane is parallel to one of the box' sides -> need 4 vertices from box dimensions
// if isYZ :
unsigned uidx = 1 ;
unsigned vidx = 2 ;
DDSurfaces::Vector3D ubl( 0., 1., 0. ) ;
DDSurfaces::Vector3D vbl( 0., 0., 1. ) ;
if( isXZ ) {
ubl.fill( 1., 0., 0. ) ;
vbl.fill( 0., 0., 1. ) ;
uidx = 0 ;
vidx = 2 ;
} else if( isXY ) {
ubl.fill( 1., 0., 0. ) ;
vbl.fill( 0., 1., 0. ) ;
uidx = 0 ;
vidx = 1 ;
}
DDSurfaces::Vector3D ub ;
DDSurfaces::Vector3D vb ;
_wtM->LocalToMasterVect( ubl , ub.array() ) ;
_wtM->LocalToMasterVect( vbl , vb.array() ) ;
_vert.push_back( std::make_pair( _o + boxDim[ uidx ] * ub + boxDim[ vidx ] * vb , _o - boxDim[ uidx ] * ub + boxDim[ vidx ] * vb ) ) ;
_vert.push_back( std::make_pair( _o - boxDim[ uidx ] * ub + boxDim[ vidx ] * vb , _o - boxDim[ uidx ] * ub - boxDim[ vidx ] * vb ) ) ;
_vert.push_back( std::make_pair( _o - boxDim[ uidx ] * ub - boxDim[ vidx ] * vb , _o + boxDim[ uidx ] * ub - boxDim[ vidx ] * vb ) ) ;
_vert.push_back( std::make_pair( _o + boxDim[ uidx ] * ub - boxDim[ vidx ] * vb , _o + boxDim[ uidx ] * ub + boxDim[ vidx ] * vb ) ) ;
return _vert ;
}
}
// ===== default for arbitrary planes in arbitrary shapes =================
// We create nMax vertices by rotating the local u vector around the normal
// and checking the distance to the volume boundary in that direction.
// This is brute force and not very smart, as many points are created on straight
// lines and the edges are still rounded.
// The alterative would be to compute the true intersections a plane and the most
// common shapes - at least for boxes that should be not too hard. To be done...
double dAlpha = 2.* ROOT::Math::Pi() / double( nMax ) ;
TVector3 normal( ln.x() , ln.y() , ln.z() ) ;
DDSurfaces::Vector3D first, previous ;
for(unsigned i=0 ; i< nMax ; ++i ){
double alpha = double(i) * dAlpha ;
TVector3 vec( lu.x() , lu.y() , lu.z() ) ;
TRotation rot ;
rot.Rotate( alpha , normal );
TVector3 vecR = rot * vec ;
DDSurfaces::Vector3D luRot ;
luRot.fill( vecR ) ;
double dist = shape->DistFromInside( lo, luRot , 3, 0.1 ) ;
// local point at volume boundary
DDSurfaces::Vector3D lp = lo + dist * luRot ;
DDSurfaces::Vector3D gp ;
_wtM->LocalToMaster( lp , gp.array() ) ;
// std::cout << " **** normal:" << ln << " lu:" << lu << " alpha:" << alpha << " luRot:" << luRot << " lp :" << lp << " gp:" << gp << std::endl;
if( i > 0 )
_vert.push_back( std::make_pair( previous, gp ) ) ;
else
first = gp ;
previous = gp ;
_vert.push_back( std::make_pair( previous, first ) ) ;
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
// if( shape->IsA() == TGeoTube::Class() ) {
if( shape->IsA() == TGeoConeSeg::Class() ) {
_vert.reserve( nMax ) ;
TGeoTube* tube = ( TGeoTube* ) shape ;
double zHalf = tube->GetDZ() ;
Vector3D zv( 0. , 0. , zHalf ) ;
double r = lo.rho() ;
unsigned n = nMax / 4 ;
double dPhi = 2.* ROOT::Math::Pi() / double( n ) ;
for( unsigned i = 0 ; i < n ; ++i ) {
Vector3D rv0( r*sin( i *dPhi ) , r*cos( i *dPhi ) , 0. ) ;
Vector3D rv1( r*sin( (i+1)*dPhi ) , r*cos( (i+1)*dPhi ) , 0. ) ;
// 4 points on local cylinder
Vector3D pl0 = zv + rv0 ;
Vector3D pl1 = zv + rv1 ;
Vector3D pl2 = -zv + rv1 ;
Vector3D pl3 = -zv + rv0 ;
Vector3D pg0,pg1,pg2,pg3 ;
_wtM->LocalToMaster( pl0, pg0.array() ) ;
_wtM->LocalToMaster( pl1, pg1.array() ) ;
_wtM->LocalToMaster( pl2, pg2.array() ) ;
_wtM->LocalToMaster( pl3, pg3.array() ) ;
_vert.push_back( std::make_pair( pg0, pg1 ) ) ;
_vert.push_back( std::make_pair( pg1, pg2 ) ) ;
_vert.push_back( std::make_pair( pg2, pg3 ) ) ;
_vert.push_back( std::make_pair( pg3, pg0 ) ) ;
}
// unsigned n = nMax / 4 ;
// double dPhi = 2.* ROOT::Math::Pi() / double( n ) ;
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
// for( unsigned i = 0 ; i < n ; ++i ) {
// Vector3D rv0( r*sin( i *dPhi ) , r*cos( i *dPhi ) , 0. ) ;
// Vector3D rv1( r*sin( (i+1)*dPhi ) , r*cos( (i+1)*dPhi ) , 0. ) ;
// // 4 points on local cylinder
// Vector3D pl0 = zv + rv0 ;
// Vector3D pl1 = zv + rv1 ;
// Vector3D pl2 = -zv + rv1 ;
// Vector3D pl3 = -zv + rv0 ;
// Vector3D pg0,pg1,pg2,pg3 ;
// _wtM->LocalToMaster( pl0, pg0.array() ) ;
// _wtM->LocalToMaster( pl1, pg1.array() ) ;
// _wtM->LocalToMaster( pl2, pg2.array() ) ;
// _wtM->LocalToMaster( pl3, pg3.array() ) ;
// _vert.push_back( std::make_pair( pg0, pg1 ) ) ;
// _vert.push_back( std::make_pair( pg1, pg2 ) ) ;
// _vert.push_back( std::make_pair( pg2, pg3 ) ) ;
// _vert.push_back( std::make_pair( pg3, pg0 ) ) ;
// }
}
}
return _vert ;
}
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
// //===================================================================================================================
// std::vector< Vector3D > Surface::getVertices(unsigned nMax) {
// const static double epsilon = 1e-6 ;
// std::vector< Vector3D > _vert ;
// // get local and global surface vectors
// const DDSurfaces::Vector3D& lu = _volSurf.u() ;
// const DDSurfaces::Vector3D& lv = _volSurf.v() ;
// const DDSurfaces::Vector3D& ln = _volSurf.normal() ;
// const DDSurfaces::Vector3D& lo = _volSurf.origin() ;
// Volume vol = volume() ;
// const TGeoShape* shape = vol->GetShape() ;
// if( type().isPlane() ) {
// if( shape->IsA() == TGeoBBox::Class() ) {
// TGeoBBox* box = ( TGeoBBox* ) shape ;
// DDSurfaces::Vector3D boxDim( box->GetDX() , box->GetDY() , box->GetDZ() ) ;
// bool isYZ = std::fabs( ln.x() - 1.0 ) < epsilon ; // normal parallel to x
// bool isXZ = std::fabs( ln.y() - 1.0 ) < epsilon ; // normal parallel to y
// bool isXY = std::fabs( ln.z() - 1.0 ) < epsilon ; // normal parallel to z
// if( isYZ || isXZ || isXY ) { // plane is parallel to one of the box' sides -> need 4 vertices from box dimensions
// // if isYZ :
// unsigned uidx = 1 ;
// unsigned vidx = 2 ;
// DDSurfaces::Vector3D ubl( 0., 1., 0. ) ;
// DDSurfaces::Vector3D vbl( 0., 0., 1. ) ;
// if( isXZ ) {
// ubl.fill( 1., 0., 0. ) ;
// vbl.fill( 0., 0., 1. ) ;
// uidx = 0 ;
// vidx = 2 ;
// } else if( isXY ) {
// ubl.fill( 1., 0., 0. ) ;
// vbl.fill( 0., 1., 0. ) ;
// uidx = 0 ;
// vidx = 1 ;
// }
// DDSurfaces::Vector3D ub ;
// DDSurfaces::Vector3D vb ;
// _wtM->LocalToMasterVect( ubl , ub.array() ) ;
// _wtM->LocalToMasterVect( vbl , vb.array() ) ;
// _vert.resize(4) ;
// _vert[0] = _o + boxDim[ uidx ] * ub + boxDim[ vidx ] * vb ;
// _vert[1] = _o - boxDim[ uidx ] * ub + boxDim[ vidx ] * vb ;
// _vert[2] = _o - boxDim[ uidx ] * ub - boxDim[ vidx ] * vb ;
// _vert[3] = _o + boxDim[ uidx ] * ub - boxDim[ vidx ] * vb ;
// return _vert ;
// }
// }
// // ===== default for arbitrary planes in arbitrary shapes =================
// // We create nMax vertices by rotating the local u vector around the normal
// // and checking the distance to the volume boundary in that direction.
// // This is brute force and not very smart, as many points are created on straight
// // lines and the edges are still rounded.
// // The alterative would be to compute the true intersections a plane and the most
// // common shapes - at least for boxes that should be not too hard. To be done...
// _vert.resize( nMax ) ;
// double dAlpha = 2.* ROOT::Math::Pi() / double( nMax ) ;
// TVector3 normal( ln.x() , ln.y() , ln.z() ) ;
// for(unsigned i=0 ; i< nMax ; ++i ){
// double alpha = double(i) * dAlpha ;
// TVector3 vec( lu.x() , lu.y() , lu.z() ) ;
// TRotation rot ;
// rot.Rotate( alpha , normal );
// TVector3 vecR = rot * vec ;
// DDSurfaces::Vector3D luRot ;
// luRot.fill( vecR ) ;
// double dist = shape->DistFromInside( lo, luRot , 3, 0.1 ) ;
// // local point at volume boundary
// DDSurfaces::Vector3D lp = lo + dist * luRot ;
// DDSurfaces::Vector3D gp ;
// _wtM->LocalToMaster( lp , gp.array() ) ;
// // std::cout << " **** normal:" << ln << " lu:" << lu << " alpha:" << alpha << " luRot:" << luRot << " lp :" << lp << " gp:" << gp << std::endl;
// _vert[i] = gp ;
// }
// } else if( type().isCylinder() ) {
// // if( shape->IsA() == TGeoTube::Class() ) {
// if( shape->IsA() == TGeoConeSeg::Class() ) {
// _vert.resize( nMax ) ;
// TGeoTube* tube = ( TGeoTube* ) shape ;
// double zHalf = tube->GetDZ() ;
// Vector3D zv( 0. , 0. , zHalf ) ;
// double r = lo.rho() ;
// unsigned n = nMax / 4 ;
// n = 8 ;
// double dPhi = 2.* ROOT::Math::Pi() / double( n ) ;
// for( unsigned i = 0 ; i < n ; ++i ) {
// Vector3D rv0( r*sin( i *dPhi ) , r*cos( i *dPhi ) , 0. ) ;
// Vector3D rv1( r*sin( (i+1)*dPhi ) , r*cos( (i+1)*dPhi ) , 0. ) ;
// // 4 points on local cylinder
// Vector3D pl0 = zv + rv0 ;
// Vector3D pl1 = zv + rv1 ;
// Vector3D pl2 = -zv + rv1 ;
// Vector3D pl3 = -zv + rv0 ;
// Vector3D pg0,pg1,pg2,pg3 ;
// _wtM->LocalToMaster( pl0, pg0.array() ) ;
// _wtM->LocalToMaster( pl1, pg1.array() ) ;
// _wtM->LocalToMaster( pl2, pg2.array() ) ;
// _wtM->LocalToMaster( pl3, pg3.array() ) ;
// _vert[ i*5 ] = pg0 ;
// _vert[ i*5 + 1 ] = pg1 ;
// _vert[ i*5 + 2 ] = pg2 ;
// _vert[ i*5 + 3 ] = pg3 ;
// _vert[ i*5 + 3 ] = pg0 ;
// }
// }
// }
// return _vert ;
// }
//===================================================================================================================