aabb_3d.inl

Go to the documentation of this file.

/** @file
 *  @author Bram de Greve (bram@cocamware.com)
 *  @author Tom De Muer (tom@cocamware.com)
 *
 *  *** BEGIN LICENSE INFORMATION ***
 *  
 *  The contents of this file are subject to the Common Public Attribution License 
 *  Version 1.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://lass.sourceforge.net/cpal-license. The License is based on the 
 *  Mozilla Public License Version 1.1 but Sections 14 and 15 have been added to cover 
 *  use of software over a computer network and provide for limited attribution for 
 *  the Original Developer. In addition, Exhibit A has been modified to be consistent 
 *  with Exhibit B.
 *  
 *  Software distributed under the License is distributed on an "AS IS" basis, WITHOUT 
 *  WARRANTY OF ANY KIND, either express or implied. See the License for the specific 
 *  language governing rights and limitations under the License.
 *  
 *  The Original Code is LASS - Library of Assembled Shared Sources.
 *  
 *  The Initial Developer of the Original Code is Bram de Greve and Tom De Muer.
 *  The Original Developer is the Initial Developer.
 *  
 *  All portions of the code written by the Initial Developer are:
 *  Copyright (C) 2004-2022 the Initial Developer.
 *  All Rights Reserved.
 *  
 *  Contributor(s):
 *
 *  Alternatively, the contents of this file may be used under the terms of the 
 *  GNU General Public License Version 2 or later (the GPL), in which case the 
 *  provisions of GPL are applicable instead of those above.  If you wish to allow use
 *  of your version of this file only under the terms of the GPL and not to allow 
 *  others to use your version of this file under the CPAL, indicate your decision by 
 *  deleting the provisions above and replace them with the notice and other 
 *  provisions required by the GPL License. If you do not delete the provisions above,
 *  a recipient may use your version of this file under either the CPAL or the GPL.
 *  
 *  *** END LICENSE INFORMATION ***
 */
 
 
 
#ifndef LASS_GUARDIAN_OF_INCLUSION_PRIM_AABB_3D_INL
#define LASS_GUARDIAN_OF_INCLUSION_PRIM_AABB_3D_INL
 
 
 
#include "aabb_3d.h"
#include <cstdlib>
#include <random>
 
namespace lass
{
 
namespace prim
{
 
/** Construct an empty bounding box.
 */
template <typename T, class MMP>
Aabb3D<T, MMP>::Aabb3D():
    min_(Vector3D<T>(TNumTraits::max, TNumTraits::max, TNumTraits::max)),
    max_(Vector3D<T>(TNumTraits::min, TNumTraits::min, TNumTraits::min))
{
    LASS_ASSERT(isEmpty());
}
 
 
 
/** Construct bounding box, spanned by min and max
 */
template <typename T, class MMP>
Aabb3D<T, MMP>::Aabb3D(const TPoint& min, const TPoint& max):
    min_(min),
    max_(max)
{
    MMP::checkMinMax(min_, max_);
    LASS_ASSERT(isValid());
}
 
 
 
/** Construct bounding box around a single point (min == max)
 */
template <typename T, class MMP>
Aabb3D<T, MMP>::Aabb3D(const TPoint& point):
    min_(point),
    max_(point)
{
    LASS_ASSERT(isValid());
}
 
 
 
/** copy constructor.
 */
template <typename T, class MMP>
template <class MMP2>
Aabb3D<T, MMP>::Aabb3D(const Aabb3D<T, MMP2>& other):
    min_(other.min()),
    max_(other.max())
{
}
 
 
 
/** return corner with smallest component values
 */
template <typename T, class MMP>
const typename Aabb3D<T, MMP>::TPoint&
Aabb3D<T, MMP>::min() const
{
    LASS_ASSERT(isValid());
    return min_;
}
 
 
 
/** Return corner with largest component values
 */
template <typename T, class MMP>
const typename Aabb3D<T, MMP>::TPoint&
Aabb3D<T, MMP>::max() const
{
    LASS_ASSERT(isValid());
    return max_;
}
 
 
 
/** set corner with smallest component values
 */
template <typename T, class MMP>
void Aabb3D<T, MMP>::setMin(const TPoint& min)
{
    if (isEmpty())
    {
        min_ = min;
        max_ = min;
    }
    else
    {
        MMP::setMin(min_, max_, min);
    }
}
 
 
 
/** set corner with larges component values
 */
template <typename T, class MMP>
void Aabb3D<T, MMP>::setMax(const TPoint& max)
{
    if (isEmpty())
    {
        min_ = max;
        max_ = max;
    }
    else
    {
        MMP::setMax(min_, max_, max);
    }
}
 
 
 
/** assign one bounding box to another.
 */
template <typename T, class MMP>
template <class MMP2>
typename Aabb3D<T, MMP>::TSelf&
Aabb3D<T, MMP>::operator=(const Aabb3D<T, MMP2>& other)
{
    TSelf temp(other);
    swap(temp);
    return *this;
}
 
 
 
/** Expand bounding box so it contains point.
 */
template <typename T, class MMP>
typename Aabb3D<T, MMP>::TSelf&
Aabb3D<T, MMP>::operator+=(const TPoint& point)
{
    LASS_ASSERT(isValid());
    min_ = pointwiseMin(min_, point);
    max_ = pointwiseMax(max_, point);
    return *this;
}
 
 
 
/** Expand boundix box so it contains the other bounding box.
 */
template <typename T, class MMP>
template <class MMP2>
typename Aabb3D<T, MMP>::TSelf&
Aabb3D<T, MMP>::operator+=(const Aabb3D<T, MMP2>& other)
{
    LASS_ASSERT(isValid());
    min_ = pointwiseMin(min_, other.min());
    max_ = pointwiseMax(max_, other.max());
    return *this;
}
 
/** Expand bounding box by distance iDistance.  Negative values causing
 *  reversal of the bounding box will cause the box to shrink to the
 *  empty box.
 */
template <typename T, class MMP>
void Aabb3D<T, MMP>::grow(TParam iDistance)
{
    grow(TVector(iDistance, iDistance, iDistance));
}
 
/** Expand bounding box by axis-dependent distance.  Negative values causing
 *  reversal of the bounding box will cause the box to shrink to the
 *  empty box.
 */
template <typename T, class MMP>
void Aabb3D<T, MMP>::grow(TVector iDistance)
{
    min_ -= iDistance;
    max_ += iDistance;
    if (max_.x < min_.x || max_.y < min_.y || max_.z < min_.z)
    {
        clear();
    }
    LASS_ASSERT(isValid());
}
 
 
/** Scale bounding box by scale iScale.  Fractions will shrink the bounding box.
 *  The origin of scaling is the center of the bounding box.  Negative values of the
 *  scale have same effect as positive ones.
 */
template <typename T, class MMP>
void Aabb3D<T, MMP>::scale(TParam iScale)
{
    const TVector extra = size() * ((num::abs(iScale) - 1) / 2);
    min_ -= extra;
    max_ += extra;
    LASS_ASSERT(isValid());
}
 
 
 
/** Return the center point of the bounding box.
 *  We return a homogeneous point to avoid the division by two (that might not be supported
 *  by some types like integers)
 */
template <typename T, class MMP>
const typename Aabb3D<T, MMP>::TPointH
Aabb3D<T, MMP>::center() const
{
    LASS_ASSERT(isValid());
    return min_ + max_;
}
 
 
 
/** Return size of bounding box per axis, max - min.
 */
template <typename T, class MMP>
const typename Aabb3D<T, MMP>::TVector
Aabb3D<T, MMP>::size() const
{
    if (isEmpty())
    {
        return TVector();
    }
    return max_ - min_;
}
 
 
 
/** Returns surface area of bounding box.
 *  the surface of a bounding box consists of three pair of rectangles
 */
template <typename T, class MMP>
const typename Aabb3D<T, MMP>::TValue
Aabb3D<T, MMP>::area() const
{
    if (isEmpty())
    {
        return 0;
    }
    const TVector result = size();
    return 2 * (result.x * result.y + result.y * result.z + result.z * result.x);
}
 
 
 
/** Returns volume of bounding box.
 */
template <typename T, class MMP>
const typename Aabb3D<T, MMP>::TValue
Aabb3D<T, MMP>::volume() const
{
    if (isEmpty())
    {
        return 0;
    }
    const TVector result = size();
    return result.x * result.y * result.z;
}
 
 
/** Classify if a point is in or outside the bounding box, or on its surface
 *  @return sInside, sSurface, sOutside
 */
template <typename T, class MMP>
Side Aabb3D<T, MMP>::classify(const TPoint& point) const
{
    LASS_ASSERT(isValid());
 
    if (point.x > min_.x && point.x < max_.x &&
        point.y > min_.y && point.y < max_.y &&
        point.z > min_.z && point.z < max_.z)
    {
        return sInside;
    }
 
    if (point.x < min_.x || point.x > max_.x ||
        point.y < min_.y || point.y > max_.y ||
        point.z < min_.z || point.z > max_.z)
    {
        return sOutside;
    }
 
    return sSurface;
}
 
 
 
/** Returns true if point is inside bounding box or on its surface.
 *  Is equivalent to this->classify(point) != sOutside, but might be faster.
 */
template <typename T, class MMP>
bool Aabb3D<T, MMP>::contains(const TPoint& point) const
{
    LASS_ASSERT(isValid());
    return  point.x >= min_.x && point.x <= max_.x &&
            point.y >= min_.y && point.y <= max_.y &&
            point.z >= min_.z && point.z <= max_.z;
}
 
 
 
/** Returns true if the AABB other is inside (or on its surface) this AABB.
 *  - Is equivalent to this->contains(other.min()) && this->contains(other.max()).
 *  - if other is an empty AABB, it will always return true (an empty set is always a part of
 *    any other set).
 */
template <typename T, class MMP>
template <class MMP2>
bool Aabb3D<T, MMP>::contains(const Aabb3D<T, MMP2>& other) const
{
    LASS_ASSERT(isValid() && other.isValid());
    return other.min().x >= min_.x && other.max().x <= max_.x
        && other.min().y >= min_.y && other.max().y <= max_.y
        && other.min().z >= min_.z && other.max().z <= max_.z;
}
 
 
 
/** Check if two axis-aligned bounding boxes do intersect.
 *  @return @arg false      intersection of the AABBs is empty.
 *          @arg true       intersection of the AABBs is not empty.
 *
 *  @par FAQ: What's the difference between @c this->intersects(other) and @c this->collides(other) ?
 *      When two AABB are touching each other (surface to surface), the intersection isn't empty.
 *      i.e. the intersection is the line of points that belong to both the surfaces of the AABBs.
 *      In that case, the intersection is a degenerated AABB though, one with @c volume()==0.
 *      In collision detection however, you don't want this degenerated case of intersection to be
 *      considered as a collision.  Two bodies may touch, but the must not have an overlap thas has a
 *      non-zero volume.  That's why we have two methods: @c intersects returns true on touching
 *      AABBs, @c collides will return false.  Of course, in the non-degenerate cases, they behave the
 *      same.
 *
 *  Use the seperating axis test to test if two AABB's do intersect:
 *  GOMEZ M. (1999), <i>Simple Intersection Tests For Games</i>, Gamasutra,
 *  http://www.gamasutra.com,
 *  http://www.gamasutra.com/features/19991018/Gomez_3.htm
 */
template <typename T, class MMP>
template <class MMP2>
bool Aabb3D<T, MMP>::intersects(const Aabb3D<T, MMP2>& other) const
{
    LASS_ASSERT(isValid() && other.isValid());
    if (other.max().x < min_.x || other.min().x > max_.x) return false;
    if (other.max().y < min_.y || other.min().y > max_.y) return false;
    if (other.max().z < min_.z || other.min().z > max_.z) return false;
    return true;
}
 
 
 
/** Check if two axis-aligned bounding boxes do dollide.
 *  @return @arg true       the AABBs do collide.
 *          @arg false      they don't.
 *
 *  @par FAQ: What's the difference between @c this->intersects(other) and @c this->collides(other) ?
 *      When two AABB are touching each other (surface to surface), the intersection isn't empty.
 *      i.e. the intersection is the line of points that belong to both the surfaces of the AABBs.
 *      In that case, the intersection is a degenerated AABB though, one with @c volume()==0.
 *      In collision detection however, you don't want this degenerated case of intersection to be
 *      considered as a collision.  Two bodies may touch, but the must not have an overlap thas has a
 *      non-zero volume.  That's why we have two methods: @c intersects returns true on touching
 *      AABBs, @c collides will return false.  Of course, in the non-degenerate cases, they behave the
 *      same.
 *
 *  Use the seperating axis test to test if two AABB's do intersect:
 *  GOMEZ M. (1999), <i>Simple Intersection Tests For Games</i>, Gamasutra,
 *  http://www.gamasutra.com,
 *  http://www.gamasutra.com/features/19991018/Gomez_3.htm
 */
template <typename T, class MMP>
template <class MMP2>
bool Aabb3D<T, MMP>::collides(const Aabb3D<T, MMP2>& other) const
{
    LASS_ASSERT(isValid() && other.isValid());
    if (other.max().x <= min_.x || other.min().x >= max_.x) return false;
    if (other.max().y <= min_.y || other.min().y >= max_.y) return false;
    if (other.max().z <= min_.z || other.min().z >= max_.z) return false;
    return true;
}
 
 
 
 
 
 
/** Return a random point so that bounding box contains it.
 */
template <typename T, class MMP>
template <class RandomGenerator>
const typename Aabb3D<T, MMP>::TPoint
Aabb3D<T, MMP>::random(RandomGenerator& generator) const
{
    LASS_ASSERT(isValid());
    std::uniform_real_distribution<TValue> uniform;
    const TVector t(uniform(generator), uniform(generator), uniform(generator));
    const TPoint result(min_ + t * (max_ - min_));
    LASS_ASSERT(contains(result));
    return result;
}
 
 
 
/** set AABB to an empty box
 */
template <typename T, class MMP>
void Aabb3D<T, MMP>::clear()
{
    min_ = TPoint(TNumTraits::max, TNumTraits::max, TNumTraits::max);
    max_ = TPoint(TNumTraits::min, TNumTraits::min, TNumTraits::min);
    LASS_ASSERT(isValid() && isEmpty());
}
 
 
 
/** Return true if bounding box contains no points.
 *  i.e. this->contains(Point3<T>(x, y, z)) will return false for all possible values of
 *  x, y and z.
 */
template <typename T, class MMP>
bool Aabb3D<T, MMP>::isEmpty() const
{
    LASS_ASSERT(isValid());
    return min_.x > max_.x;
}
 
 
 
/** internal check to see if AABB is valid.
 *  There are two valid states for the AABB:
 *  @arg <tt>max_.x < min_.x</tt> which means the box is empty
 *  @arg <tt>max_.x >= min_.x && max_.y >= min_.y && max_.z >= min_.z</tt> which means the box is
 *      not empty.
 *  That gives us an invalid state as well:
 *  @arg <tt>max_.x >= min_.x && (max_.y < min_.y || max_.z < min_.z)</tt>.  This state would cause
 *      @c isEmpty() to yield false, while there's still nothing in it (there's no single point for
 *      which @c contains(p) would return true.
 *
 *  When the regular minmax policies are used (StrictMinMax and AutoMinMax), there's no way any AABB
 *  would become invalid, and this test counts as an invariant to the box.  However, when using the
 *  UncheckedMinMax policy, you're on your own.
 */
template <typename T, class MMP>
bool Aabb3D<T, MMP>::isValid() const
{
    return (min_.x <= max_.x && min_.y <= max_.y && min_.z <= max_.z) || (min_.x > max_.x);
}
 
 
 
/** swap two bounding boxes.
 */
template <typename T, class MMP>
template <typename MMP2>
void Aabb3D<T, MMP>::swap(Aabb3D<T, MMP2>& other)
{
    std::swap(min_, other.min_);
    std::swap(max_, other.max_);
}
 
 
 
// --- free ----------------------------------------------------------------------------------------
 
/** join two AABBs
 *  @relates Aabb3D
 */
template <typename T, class MMPa, class MMPb> inline
const Aabb3D<T, MMPa> operator+(const Aabb3D<T, MMPa>& a, const Aabb3D<T, MMPb>& b)
{
    Aabb3D<T, MMPa> result(a);
    result += b;
    return result;
}
 
 
 
/** add a point to an AABB
 *  @relates Aabb3D
 */
template <typename T, class MMP> inline
const Aabb3D<T, MMP> operator+(const Aabb3D<T, MMP>& a, const Point3D<T>& b)
{
    Aabb3D<T, MMP> result(a);
    result += b;
    return result;
}
 
 
 
/** add a point to an AABB
 *  @relates Aabb3D
 */
template <typename T, class MMP> inline
const Aabb3D<T, MMP> operator+(const Point3D<T>& a, const Aabb3D<T, MMP>& b)
{
    Aabb3D<T, MMP> result(b);
    result += a;
    return result;
}
 
 
 
/** @relates Aabb3D
 */
template <typename T>
const Aabb3D<T> aabb(const Point3D<T>& point)
{
    return Aabb3D<T>(point, point);
}
 
 
 
/** distance between AABB and point
 *  @relates Aabb3D
 *  @param a   AABB
 *  @param b   point
 *  @return absolute distance between point and AABB.  If point is inside AABB, distance is 0.
 *  @pre @a a should not be empty.  Undefined behaviour if it is empty.
 */
template <typename T, class MMP> inline
T distance(const Aabb3D<T, MMP>& a, const Point3D<T>& b)
{
    LASS_ASSERT(!a.isEmpty());
    typedef Vector3D<T> TVector;
    return pointwiseMax(pointwiseMax(a.min() - b, b - a.max()), TVector()).norm();
}
 
 
 
/** distance between two AABBs
 *  @relates Aabb3D
 *  @param a   AABB
 *  @param b   AABB
 *  @return absolute distance.  If one AABB is completely inside the other, distance is 0.
 *  @pre @a a and @a b should not be empty.  Undefined behaviour if they are.
 */
template <typename T, class MMPa, class MMPb> inline
T distance(const Aabb3D<T, MMPa>& a, const Aabb3D<T, MMPb>& b)
{
    LASS_ASSERT(!a.isEmpty() && !b.isEmpty());
    typedef Vector3D<T> TVector;
    return pointwiseMax(pointwiseMax(a.min() - b.max(), b.min() - a.max()), TVector()).norm();
}
 
 
 
/** Calculate the intersection of two axis aligned bounding boxes.
 *  @relates lass::prim::Aabb3D
 *  @param a the first AABB :)
 *  @param b the second AABB
 *  @param result the intersection of @a a and @a b.  In contrary to other intersection
 *                 functions, this output argument will @e always be assigned, even if there's no
 *                 result.  By no result we mean: the intersection is empty.  For most other
 *                 intersection functions, we can't assign a meaning full value if there's no
 *                 intersection, so we don't.  However, in this case we can assign an @e empty AABB.
 *                 And that's exactly what we do.  So, the output argument is @e always valid, even
 *                 if the return value suggests otherwise (in fact, you don't have to bother the
 *                 return value this time)
 *  @return @arg rNone      intersection of the AABBs is empty.
 *                          @a result is an @e empty AABB.
 *          @arg rOne       intersection of the AABBs is not empty.
 *                          @a result contains intersection.
 */
template <typename T, class MMPa, class MMPb, class MMPr>
Result intersect(const Aabb3D<T, MMPa>& a, const Aabb3D<T, MMPb>& b, Aabb3D<T, MMPr>& result)
{
    LASS_ASSERT(a.isValid() && b.isValid());
 
    if (!a.intersects(b))
    {
        result = Aabb3D<T, MMPr>(); // empty box
        return rNone;
    }
 
    // by now, we're sure they are intersecting.  now, we only need the highest minimum
    // and lowest maximum.
    //
    result = Aabb3D<T, MMPr>(pointwiseMax(a.min(), b.min()), pointwiseMin(a.max(), b.max()));
    return rOne;
}
 
 
 
template <typename T, class MMPa, class MMPb> inline
bool intersects(const Aabb3D<T, MMPa>& a, const Aabb3D<T, MMPb>& b)
{
    return a.intersects(b);
}
 
 
 
/** @relates lass::prim::Aabb2D
 */
template <typename T, typename MMP> inline
bool intersects(const Aabb3D<T, MMP>& a, const Point3D<T>& b)
{
    return a.contains(b);
}
 
 
 
/** @relates lass::prim::Aabb2D
 */
template <typename T, typename MMP> inline
bool intersects(const Point3D<T>& a, const Aabb3D<T, MMP>& b)
{
    return b.contains(a);
}
 
 
 
template <typename T, class MMPa, class MMPb> inline
bool collides(const Aabb3D<T, MMPa>& a, const Aabb3D<T, MMPb>& b)
{
    return a.collides(b);
}
 
 
 
/** @relates lass::prim::Aabb2D
 */
template <typename T, typename MMP> inline
bool collides(const Aabb3D<T, MMP>& a, const Point3D<T>& b)
{
    typedef typename Aabb3D<T, MMP>::TPoint TPoint;
    const TPoint& min = a.min();
    const TPoint& max = a.max();
    return min.x < b.x && b.x < max.x && 
        min.y < b.y && b.y < max.y &&
        min.z < b.z && b.z < max.z;
}
 
 
 
/** @relates lass::prim::Aabb2D
 */
template <typename T, typename MMP> inline
bool collides(const Point3D<T>& a, const Aabb3D<T, MMP>& b)
{
    return collides(b, a);
}
 
 
 
/** @relates lass::prim::Aabb3D
 */
template <typename T, class MMP>
std::ostream& operator<<(std::ostream& stream, const Aabb3D<T, MMP>& aabb)
{
    LASS_ENFORCE_STREAM(stream) << "{m=" << aabb.min() << ", M=" << aabb.max() << "}";
    return stream;
}
 
 
 
/** @relates lass::prim::Aabb3D
 */
template<typename T, class MMP>
io::XmlOStream& operator<<(io::XmlOStream& stream, const Aabb3D<T, MMP>& aabb)
{
    LASS_ENFORCE_STREAM(stream)
        << "<Aabb3D>\n"
        << "<min>" << aabb.min() << "</min>\n"
        << "<max>" << aabb.max() << "</max>\n"
        << "</Aabb3D>\n";
 
    return stream;
}
 
 
 
}
 
}
 
#endif