public static KAR_grCollisionTree GenerateBucketPartition(KAR_grCollisionNode coll)
{
var v = coll.Vertices;
var bucketGen = new BucketGen(
v.Min(e => e.X) - 10,
Math.Min(-1000, v.Min(e => e.Y) - 10),
v.Min(e => e.Z) - 10,
v.Max(e => e.X) + 10,
Math.Max(1000, v.Min(e => e.Y) + 10),
v.Max(e => e.Z) + 10);
var tris = coll.Triangles.ToList();
foreach (var t in tris)
{
bucketGen.AddTriangle(t, v[t.V1], v[t.V2], v[t.V3]);
}
return(bucketGen.ProcessBuckets(tris));
}
public static KAR_grCollisionNode KCLtoKAR(string kclFile, out KAR_grCollisionTree tree)
{
KAR_grCollisionNode node = new KAR_grCollisionNode();
List <KAR_CollisionTriangle> tris = new List <KAR_CollisionTriangle>();
List <GXVector3> verts = new List <GXVector3>();
using (FileStream f = new FileStream(kclFile, FileMode.Open))
using (BinaryReaderExt r = new BinaryReaderExt(f))
{
r.BigEndian = true;
var posOffset = r.ReadInt32();
var nrmOffset = r.ReadInt32();
var triOffset = r.ReadInt32() + 0x10;
var partOffste = r.ReadInt32();
var triCount = (partOffste - triOffset) / 0x10;
for (int i = 0; i < triCount; i++)
{
r.Seek((uint)(triOffset + i * 0x10));
var length = r.ReadSingle();
var pi = r.ReadUInt16();
var di = r.ReadUInt16();
var n1 = r.ReadUInt16();
var n2 = r.ReadUInt16();
var n3 = r.ReadUInt16();
var fl = r.ReadUInt16();
r.Seek((uint)(posOffset + pi * 0xC));
var position = new Vector3(r.ReadSingle(), r.ReadSingle(), r.ReadSingle());
r.Seek((uint)(nrmOffset + di * 0xC));
var direction = new Vector3(r.ReadSingle(), r.ReadSingle(), r.ReadSingle());
r.Seek((uint)(nrmOffset + n1 * 0xC));
var normalA = new Vector3(r.ReadSingle(), r.ReadSingle(), r.ReadSingle());
r.Seek((uint)(nrmOffset + n2 * 0xC));
var normalB = new Vector3(r.ReadSingle(), r.ReadSingle(), r.ReadSingle());
r.Seek((uint)(nrmOffset + n3 * 0xC));
var normalC = new Vector3(r.ReadSingle(), r.ReadSingle(), r.ReadSingle());
var crossA = Vector3.Cross(normalA, direction);
var crossB = Vector3.Cross(normalB, direction);
var vertex1 = position;
var vertex2 = position + crossB * (length / Vector3.Dot(crossB, normalC));
var vertex3 = position + crossA * (length / Vector3.Dot(crossA, normalC));
tris.Add(new KAR_CollisionTriangle()
{
Flags = 0x81,
V1 = verts.Count + 2,
V2 = verts.Count + 1,
V3 = verts.Count
});
// scale
vertex1 *= Scale;
vertex2 *= Scale;
vertex3 *= Scale;
vertex1.Y += YTrans;
vertex2.Y += YTrans;
vertex3.Y += YTrans;
verts.Add(new GXVector3()
{
X = vertex1.X, Y = vertex1.Y, Z = vertex1.Z
});
verts.Add(new GXVector3()
{
X = vertex2.X, Y = vertex2.Y, Z = vertex2.Z
});
verts.Add(new GXVector3()
{
X = vertex3.X, Y = vertex3.Y, Z = vertex3.Z
});
}
}
{
var height = verts.Min(e => e.Y) - 10;
var v1 = new Vector3(-10000, height, -10000);
var v2 = new Vector3(10000, height, -10000);
var v3 = new Vector3(10000, height, 10000);
var v4 = new Vector3(-10000, height, 10000);
tris.Add(new KAR_CollisionTriangle()
{
Flags = 0x81,
V1 = verts.Count,
V2 = verts.Count + 1,
V3 = verts.Count + 2
});
verts.Add(new GXVector3()
{
X = v1.X, Y = v1.Y, Z = v1.Z
});
verts.Add(new GXVector3()
{
X = v2.X, Y = v2.Y, Z = v2.Z
});
verts.Add(new GXVector3()
{
X = v3.X, Y = v3.Y, Z = v3.Z
});
tris.Add(new KAR_CollisionTriangle()
{
Flags = 0x81,
V1 = verts.Count,
V2 = verts.Count + 1,
V3 = verts.Count + 2
});
verts.Add(new GXVector3()
{
X = v1.X, Y = v1.Y, Z = v1.Z
});
verts.Add(new GXVector3()
{
X = v3.X, Y = v3.Y, Z = v3.Z
});
verts.Add(new GXVector3()
{
X = v4.X, Y = v4.Y, Z = v4.Z
});
}
node.Triangles = tris.ToArray();
node.Vertices = verts.ToArray();
node.Joints = new KAR_CollisionJoint[]
{
new KAR_CollisionJoint()
{
VertexStart = 0,
VertexSize = verts.Count,
FaceStart = 0,
FaceSize = tris.Count
}
};
tree = BucketGen.GenerateBucketPartition(node);
return(node);
}
