If the maximum level of division is 6, and I start off at the root,
If I search if the point intersects with the current quadnode's bounding box,
the worst case is 24 iterations, am I correct?
If I sort the bounding boxes in advance, and use a binary search,
the maximum speed is 12 iterations, right?
In the octree case, the worst case is doubled, to 48 iterations,
with binary search of 24 iterations in the worst case?
Thanks
Jack
No comments:
Post a Comment