fastjet 2.4.3
|
class for carrying out a voronoi area calculation on a set of initial vectors More...
Public Member Functions | |
VoronoiAreaCalc (const vector< PseudoJet >::const_iterator &, const vector< PseudoJet >::const_iterator &, double effective_R) | |
constructor that takes a range of a vector together with the effective radius for the intersection of discs with voronoi cells | |
double | area (int index) const |
return the area of the particle associated with the given index | |
Private Member Functions | |
double | edge_circle_intersection (const Point &p0, const GraphEdge &edge) |
compute the intersection of one triangle with the circle the area is returned | |
double | circle_area (const double d12_2, double d01_2, double d02_2) |
get the area of a circle of radius R centred on the point 0 with 1 and 2 on each "side" of the arc. | |
Private Attributes | |
std::vector< double > | _areas |
areas, numbered as jets | |
double | _effective_R |
effective radius | |
double | _effective_R_squared |
effective radius squared |
class for carrying out a voronoi area calculation on a set of initial vectors
Definition at line 49 of file ClusterSequenceVoronoiArea.cc.
ClusterSequenceVoronoiArea::VoronoiAreaCalc::VoronoiAreaCalc | ( | const vector< PseudoJet >::const_iterator & | , |
const vector< PseudoJet >::const_iterator & | , | ||
double | effective_R | ||
) |
constructor that takes a range of a vector together with the effective radius for the intersection of discs with voronoi cells
double ClusterSequenceVoronoiArea::VoronoiAreaCalc::area | ( | int | index | ) | const [inline] |
return the area of the particle associated with the given index
Definition at line 60 of file ClusterSequenceVoronoiArea.cc.
{return _areas[index];};
double ClusterSequenceVoronoiArea::VoronoiAreaCalc::circle_area | ( | const double | d12_2, |
double | d01_2, | ||
double | d02_2 | ||
) | [inline, private] |
get the area of a circle of radius R centred on the point 0 with 1 and 2 on each "side" of the arc.
dij is the distance between point i and point j and all distances are squared
Definition at line 77 of file ClusterSequenceVoronoiArea.cc.
References d0::inline_maths::min().
{ return 0.5*_effective_R_squared *acos(min(1.0,(d01_2+d02_2-d12_2)/(2*sqrt(d01_2*d02_2)))); }
double ClusterSequenceVoronoiArea::VoronoiAreaCalc::edge_circle_intersection | ( | const Point & | p0, |
const GraphEdge & | edge | ||
) | [private] |
compute the intersection of one triangle with the circle the area is returned
std::vector<double> ClusterSequenceVoronoiArea::VoronoiAreaCalc::_areas [private] |
areas, numbered as jets
Definition at line 60 of file ClusterSequenceVoronoiArea.cc.
double ClusterSequenceVoronoiArea::VoronoiAreaCalc::_effective_R [private] |
effective radius
Definition at line 64 of file ClusterSequenceVoronoiArea.cc.
double ClusterSequenceVoronoiArea::VoronoiAreaCalc::_effective_R_squared [private] |
effective radius squared
Definition at line 65 of file ClusterSequenceVoronoiArea.cc.