/* * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * Copyright 2015-2017 Danny Robson */ #ifndef CRUFT_UTIL_GEOM_AABB_HPP #define CRUFT_UTIL_GEOM_AABB_HPP #include "../point.hpp" #include "../extent.hpp" #include namespace util::geom { /////////////////////////////////////////////////////////////////////////// /// represents an axis-aligned bounding-box through two opposing corners. /// /// p0 must be less-than-or-equal to p1. equality is allowed so that we /// can represent zero sized bounding-boxes. template struct aabb { aabb () = default; aabb (point, point); extent magnitude (void) const; T diameter (void) const; /// tests whether a point lies within the region, inclusive of borders constexpr bool inclusive (point p) const noexcept { return all (p0 <= p && p1 >= p); } point closest (point) const; void cover (point); aabb operator+ (vector) const; aabb operator- (vector) const; ::util::point p0; ::util::point p1; }; /////////////////////////////////////////////////////////////////////////// template constexpr bool operator== (const aabb &a, const aabb &b) noexcept { return a.p0 == b.p0 && a.p1 == b.p1; } /////////////////////////////////////////////////////////////////////////// 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 namespace util::geom { template struct sampler { static point fn (aabb b, G &g) { std::uniform_real_distribution d; point p; std::generate (p.begin (), p.end (), [&] (void) { return d (g); }); return p * (b.p1 - b.p0) + b.p0.template as (); } }; } #endif