Using a slightly move efficient insert method for rectangle quadtree

git-svn-id: https://java-algorithms-implementation.googlecode.com/svn/trunk@394 032fbc0f-8cab-eb90-e552-f08422b9a96a

Author: phishman3579

src/com/jwetherell/algorithms/data_structures/QuadTree.java

@@ -362,10 +362,10 @@ private void subdivide() {
 
             private boolean insertIntoChildren(AABB b) {
                 //Try to insert into all children
-                if (northWest.insert(b)) return true;
-                if (northEast.insert(b)) return true;
-                if (southWest.insert(b)) return true;
-                if (southEast.insert(b)) return true;
+                if (northWest.aabb.insideThis(b) && northWest.insert(b)) return true;
+                if (northEast.aabb.insideThis(b) && northEast.insert(b)) return true;
+                if (southWest.aabb.insideThis(b) && southWest.insert(b)) return true;
+                if (southEast.aabb.insideThis(b) && southEast.insert(b)) return true;
                 return false;
             }