Followers 0

## 1 post in this topic

Let me preface this by saying that I have never used data trees before so everything I'm saying here is all self taught and google researched over the last week.

Ok with that out of the way:

I have a quad tree set up for my side scrolling game. Each node has two array lists (they are array lists for convenience, they never get to have more than four members), one for data and one for children nodes.

I pass the root node entities (the data) and based on their x and y positions, it passes it to it's children, who pass it to their children and so on, until it is at a leaf node where it is either placed into the nodes data list, or, if the list is full (4 entities), the node is given four children and all 5 entities (original 4 plus the new one) are passed to its children.

My problem now is how do I go through and get them back when I want to use them?
All the traversal algorithms I've seen have given me all the nodes, but I only need the leaf nodes.
In addition, I really only need certain nodes based on which node the player is in.

Any help on this would be very welcome,
Thanks,
Peter
0

##### Share on other sites
If you have an algorithm that returns all nodes in the quadtree using recursion, all you have to do is check if a child node is contained in/intersected by the area you want to retrieve entities from. If it is not, you can ignore that entire branch of the tree. Something along the lines of this should work.

[CODE]
getEntitiesInRectangle(Node node, Rectangle rect, List output)
if node is leaf:
for every entity e in node:
if rect contains/intersects e: add e to output;
else
for every child n in node:
if rect contains/intersects n:
call getEntitiesInRectangle(n, rect, output)
[/CODE] Edited by lwm
0

## Create an account or sign in to comment

You need to be a member in order to leave a comment

## Create an account

Sign up for a new account in our community. It's easy!

Register a new account