private void RecursiveBuild(IntermediateOCTreeNode node, OCTPoly[] PolyList, Vector3 center, Vector3 extents, int depth)
{
var planeArray = new[] { MathExtensions.PlaneFromPointNormal(center + (planeOffsets[0] * extents), planeNormals[0]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[1] * extents), planeNormals[1]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[2] * extents), planeNormals[2]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[3] * extents), planeNormals[3]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[4] * extents), planeNormals[4]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[5] * extents), planeNormals[5]) };
var polyArray = new OCTPoly[PolyList.Length];
var index = 0;
while (index < PolyList.Length)
{
polyArray[index] = new OCTPoly(PolyList[index]);
index++;
}
for (var i = 0; i < planeArray.Length; i++)
{
var list = new List <OCTPoly>();
for (var j = 0; j < polyArray.Length; j++)
{
int num4;
var newPolys = new OCTPoly[2];
Split(polyArray[j], planeArray[i], ref newPolys, out num4);
index = 0;
while (index < num4)
{
var plane = new Plane(newPolys[index].Verts[0], newPolys[index].Verts[1], newPolys[index].Verts[2]);
if (!float.IsNaN(plane.Normal.X))
{
list.Add(newPolys[index]);
}
index++;
}
}
polyArray = new OCTPoly[list.Count];
index = 0;
while (index < list.Count)
{
polyArray[index] = new OCTPoly(list[index]);
index++;
}
}
if ((polyArray.Length <= MaxPolygonsPerNode) || (depth >= MaxSubdivisions))
{
node.Polys = new OCTPoly[polyArray.Length];
if (polyArray.Length > 0)
{
for (index = 0; index < polyArray.Length; index++)
{
node.Polys[index] = new OCTPoly(polyArray[index]);
}
}
}
else
{
node.Children = new IntermediateOCTreeNode[8];
for (index = 0; index < 8; index++)
{
node.Children[index] = new IntermediateOCTreeNode();
var vector = (extents * 0.5f);
var vector2 = center + (nodeOffsets[index] * vector);
node.Children[index].Bounds = new BoundingBox(vector2 - vector, vector2 + vector);
RecursiveBuild(node.Children[index], PolyList, vector2, vector, depth + 1);
}
}
}
public OCTPoly(OCTPoly poly)
{
Verts = new[] { poly.Verts[0], poly.Verts[1], poly.Verts[2] };
}
private void Split(OCTPoly poly, Plane p, ref OCTPoly[] newPolys, out int numPolys)
{
numPolys = 0;
var num = p.DotCoordinate(poly.Verts[0]);
var num2 = p.DotCoordinate(poly.Verts[1]);
var num3 = p.DotCoordinate(poly.Verts[2]);
var vector = MathExtensions.NormalFromPoints(poly.Verts[0], poly.Verts[1], poly.Verts[2]);
if (((num > 0f) && (num2 > 0f)) && (num3 > 0f))
{
newPolys[0] = new OCTPoly(poly.Verts[0], poly.Verts[1], poly.Verts[2]);
numPolys = 1;
}
else if (((num < 0f) && (num2 < 0f)) && (num3 < 0f))
{
numPolys = 0;
}
else if (((num == 0f) && (num2 == 0f)) && (num3 == 0f))
{
if (p.DotNormal(vector) >= 0f)
{
newPolys[0] = new OCTPoly(poly.Verts[0], poly.Verts[1], poly.Verts[2]);
numPolys = 1;
}
else
{
numPolys = 0;
}
}
else
{
var vectorArray = new Vector3[4];
var num4 = 0;
for (var i = 0; i < 3; i++)
{
var vector2 = poly.Verts[i];
var vector3 = poly.Verts[((i + 1) > 2) ? 0 : (i + 1)];
var num6 = p.DotCoordinate(vector2);
var num7 = p.DotCoordinate(vector3);
if (num6 >= 0f)
{
vectorArray[num4++] = vector2;
}
if (((num7 <= 0f) && (num6 > 0f)) || ((num7 >= 0f) && (num6 < 0f)))
{
var zero = Vector3.Zero;
if (Intersection.LineSegmentIntersectsPlane(vector2, vector3, p, ref zero))
{
vectorArray[num4++] = zero;
}
}
}
switch (num4)
{
case 3:
case 4:
newPolys[0] = new OCTPoly(vectorArray[0], vectorArray[1], vectorArray[2]);
numPolys = 1;
if (num4 == 4)
{
newPolys[1] = new OCTPoly(vectorArray[0], vectorArray[2], vectorArray[3]);
numPolys = 2;
}
break;
}
}
}
public OCTPoly(OCTPoly poly)
{
Verts = new[] { poly.Verts[0], poly.Verts[1], poly.Verts[2] };
}
private static BoundingBox CalculateBounds(OCTPoly[] polyList)
{
var vector = (Vector3.One * 3.402823E+38f);
var vector2 = (Vector3.One * -3.402823E+38f);
for (var i = 0; i < polyList.Length; i++)
{
for (var j = 0; j < 3; j++)
{
Vector3.Min(ref vector, ref polyList[i].Verts[j], out vector);
Vector3.Max(ref vector2, ref polyList[i].Verts[j], out vector2);
}
}
return new BoundingBox(vector, vector2);
}
private void Split(OCTPoly poly, Plane p, ref OCTPoly[] newPolys, out int numPolys)
{
numPolys = 0;
var num = p.DotCoordinate(poly.Verts[0]);
var num2 = p.DotCoordinate(poly.Verts[1]);
var num3 = p.DotCoordinate(poly.Verts[2]);
var vector = MathExtensions.NormalFromPoints(poly.Verts[0], poly.Verts[1], poly.Verts[2]);
if (((num > 0f) && (num2 > 0f)) && (num3 > 0f))
{
newPolys[0] = new OCTPoly(poly.Verts[0], poly.Verts[1], poly.Verts[2]);
numPolys = 1;
}
else if (((num < 0f) && (num2 < 0f)) && (num3 < 0f))
{
numPolys = 0;
}
else if (((num == 0f) && (num2 == 0f)) && (num3 == 0f))
{
if (p.DotNormal(vector) >= 0f)
{
newPolys[0] = new OCTPoly(poly.Verts[0], poly.Verts[1], poly.Verts[2]);
numPolys = 1;
}
else
{
numPolys = 0;
}
}
else
{
var vectorArray = new Vector3[4];
var num4 = 0;
for (var i = 0; i < 3; i++)
{
var vector2 = poly.Verts[i];
var vector3 = poly.Verts[((i + 1) > 2) ? 0 : (i + 1)];
var num6 = p.DotCoordinate(vector2);
var num7 = p.DotCoordinate(vector3);
if (num6 >= 0f)
{
vectorArray[num4++] = vector2;
}
if (((num7 <= 0f) && (num6 > 0f)) || ((num7 >= 0f) && (num6 < 0f)))
{
var zero = Vector3.Zero;
if (Intersection.LineSegmentIntersectsPlane(vector2, vector3, p, ref zero))
{
vectorArray[num4++] = zero;
}
}
}
switch (num4)
{
case 3:
case 4:
newPolys[0] = new OCTPoly(vectorArray[0], vectorArray[1], vectorArray[2]);
numPolys = 1;
if (num4 == 4)
{
newPolys[1] = new OCTPoly(vectorArray[0], vectorArray[2], vectorArray[3]);
numPolys = 2;
}
break;
}
}
}
private void RecursiveBuild(IntermediateOCTreeNode node, OCTPoly[] PolyList, Vector3 center, Vector3 extents, int depth)
{
var planeArray = new[] { MathExtensions.PlaneFromPointNormal(center + (planeOffsets[0] * extents), planeNormals[0]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[1] * extents), planeNormals[1]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[2] * extents), planeNormals[2]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[3] * extents), planeNormals[3]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[4] * extents), planeNormals[4]), MathExtensions.PlaneFromPointNormal(center + (planeOffsets[5] * extents), planeNormals[5]) };
var polyArray = new OCTPoly[PolyList.Length];
var index = 0;
while (index < PolyList.Length)
{
polyArray[index] = new OCTPoly(PolyList[index]);
index++;
}
for (var i = 0; i < planeArray.Length; i++)
{
var list = new List<OCTPoly>();
for (var j = 0; j < polyArray.Length; j++)
{
int num4;
var newPolys = new OCTPoly[2];
Split(polyArray[j], planeArray[i], ref newPolys, out num4);
index = 0;
while (index < num4)
{
var plane = new Plane(newPolys[index].Verts[0], newPolys[index].Verts[1], newPolys[index].Verts[2]);
if (!float.IsNaN(plane.Normal.X))
{
list.Add(newPolys[index]);
}
index++;
}
}
polyArray = new OCTPoly[list.Count];
index = 0;
while (index < list.Count)
{
polyArray[index] = new OCTPoly(list[index]);
index++;
}
}
if ((polyArray.Length <= MaxPolygonsPerNode) || (depth >= MaxSubdivisions))
{
node.Polys = new OCTPoly[polyArray.Length];
if (polyArray.Length > 0)
{
for (index = 0; index < polyArray.Length; index++)
{
node.Polys[index] = new OCTPoly(polyArray[index]);
}
}
}
else
{
node.Children = new IntermediateOCTreeNode[8];
for (index = 0; index < 8; index++)
{
node.Children[index] = new IntermediateOCTreeNode();
var vector = (extents * 0.5f);
var vector2 = center + (nodeOffsets[index] * vector);
node.Children[index].Bounds = new BoundingBox(vector2 - vector, vector2 + vector);
RecursiveBuild(node.Children[index], PolyList, vector2, vector, depth + 1);
}
}
}