bs.inl

Go to the documentation of this file.

/*
    Sheep - A Rigid Body Dynamics Engine
    Copyright (C) 2001-2004 Francois Beaune
    Contact: http://toxicengine.sourceforge.net/

    This file is part of Sheep.

    Sheep is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    Sheep 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
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with Sheep; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/

inline
BS::BS() {
    Invalidate();
}

inline
BS::BS(const BS &bs) :
    m_center(bs.m_center),
    m_radius(bs.m_radius)
{
}

inline
BS::BS(const Point3 &center) :
    m_center(center)
{
    Invalidate();
}

inline
BS::BS(const Point3 &center, Real radius) :
    m_center(center),
    m_radius(radius) {}

inline
void BS::Invalidate() {
    m_radius = -1.0;
}

inline
void BS::ComputeSquareRadius() {
    m_radius2 = m_radius * m_radius;
}

inline
void BS::Include(const Point3 &point) {
    const Real d = Vector3(point - m_center).Norm();

    if(d > m_radius)
        m_radius = d;
}

inline
void BS::Include(const AABB3 &aabb) {
    Include(Point3(aabb.m_min.m_x, aabb.m_min.m_y, aabb.m_min.m_z));
    Include(Point3(aabb.m_min.m_x, aabb.m_min.m_y, aabb.m_max.m_z));
    Include(Point3(aabb.m_min.m_x, aabb.m_max.m_y, aabb.m_min.m_z));
    Include(Point3(aabb.m_min.m_x, aabb.m_max.m_y, aabb.m_max.m_z));
    Include(Point3(aabb.m_max.m_x, aabb.m_min.m_y, aabb.m_min.m_z));
    Include(Point3(aabb.m_max.m_x, aabb.m_min.m_y, aabb.m_max.m_z));
    Include(Point3(aabb.m_max.m_x, aabb.m_max.m_y, aabb.m_min.m_z));
    Include(Point3(aabb.m_max.m_x, aabb.m_max.m_y, aabb.m_max.m_z));
}

inline
void BS::Include(const BS &bs) {
    const Real d = Vector3(bs.m_center - m_center).Norm() + bs.m_radius;

    if(d > m_radius)
        m_radius = d;
}

inline
bool BS::Overlaps(const BS &bs) const {
    return Vector3(bs.m_center - m_center).Norm() < m_radius + bs.m_radius;
}

inline
bool BS::Contains(const Point3 &point) const {
    return Vector3(point - m_center).Norm() <= m_radius;
}

---