Go to the source code of this file.
Definition at line 8 of file AnodeFace.cxx.
16 const Point&
a = bbray.first;
17 const Point&
b = bbray.second;
20 Point ll(0.0, a.y(), a.z());
21 Point lr(0.0, a.y(), b.z());
22 Point ul(0.0, b.y(), a.z());
23 Point ur(0.0, b.y(), b.z());
37 for (
const auto& plane : planes) {
38 const auto& wires = plane->wires();
39 const auto wray0 = wires[0]->ray();
40 const auto wray1 = wires[1]->ray();
41 const auto pitray =
ray_pitch(wray0, wray1);
43 Ray r1(wray0.first - 0.5*pitvec, wray0.second - 0.5*pitvec);
44 Ray r2(wray0.first + 0.5*pitvec, wray0.second + 0.5*pitvec);
std::pair< Point, Point > Ray
A line segment running from a first (tail) to a second (head) point.
std::tuple< double, double, const reco::ClusterHit3D * > Point
Definitions used by the VoronoiDiagram algorithm.
const GenericPointer< typename T::ValueType > T2 T::AllocatorType & a
std::vector< ray_pair_t > ray_pair_vector_t
Ray ray_pitch(const Ray &ray1, const Ray &ray2)
Vector ray_vector(const Ray &ray)
std::pair< Ray, Ray > ray_pair_t
const Ray & bounds() const
Return the ray representing the bounds.