AABB ShapeSet::triData::box() const
{
AABB b = AABB::Identity();
for (unsigned int i = 0; i < 3; i++)
b = b.Extend(p[i]);
return b;
}
void GameObjectGroup::Update(const FrameTime& fr, UpdateTypeEnum updateType)
{
bool boundDirty = m_boundsDirty;
super::Update(fr,updateType);
m_boundsDirty = boundDirty;
for( auto it = m_children.begin(); it != m_children.end(); ++it)
{
(*it)->Update(fr,updateType);
}
// Update bounds
if(m_boundsDirty)
{
bool usechildbounds = false;
AABB childbounds; // default ctor will set initial value of min and max.
// merge bounds for the the visibile children.
for (auto it = m_children.begin(); it != m_children.end(); ++it)
{
if( (*it)->IsVisible())
{
AABB local = (*it)->GetLocalBounds();
local.Transform((*it)->GetTransform());
childbounds.Extend( local );
usechildbounds = true;
}
}
// set local bounds
m_localBounds = usechildbounds ? childbounds : AABB(float3(-0.5f,-0.5f,-0.5f), float3(0.5f,0.5f,0.5f));
UpdateWorldAABB();
}
}
bool AABBTreeOfVerticesBuilder::ComputeGlobalBox(const udword* primitives, udword nb_prims, AABB& global_box) const
{
// Checkings
if(!primitives || !nb_prims) return false;
// Initialize global box
global_box.SetEmpty();
// Loop through vertices
for(udword i=0;i<nb_prims;i++)
{
// Update global box
global_box.Extend(mVertexArray[primitives[i]]);
}
return true;
}
const Math::AABB CObject::CalcAabb(void) const
{
//TODO this doesn't take into account the position of the aabb, we need the points in world space
AABB aabb;
aabb.MakeLimits();
std::list<Part::IPart*> list = GetPartList(this);
for (auto iter = list.begin(); iter != list.end(); ++iter)
{
if ((*iter)->IsRenderable())
{
Script::IRenderPart* pRenderPart = static_cast<Script::IRenderPart*>((*iter));
aabb.Extend(pRenderPart->GetAABB());
}
}
return aabb;
}
static bool LoadBIN(const char* filename, SurfaceManager& test, const float* scale=null, bool mergeMeshes=false, udword tesselation=0, TesselationScheme ts = TESS_BUTTERFLY)
{
IceFile BinFile(filename);
if(!BinFile.IsValid())
return false;
const udword NbMeshes = BinFile.LoadDword();
printf("LoadBIN: loading %d meshes...\n", NbMeshes);
AABB GlobalBounds;
GlobalBounds.SetEmpty();
udword TotalNbTris = 0;
udword TotalNbVerts = 0;
if(!mergeMeshes)
{
for(udword i=0;i<NbMeshes;i++)
{
const udword Collidable = BinFile.LoadDword();
const udword Renderable = BinFile.LoadDword();
const udword NbVerts = BinFile.LoadDword();
const udword NbFaces = BinFile.LoadDword();
// TotalNbTris += NbFaces;
// TotalNbVerts += NbVerts;
IndexedSurface* IS = test.CreateManagedSurface();
bool Status = IS->Init(NbFaces, NbVerts);
ASSERT(Status);
Point* Verts = IS->GetVerts();
for(udword j=0;j<NbVerts;j++)
{
Verts[j].x = BinFile.LoadFloat();
Verts[j].y = BinFile.LoadFloat();
Verts[j].z = BinFile.LoadFloat();
if(scale)
Verts[j] *= *scale;
if(0)
{
Matrix3x3 RotX;
RotX.RotX(HALFPI*0.5f);
Verts[j] *= RotX;
Verts[j] += Point(0.1f, -0.2f, 0.3f);
}
GlobalBounds.Extend(Verts[j]);
}
IndexedTriangle* F = IS->GetFaces();
for(udword j=0;j<NbFaces;j++)
{
F[j].mRef[0] = BinFile.LoadDword();
F[j].mRef[1] = BinFile.LoadDword();
F[j].mRef[2] = BinFile.LoadDword();
}
/* if(tesselation)
{
for(udword j=0;j<tesselation;j++)
{
if(ts==TESS_BUTTERFLY)
{
ButterflyScheme BS;
IS->Subdivide(BS);
}
else if(ts==TESS_POLYHEDRAL)
{
PolyhedralScheme PS;
IS->Subdivide(PS);
}
}
}*/
if(tesselation)
Tesselate(IS, tesselation, ts);
if(gUseMeshCleaner)
{
MeshCleaner Cleaner(IS->GetNbVerts(), IS->GetVerts(), IS->GetNbFaces(), IS->GetFaces()->mRef);
IS->Init(Cleaner.mNbTris, Cleaner.mNbVerts, Cleaner.mVerts, (const IndexedTriangle*)Cleaner.mIndices);
}
TotalNbTris += IS->GetNbFaces();
TotalNbVerts += IS->GetNbVerts();
// SaveBIN("c:\\TessBunny.bin", *IS);
}
}
else
{
IndexedSurface* IS = test.CreateManagedSurface();
for(udword i=0;i<NbMeshes;i++)
{
const udword Collidable = BinFile.LoadDword();
const udword Renderable = BinFile.LoadDword();
const udword NbVerts = BinFile.LoadDword();
const udword NbFaces = BinFile.LoadDword();
IndexedSurface LocalIS;
bool Status = LocalIS.Init(NbFaces, NbVerts);
ASSERT(Status);
Point* Verts = LocalIS.GetVerts();
for(udword j=0;j<NbVerts;j++)
{
Verts[j].x = BinFile.LoadFloat();
Verts[j].y = BinFile.LoadFloat();
Verts[j].z = BinFile.LoadFloat();
if(scale)
Verts[j] *= *scale;
GlobalBounds.Extend(Verts[j]);
}
IndexedTriangle* F = LocalIS.GetFaces();
for(udword j=0;j<NbFaces;j++)
{
F[j].mRef[0] = BinFile.LoadDword();
F[j].mRef[1] = BinFile.LoadDword();
F[j].mRef[2] = BinFile.LoadDword();
}
IS->Merge(&LocalIS);
}
/* if(tesselation)
{
for(udword j=0;j<tesselation;j++)
{
ButterflyScheme BS;
IS->Subdivide(BS);
}
}*/
if(tesselation)
Tesselate(IS, tesselation, ts);
TotalNbTris = IS->GetNbFaces();
TotalNbVerts = IS->GetNbVerts();
}
test.SetGlobalBounds(GlobalBounds);
const udword GrandTotal = sizeof(Point)*TotalNbVerts + sizeof(IndexedTriangle)*TotalNbTris;
printf("LoadBIN: loaded %d tris and %d verts, for a total of %d Kb.\n", TotalNbTris, TotalNbVerts, GrandTotal/1024);
printf("LoadBIN: min bounds: %f | %f | %f\n", GlobalBounds.GetMin(0), GlobalBounds.GetMin(1), GlobalBounds.GetMin(2));
printf("LoadBIN: max bounds: %f | %f | %f\n", GlobalBounds.GetMax(0), GlobalBounds.GetMax(1), GlobalBounds.GetMax(2));
return true;
}
