bounding_box.h

/*****************************************************************************
 * VCLib                                                                     *
 * Visual Computing Library                                                  *
 *                                                                           *
 * Copyright(C) 2021-2025                                                    *
 * Visual Computing Lab                                                      *
 * ISTI - Italian National Research Council                                  *
 *                                                                           *
 * All rights reserved.                                                      *
 *                                                                           *
 * This program is free software; you can redistribute it and/or modify      *
 * it under the terms of the Mozilla Public License Version 2.0 as published *
 * by the Mozilla Foundation; either version 2 of the License, or            *
 * (at your option) any later version.                                       *
 *                                                                           *
 * This program is distributed in the hope that it will be useful,           *
 * but WITHOUT ANY WARRANTY; without even the implied warranty of            *
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the              *
 * Mozilla Public License Version 2.0                                        *
 * (https://www.mozilla.org/en-US/MPL/2.0/) for more details.                *
 ****************************************************************************/
 
#ifndef VCL_ALGORITHMS_CORE_BOUNDING_BOX_H
#define VCL_ALGORITHMS_CORE_BOUNDING_BOX_H
 
#include <vclib/space/core.h>
 
namespace vcl {
 
template<PointConcept PointType>
auto boundingBox(const PointType& p)
{
    return Box<PointType>(p);
}
 
template<SegmentConcept SegmentType>
auto boundingBox(const SegmentType& s)
{
    using PointType = SegmentType::PointType;
 
    Box<PointType> b(s.p0());
    b.add(s.p1());
 
    return b;
}
 
template<SphereConcept SphereType>
auto boundingBox(const SphereType& s)
{
    using ScalarType = SphereType::ScalarType;
 
    Box<Point3<ScalarType>> b(s.center() - s.radius());
    b.add(s.center() + s.radius());
 
    return b;
}
 
template<TriangleConcept TriangleType>
auto boundingBox(const TriangleType& t)
{
    using PointType = TriangleType::PointType;
 
    Box<PointType> b(t.point(0));
    b.add(t.point(1));
    b.add(t.point(2));
 
    return b;
}
 
template<IteratorConcept Iterator>
auto boundingBox(Iterator begin, Iterator end)
{
    using BB = decltype(boundingBox(typename Iterator::value_type()));
 
    BB b;
 
    for (; begin != end; ++begin)
        b.add(boundingBox(*begin));
 
    return b;
}
 
template<Range Rng>
auto boundingBox(Rng&& r)
{
    return boundingBox(std::ranges::begin(r), std::ranges::end(r));
}
 
} // namespace vcl
 
#endif // VCL_ALGORITHMS_CORE_BOUNDING_BOX_H