libcruft-util/geom/aabb.hpp

161 lines
4.1 KiB
C++

/*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* Copyright 2015-2018 Danny Robson <danny@nerdcruft.net>
*/
#pragma once
#include "../debug.hpp"
#include "../extent.hpp"
#include "../point.hpp"
#include <cstdint>
namespace cruft::geom {
///////////////////////////////////////////////////////////////////////////
/// represents an axis-aligned bounding-box through two opposing corners.
///
/// `lo' must be less-than-or-equal to `hi'. equality is allowed so that
/// we can represent zero sized bounding-boxes.
template <size_t S, typename T>
struct aabb {
aabb () = default;
aabb (point<S,T> _lo, point<S,T> _hi):
lo (_lo),
hi (_hi)
{
CHECK (all (lo <= hi));
}
///////////////////////////////////////////////////////////////////////
extent<S,T>
magnitude (void) const
{
return (hi - lo).template as<cruft::extent> ();
}
//---------------------------------------------------------------------
T
diameter (void) const
{
return magnitude ().diameter ();
}
//---------------------------------------------------------------------
/// tests whether a point lies within the region, inclusive of borders
constexpr bool
inclusive (point<S,T> p) const noexcept
{ return all (lo <= p && hi >= p); }
//---------------------------------------------------------------------
point<S,T>
closest (point<S,T> query) const
{
return clamp (query, lo, hi);
}
//---------------------------------------------------------------------
void cover (point<S,T> p)
{
lo = min (p, lo);
hi = max (p, hi);
}
//---------------------------------------------------------------------
aabb<S,T> operator+ (vector<S,T> v) const
{
return { lo + v, hi + v };
}
aabb<S,T> operator- (vector<S,T> v) const
{
return { lo - v, hi - v };
}
/// returns an aabb that covers the supplied point in addition to the
/// current aabb area.
auto operator| [[nodiscard]] (point<S,T> p) const noexcept
{
return aabb (
cruft::min (lo, p),
cruft::max (hi, p)
);
}
auto& operator|= (point<S,T> p) noexcept
{
return *this = *this | p;
}
aabb operator| [[nodiscard]] (aabb<S,T> rhs) const noexcept
{
return {
min (lo, rhs.lo),
max (hi, rhs.hi)
};
}
std::array<cruft::point<S,T>,cruft::pow(2,S)>
vertices (void) const noexcept;
::cruft::point<S,T> lo;
::cruft::point<S,T> hi;
};
///////////////////////////////////////////////////////////////////////////
template <std::size_t S, typename T>
constexpr bool
operator== (const aabb<S,T> &a, const aabb<S,T> &b) noexcept
{
return a.lo == b.lo && a.hi == b.hi;
}
///////////////////////////////////////////////////////////////////////////
typedef aabb<2,float> aabb2f;
typedef aabb<2,unsigned> aabb2u;
typedef aabb<2,int> aabb2i;
typedef aabb<3,float> aabb3f;
typedef aabb<3,unsigned> aabb3u;
typedef aabb<3,int> aabb3i;
}
///////////////////////////////////////////////////////////////////////////////
#include "./sample.hpp"
#include <random>
namespace cruft::geom {
template <size_t S, typename T>
struct sampler<aabb<S,T>> {
template <typename GeneratorT>
static auto
eval (aabb<S,T> shape, GeneratorT &g)
{
point<S,T> res;
for (size_t i = 0; i < S; ++i)
res[i] = cruft::random::uniform (shape.lo[i], shape.hi[i], g);
return res;
}
};
}