[gameprogrammer] Since we are on the topic of optomized data structures (:
- From: "Alan Wolfe" <alan.wolfe@xxxxxxxxx>
- To: gameprogrammer@xxxxxxxxxxxxx
- Date: Fri, 13 Jul 2007 11:42:23 -0700
Heya,
I have a quad tree which stores objects in it from a 2d world.
I was wondering, in general if i wanted to find a node in a quad tree where
i had both the bounding box and a unique id#, would it be more efficient to
just recursively search the tree for the id#? Or would it be more efficient
to do the bounding box search to "cull some branches" of the recursive ID
search?
Other related posts:
