public bool Push(Vector3 v)
{
if (v == data)
{
return(false);
}
if (VecCmp(v, data) <= 0)
{
if (left == null)
{
left = new VecSortTree(v);
return(true);
}
else
{
return(left.Push(v));
}
}
else
{
if (right == null)
{
right = new VecSortTree(v);
return(true);
}
else
{
return(right.Push(v));
}
}
}
//Return lowest and remove
public Vector3 Pop()
{
if(left == null)
{
if(isRoot) return Vector3.one * 11030;
return data;
}
if(left.left == null)
{
Vector3 retVal = left.data;
left = left.right;
return retVal;
}
else
{
return left.Pop();
}
}
//Return lowest and remove
public Vector3 Pop()
{
if (left == null)
{
if (isRoot)
{
return(Vector3.one * 11030);
}
return(data);
}
if (left.left == null)
{
Vector3 retVal = left.data;
left = left.right;
return(retVal);
}
else
{
return(left.Pop());
}
}
public bool Push(Vector3 v)
{
if(v == data) return false;
if(VecCmp(v, data) <= 0)
{
if(left == null)
{
left = new VecSortTree(v);
return true;
}
else return left.Push(v);
}
else
{
if(right == null)
{
right = new VecSortTree(v);
return true;
}
else return right.Push(v);
}
}
//Bounds given should be zero units wide on exactly dimension
//They should all share the same zero-dimension
static Mesh BuildWall(Bounds wall, Bounds[] doorways, Vector3 wallNormal)
{
if(doorways == null) doorways = new Bounds[0];
for(int iDoor = 0; iDoor < doorways.Length; iDoor ++)
{
Vector3 newMin = Vector3.zero;
Vector3 newMax = Vector3.zero;
for(int i = 0; i < 3; i ++)
{
newMax[i] = Mathf.Min(doorways[iDoor].max[i], wall.max[i]);
newMin[i] = Mathf.Max(doorways[iDoor].min[i], wall.min[i]);
}
//doorways[iDoor].max = newMax;
//doorways[iDoor].min = newMin;
doorways[iDoor].size += Util.LNot(wall.size);
}
int vcount = 2;//2 + 2 * doorways.Length;
int hcount = 2;//vcount;
Vector3 offset = wall.center;
wall.center -= offset;
Vector3[] axes = Util.VecBreak(wall.size);
if(axes.Length < 2) return null;
Vector3 horiz = axes[0].normalized;
Vector3 verti = axes[1].normalized;
VecSortTree hComps = new VecSortTree();
VecSortTree vComps = new VecSortTree();
Interval hRange = new Interval(Util.VecSum(Vector3.Scale(wall.min, horiz)), Util.VecSum(Vector3.Scale(wall.max, horiz)));
Interval vRange = new Interval(Util.VecSum(Vector3.Scale(wall.min, verti)), Util.VecSum(Vector3.Scale(wall.max, verti)));
hComps.Push(Vector3.Scale(wall.min, horiz));
vComps.Push(Vector3.Scale(wall.min, verti));
hComps.Push(Vector3.Scale(wall.max, horiz));
vComps.Push(Vector3.Scale(wall.max, verti));
foreach(Bounds door in doorways)
{
if(hComps.Push(Vector3.Scale(door.min - offset, horiz), hRange)) hcount++;
if(hComps.Push(Vector3.Scale(door.max - offset, horiz), hRange)) hcount++;
if(vComps.Push(Vector3.Scale(door.min - offset, verti), vRange)) vcount++;
if(vComps.Push(Vector3.Scale(door.max - offset, verti), vRange)) vcount++;
}
Vector3[] hArray = new Vector3[hcount];
Vector3[] vArray = new Vector3[vcount];
for(int i = 0; i < vcount; i ++)
{
vArray[i] = vComps.Pop();
if(vArray[i].x == 11030)
{
//throw new Exception();
}
}
for(int i = 0; i < hcount; i ++)
{
hArray[i] = hComps.Pop();
}
Vector3[] vertices = new Vector3[vcount * hcount];
Vector2[] uvs = new Vector2[vcount * hcount];
int iVert = 0;
for(int i = 0; i < vcount; i ++)
{
for(int j = 0; j < hcount; j++)
{
vertices[iVert] = hArray[j] + vArray[i];
uvs[iVert] = new Vector2(Util.VecSum(hArray[j]),
Util.VecSum(vArray[i]));
iVert++;
}
}
Vector3[] norms = new Vector3[vcount * hcount];
iVert = 0;
for(int i = 0; i < vcount; i ++)
{
for(int j = 0; j < hcount; j++)
{
norms[iVert] = wallNormal;
iVert++;
}
}
Mesh newMesh = new Mesh();
newMesh.vertices = vertices;
newMesh.uv = uvs;
newMesh.normals = norms;
int[] triList = new int[(hcount - 1) * (vcount - 1) * 6];
int iTri = 0;
int p = 0;
int q = 2;
bool invert = Util.VecSig(wallNormal) > 0;
if(wallNormal == Vector3.forward || wallNormal == Vector3.forward * -1) invert = !invert;
if(invert)
{
p = 2;
q = 0;
}
for(int i = 0; i < vcount - 1; i ++)
{
for(int j = 0; j < hcount - 1; j ++)
{
int v = i * hcount + j;
bool makeTriangle = !CheckDoors(vertices[v + hcount] + offset,vertices[v + 1] + offset, doorways);
if(makeTriangle)
{
triList[iTri * 3 + p] = v;
triList[iTri * 3 + 1] = v + 1;
triList[iTri * 3 + q] = v + hcount;
iTri++;
triList[iTri * 3 + p] = v + 1;
triList[iTri * 3 + 1] = v + 1 + hcount;
triList[iTri * 3 + q] = v + hcount;
iTri++;
}
}
}
newMesh.triangles = triList;
return newMesh;
}
//Bounds given should be zero units wide on exactly dimension
//They should all share the same zero-dimension
static Mesh BuildWall(Bounds wall, Bounds[] doorways, Vector3 wallNormal)
{
if (doorways == null)
{
doorways = new Bounds[0];
}
for (int iDoor = 0; iDoor < doorways.Length; iDoor++)
{
Vector3 newMin = Vector3.zero;
Vector3 newMax = Vector3.zero;
for (int i = 0; i < 3; i++)
{
newMax[i] = Mathf.Min(doorways[iDoor].max[i], wall.max[i]);
newMin[i] = Mathf.Max(doorways[iDoor].min[i], wall.min[i]);
}
//doorways[iDoor].max = newMax;
//doorways[iDoor].min = newMin;
doorways[iDoor].size += Util.LNot(wall.size);
}
int vcount = 2; //2 + 2 * doorways.Length;
int hcount = 2; //vcount;
Vector3 offset = wall.center;
wall.center -= offset;
Vector3[] axes = Util.VecBreak(wall.size);
if (axes.Length < 2)
{
return(null);
}
Vector3 horiz = axes[0].normalized;
Vector3 verti = axes[1].normalized;
VecSortTree hComps = new VecSortTree();
VecSortTree vComps = new VecSortTree();
Interval hRange = new Interval(Util.VecSum(Vector3.Scale(wall.min, horiz)), Util.VecSum(Vector3.Scale(wall.max, horiz)));
Interval vRange = new Interval(Util.VecSum(Vector3.Scale(wall.min, verti)), Util.VecSum(Vector3.Scale(wall.max, verti)));
hComps.Push(Vector3.Scale(wall.min, horiz));
vComps.Push(Vector3.Scale(wall.min, verti));
hComps.Push(Vector3.Scale(wall.max, horiz));
vComps.Push(Vector3.Scale(wall.max, verti));
foreach (Bounds door in doorways)
{
if (hComps.Push(Vector3.Scale(door.min - offset, horiz), hRange))
{
hcount++;
}
if (hComps.Push(Vector3.Scale(door.max - offset, horiz), hRange))
{
hcount++;
}
if (vComps.Push(Vector3.Scale(door.min - offset, verti), vRange))
{
vcount++;
}
if (vComps.Push(Vector3.Scale(door.max - offset, verti), vRange))
{
vcount++;
}
}
Vector3[] hArray = new Vector3[hcount];
Vector3[] vArray = new Vector3[vcount];
for (int i = 0; i < vcount; i++)
{
vArray[i] = vComps.Pop();
if (vArray[i].x == 11030)
{
//throw new Exception();
}
}
for (int i = 0; i < hcount; i++)
{
hArray[i] = hComps.Pop();
}
Vector3[] vertices = new Vector3[vcount * hcount];
Vector2[] uvs = new Vector2[vcount * hcount];
int iVert = 0;
for (int i = 0; i < vcount; i++)
{
for (int j = 0; j < hcount; j++)
{
vertices[iVert] = hArray[j] + vArray[i];
uvs[iVert] = new Vector2(Util.VecSum(hArray[j]),
Util.VecSum(vArray[i]));
iVert++;
}
}
Vector3[] norms = new Vector3[vcount * hcount];
iVert = 0;
for (int i = 0; i < vcount; i++)
{
for (int j = 0; j < hcount; j++)
{
norms[iVert] = wallNormal;
iVert++;
}
}
Mesh newMesh = new Mesh();
newMesh.vertices = vertices;
newMesh.uv = uvs;
newMesh.normals = norms;
int[] triList = new int[(hcount - 1) * (vcount - 1) * 6];
int iTri = 0;
int p = 0;
int q = 2;
bool invert = Util.VecSig(wallNormal) > 0;
if (wallNormal == Vector3.forward || wallNormal == Vector3.forward * -1)
{
invert = !invert;
}
if (invert)
{
p = 2;
q = 0;
}
for (int i = 0; i < vcount - 1; i++)
{
for (int j = 0; j < hcount - 1; j++)
{
int v = i * hcount + j;
bool makeTriangle = !CheckDoors(vertices[v + hcount] + offset, vertices[v + 1] + offset, doorways);
if (makeTriangle)
{
triList[iTri * 3 + p] = v;
triList[iTri * 3 + 1] = v + 1;
triList[iTri * 3 + q] = v + hcount;
iTri++;
triList[iTri * 3 + p] = v + 1;
triList[iTri * 3 + 1] = v + 1 + hcount;
triList[iTri * 3 + q] = v + hcount;
iTri++;
}
}
}
newMesh.triangles = triList;
return(newMesh);
}
