I have written a method to help create quadtree, each quadtree is a root node, and 4 children of a root node I am using a deep recurrence to prevent this function from splitting multiple times. The log of the side of the square passed in that depth is equal to base 2 (one square is always passed). However, I get infinite repetition from this
= "text">
n-> IsLeaf () condition means "all children of
n are inefficient", so I think that this is always a lie here.
Comments
Post a Comment