This is the implementation accompanying my blog post on finding neighbor nodes in quadtrees (visit http://geidav.wordpress.com). The code only implements finding neighbors in the north direction. The other directions (west, east, south, north-west, north-east, south-west, south-east) can be easily derived, because they're symmetric.
-
Notifications
You must be signed in to change notification settings - Fork 4
Code to find neighbor nodes in a Quadtree
License
geidav/quadtree-neighbor-finding
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Code to find neighbor nodes in a Quadtree
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published