mirror of
https://github.com/AxioDL/LibCommon.git
synced 2026-03-30 11:47:23 -07:00
Lioncache
d6640792ec
Mainly header hygeine and overload specifiers. Also greatly reduces the amount of copying going on with math primitives.
111 lines
3.3 KiB
C++
111 lines
3.3 KiB
C++
#include "CAABox.h"
|
|
|
|
#include "Common/FileIO/IInputStream.h"
|
|
#include "Common/FileIO/IOutputStream.h"
|
|
#include "Common/Math/CRay.h"
|
|
#include "Common/Math/CTransform4f.h"
|
|
#include "Common/Math/MathUtil.h"
|
|
#include "Common/Serialization/IArchive.h"
|
|
|
|
CAABox::CAABox(IInputStream& rInput)
|
|
: mMin(rInput)
|
|
, mMax(rInput)
|
|
{
|
|
}
|
|
|
|
void CAABox::Serialize(IArchive& rArc)
|
|
{
|
|
rArc << SerialParameter("Min", mMin)
|
|
<< SerialParameter("Max", mMax);
|
|
}
|
|
|
|
void CAABox::Write(IOutputStream& rOutput)
|
|
{
|
|
mMin.Write(rOutput);
|
|
mMax.Write(rOutput);
|
|
}
|
|
|
|
void CAABox::ExpandBounds(const CVector3f& rkVtx)
|
|
{
|
|
// take an input vertex coordinate and expand the bounding box to fit it, if necessary
|
|
if (rkVtx.X < mMin.X) mMin.X = rkVtx.X;
|
|
if (rkVtx.X > mMax.X) mMax.X = rkVtx.X;
|
|
if (rkVtx.Y < mMin.Y) mMin.Y = rkVtx.Y;
|
|
if (rkVtx.Y > mMax.Y) mMax.Y = rkVtx.Y;
|
|
if (rkVtx.Z < mMin.Z) mMin.Z = rkVtx.Z;
|
|
if (rkVtx.Z > mMax.Z) mMax.Z = rkVtx.Z;
|
|
}
|
|
|
|
void CAABox::ExpandBounds(const CAABox& rkAABox)
|
|
{
|
|
ExpandBounds(rkAABox.mMin);
|
|
ExpandBounds(rkAABox.mMax);
|
|
}
|
|
|
|
void CAABox::ExpandBy(const CVector3f& rkAmount)
|
|
{
|
|
CVector3f halfAmount = rkAmount / 2.f;
|
|
mMin -= halfAmount;
|
|
mMax += halfAmount;
|
|
}
|
|
|
|
CAABox CAABox::Transformed(const CTransform4f& rkTransform) const
|
|
{
|
|
CAABox AABox;
|
|
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMin.X, mMin.Y, mMin.Z));
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMin.X, mMin.Y, mMax.Z));
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMin.X, mMax.Y, mMax.Z));
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMin.X, mMax.Y, mMin.Z));
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMax.X, mMin.Y, mMin.Z));
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMax.X, mMin.Y, mMax.Z));
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMax.X, mMax.Y, mMax.Z));
|
|
AABox.ExpandBounds(rkTransform * CVector3f(mMax.X, mMax.Y, mMin.Z));
|
|
|
|
return AABox;
|
|
}
|
|
|
|
bool CAABox::IsPointInBox(const CVector3f& rkPoint) const
|
|
{
|
|
return ( ((rkPoint.X >= mMin.X) && (rkPoint.X <= mMax.X)) &&
|
|
((rkPoint.Y >= mMin.Y) && (rkPoint.Y <= mMax.Y)) &&
|
|
((rkPoint.Z >= mMin.Z) && (rkPoint.Z <= mMax.Z)) );
|
|
}
|
|
|
|
CVector3f CAABox::ClosestPointAlongVector(const CVector3f& rkDir) const
|
|
{
|
|
CVector3f out;
|
|
out.X = (rkDir.X >= 0.f) ? mMin.X : mMax.X;
|
|
out.Y = (rkDir.Y >= 0.f) ? mMin.Y : mMax.Y;
|
|
out.Z = (rkDir.Z >= 0.f) ? mMin.Z : mMax.Z;
|
|
return out;
|
|
}
|
|
|
|
CVector3f CAABox::FurthestPointAlongVector(const CVector3f& rkDir) const
|
|
{
|
|
CVector3f out;
|
|
out.X = (rkDir.X >= 0.f) ? mMax.X : mMin.X;
|
|
out.Y = (rkDir.Y >= 0.f) ? mMax.Y : mMin.Y;
|
|
out.Z = (rkDir.Z >= 0.f) ? mMax.Z : mMin.Z;
|
|
return out;
|
|
}
|
|
|
|
// ************ INTERSECTION TESTS ************
|
|
// These tests are kinda bad and probably inaccurate, they need rewrites
|
|
bool CAABox::IntersectsAABox(const CAABox& rkAABox) const
|
|
{
|
|
return ((mMax > rkAABox.mMin) && (mMin < rkAABox.mMax));
|
|
}
|
|
|
|
bool CAABox::IntersectsSphere(const CVector3f& rkSphereCenter, float SphereRadius) const
|
|
{
|
|
// Placeholder for proper sphere intersection test
|
|
// Generate an AABox for the sphere and do an AABox/AABox intersection test instead
|
|
return IntersectsAABox(CAABox(rkSphereCenter - SphereRadius, rkSphereCenter + SphereRadius));
|
|
}
|
|
|
|
std::pair<bool,float> CAABox::IntersectsRay(const CRay& rkRay) const
|
|
{
|
|
return Math::RayBoxIntersection(rkRay, *this);
|
|
}
|