public void insert(GameObject gameObject)
{
if (Nodes[0] != null) {
List<int> indexes = GetIndex(gameObject);
for (int i = 0; i < indexes.Count; i++) {
int index = indexes[i];
if (index != -1) {
Nodes[index].insert(gameObject);
return;
}
}
}
GameObjects.Add(gameObject);
if (GameObjects.Count > MaxObjects && Level < MaxLevels) {
if (Nodes[0] == null) {
split();
}
int i = 0;
while (i < GameObjects.Count) {
List<int> indexes = GetIndex(GameObjects[i]);
GameObject obj = GameObjects[i];
for (int j = 0; j < indexes.Count; j++) {
int index = indexes[j];
if (index != -1) {
Nodes[index].insert(obj);
GameObjects.Remove(obj);
}
else {
i++;
}
}
}
}
}
private List<int> GetIndex(GameObject gameObject)
{
List<int> indexes = new List<int>();
double verticalMidpoint = Bounds.X + (Bounds.Width / 2);
double horizontalMidpoint = Bounds.Y + (Bounds.Height / 2);
bool topQuadrant = gameObject.BoundingBox.Top <= horizontalMidpoint;
bool bottomQuadrant = gameObject.BoundingBox.Bottom >= horizontalMidpoint;
bool topAndBottomQuadrant = (gameObject.BoundingBox.Top < horizontalMidpoint) && (gameObject.BoundingBox.Bottom > horizontalMidpoint);
if (topAndBottomQuadrant) {
topQuadrant = false;
bottomQuadrant = false;
}
//Left and right quad
if(gameObject.BoundingBox.Left <= verticalMidpoint
&& gameObject.BoundingBox.Right >= Bounds.Left
&& gameObject.BoundingBox.Right >= verticalMidpoint
&& gameObject.BoundingBox.Left <= Bounds.Right) {
if(topQuadrant) {
indexes.Add(0);
indexes.Add(1);
}
else if(bottomQuadrant) {
indexes.Add(2);
indexes.Add(3);
}
else if(topAndBottomQuadrant) {
indexes.Add(0);
indexes.Add(1);
indexes.Add(2);
indexes.Add(3);
}
}
//Right quad
else if(gameObject.BoundingBox.Left > verticalMidpoint) {
if(topQuadrant) {
indexes.Add(1);
}
else if(bottomQuadrant) {
indexes.Add(3);
}
else if(topAndBottomQuadrant) {
indexes.Add(1);
indexes.Add(3);
}
}
//Left quad
else if(gameObject.BoundingBox.X + gameObject.Width < verticalMidpoint) {
if(topQuadrant) {
indexes.Add(0);
}
else if(bottomQuadrant) {
indexes.Add(2);
}
else if(topAndBottomQuadrant) {
indexes.Add(0);
indexes.Add(2);
}
}
else {
indexes.Add(-1);
}
return indexes;
}
public static bool IntersectPixels(
Matrix transformA, int widthA, int heightA, Color[] dataA,
Matrix transformB, int widthB, int heightB, Color[] dataB, GameObject gameObject1, GameObject gameObject2)
{
//// Hent senter av teksturen, transformer dette punktet til skjermkoordinater
//Vector2 tempVec = new Vector2(widthA / 2.0f, heightA / 2.0f);
//Vector2 aOrigin = Vector2.Transform(tempVec, transformA);
//// Gjør det samme med B
//tempVec.X = widthB / 2.0f;
//tempVec.Y = heightB / 2.0f;
//Vector2 bOrigin = Vector2.Transform(tempVec, transformB);
//// Generer en max radius for teksturene (hypotenus / 2)
//double aRadius = Math.Sqrt((widthA * widthA) + (heightA * heightA)) / 2.0f;
//double bRadius = Math.Sqrt((widthB * widthB) + (heightB * heightB)) / 2.0f;
//// Finn avstanden mellom punktene
////float distance = Vector2.Distance(aOrigin, bOrigin);
//// Om funksjonen ovenfor ikke fungerer som forventet, er dette hvordan det gjøres ellers:
//// d = sqrt(dx^2 + dy^2)
//double distance2 = Math.Sqrt(((aOrigin.X - bOrigin.X) * (aOrigin.X - bOrigin.X) +
// (aOrigin.Y - bOrigin.Y) * (aOrigin.Y - bOrigin.Y)));
//Console.WriteLine(distance2);
//if (distance2 > (aRadius + bRadius)) {
// //Console.WriteLine("Distance was greater, avoided!");
// return false;
//}
//Console.WriteLine(DateTime.Now.Millisecond + " NOT GREATER! NOT AVOIDED!");
// Calculate a matrix which transforms from A's local space into
// world space and then into B's local space
Matrix transformAToB = transformA * Matrix.Invert(transformB);
// When a point moves in A's local space, it moves in B's local space with a
// fixed direction and distance proportional to the movement in A.
// This algorithm steps through A one pixel at a time along A's X and Y axes
// Calculate the analogous steps in B:
var stepX = Vector2.TransformNormal(Vector2.UnitX, transformAToB);
var stepY = Vector2.TransformNormal(Vector2.UnitY, transformAToB);
// Calculate the top left corner of A in B's local space
// This variable will be reused to keep track of the start of each row
var yPosInB = Vector2.Transform(Vector2.Zero, transformAToB);
// For each row of pixels in A
for (int yA = 0; yA < heightA; yA++) {
// Start at the beginning of the row
Vector2 posInB = yPosInB;
// For each pixel in this row
for (int xA = 0; xA < widthA; xA++) {
// Round to the nearest pixel
int xB = (int) Math.Round(posInB.X);
int yB = (int) Math.Round(posInB.Y);
// If the pixel lies within the bounds of B
if (0 <= xB && xB < widthB && 0 <= yB && yB < heightB) {
// Get the colors of the overlapping pixels
Color colorA = dataA[xA + yA * widthA];
Color colorB = dataB[xB + yB * widthB];
// If both pixels are not completely transparent,
if (colorA.A != 0 && colorB.A != 0) {
// then an intersection has been found
return true;
}
}
// Move to the next pixel in the row
posInB += stepX;
}
// Move to the next row
yPosInB += stepY;
}
// No intersection found
return false;
}
public List<GameObject> retrieve(List<GameObject> retrieveObjects, GameObject gameObject)
{
List<int> indexes = GetIndex(gameObject);
for (int i = 0; i < indexes.Count; i++) {
int index = indexes[i];
if (index != -1 && Nodes[0] != null)
Nodes[index].retrieve(retrieveObjects, gameObject);
retrieveObjects.AddRange(GameObjects);
}
return retrieveObjects;
}
public bool IntersectPixels(GameObject otherObject)
{
return CollitionDetection.IntersectPixels(transform, texture.Width, texture.Height, colorData,
otherObject.transform, otherObject.texture.Width, otherObject.texture.Height, otherObject.colorData, this, otherObject);
}
