14 std::pair<float, float>
minmax(
const float a,
const float b)
16 return ((b < a) ? std::pair<float, float>(b, a) : std::pair<float, float>(a, b));
30 const auto x_side =
minmax(pos.GetX() + x_span, pos.GetX() - x_span);
31 const auto z_side =
minmax(pos.GetZ() + z_span, pos.GetZ() - z_span);
33 return KDTreeBox(x_side.first, x_side.second, z_side.first, z_side.second);
47 const auto x_side =
minmax(pos.GetX() + x_span, pos.GetX() - x_span);
48 const auto y_side =
minmax(pos.GetY() + y_span, pos.GetY() - y_span);
49 const auto z_side =
minmax(pos.GetZ() + z_span, pos.GetZ() - z_span);
51 return KDTreeCube(x_side.first, x_side.second, y_side.first, y_side.second, z_side.first, z_side.second);
std::pair< float, float > minmax(const float a, const float b)
minmax
Box structure used to define 2D field. It's used in KDTree building step to divide the detector space...
KDTreeCube build_3d_kd_search_region(const pandora::CaloHit *const point, const float x_span, const float y_span, const float z_span)
build_3d_kd_search_region
KDTreeBoxT< 3 > KDTreeCube
KDTreeBox build_2d_kd_search_region(const pandora::CaloHit *const point, const float x_span, const float z_span)
build_2d_kd_search_region
KDTreeBoxT< 2 > KDTreeBox