You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+3-1Lines changed: 3 additions & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,6 +1,8 @@
1
1
# static Quadtree
2
2
3
-
A data structure used for efficient location approximation of coordinates on a plain. My version here is static which means it is completely built from the top down during initialization. Only simple minimum and maximum querries are made against objects to find which (ready made) quadnodes they intersect and to focus on within the sub-quadnodes. This static model eliminates both the real-time creation of Quadnode objects and the calculations needed to identify their vertical/horizontal centers.
3
+
A data structure used for efficient location approximation of coordinates on a plain. My version here is static meaning it is completely built from the tip down to the leaves during initialization. Only simple minimum and maximum querries are made against AABBs to find which (ready made) quadnodes they intersect and to focus on within the sub-quadnodes. This static model eliminates both the real-time creation of Quadnode objects and the calculations needed to identify their vertical/horizontal centers.
4
+
5
+
The Quadtree will look for at least 2 AABBs that share the same leaf quadnode marking each as being in close proximity to the other.
0 commit comments