box3.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_BOX_BOX3_H
#define VCL_ALGORITHMS_CORE_BOX_BOX3_H
 
#include <vclib/concepts/space/box.h>
#include <vclib/space/core/box.h>
#include <vclib/space/core/polygon.h>
#include <vclib/space/core/segment.h>
 
#include <stdexcept>
 
namespace vcl {
 
template<Box3Concept BoxType>
auto boxVertex(const BoxType& box, uint i) -> BoxType::PointType
{
    using PointType = BoxType::PointType;
 
    switch (i) {
    case 0: return box.min();
    case 1: return PointType(box.max().x(), box.min().y(), box.min().z());
    case 2: return PointType(box.min().x(), box.max().y(), box.min().z());
    case 3: return PointType(box.max().x(), box.max().y(), box.min().z());
    case 4: return PointType(box.min().x(), box.min().y(), box.max().z());
    case 5: return PointType(box.max().x(), box.min().y(), box.max().z());
    case 6: return PointType(box.min().x(), box.max().y(), box.max().z());
    case 7: return box.max();
    default:
        throw std::out_of_range("Invalid vertex index");
        return PointType();
    }
}
 
template<Box3Concept BoxType>
auto boxEdge(const BoxType& box, uint i) -> Segment<typename BoxType::PointType>
{
    using PointType = BoxType::PointType;
 
    switch (i) {
    case 0: return Segment<PointType>(boxVertex(box, 1), boxVertex(box, 0));
    case 1: return Segment<PointType>(boxVertex(box, 0), boxVertex(box, 2));
    case 2: return Segment<PointType>(boxVertex(box, 2), boxVertex(box, 3));
    case 3: return Segment<PointType>(boxVertex(box, 3), boxVertex(box, 1));
    case 4: return Segment<PointType>(boxVertex(box, 4), boxVertex(box, 5));
    case 5: return Segment<PointType>(boxVertex(box, 5), boxVertex(box, 7));
    case 6: return Segment<PointType>(boxVertex(box, 7), boxVertex(box, 6));
    case 7: return Segment<PointType>(boxVertex(box, 6), boxVertex(box, 4));
    case 8: return Segment<PointType>(boxVertex(box, 0), boxVertex(box, 4));
    case 9: return Segment<PointType>(boxVertex(box, 1), boxVertex(box, 5));
    case 10: return Segment<PointType>(boxVertex(box, 2), boxVertex(box, 6));
    case 11: return Segment<PointType>(boxVertex(box, 3), boxVertex(box, 7));
    default:
        throw std::out_of_range("Invalid edge index");
        return Segment<PointType>();
    }
}
 
} // namespace vcl
 
#endif // VCL_ALGORITHMS_CORE_BOX_BOX3_H