in reply to Re^5: Implementation of a QuadTree and worries of a lone programmer (Flood Fill)
in thread RFC: Implementation of a QuadTree and worries of a lone programmer

Well damn. Thanks a lot!

Your solution pretty much obsoletes my QuadTree and is about 5-6 times faster WHILE being more efficient.

One question i have though is: Why do you use references instead of actual arrays?

Aside from that, this'll be perfect with a little bit of rewriting. There's also a way to optimize by rejecting rectangles that have a size that's smaller than a certain limit and lowering that limit when no further matches are found. Scratch that, it makes the runtime explode.
  • Comment on Re^6: Implementation of a QuadTree and worries of a lone programmer (Flood Fill)

Replies are listed 'Best First'.
Re^7: Implementation of a QuadTree and worries of a lone programmer (Flood Fill)
by eric256 (Parson) on Nov 10, 2008 at 15:37 UTC

    I almost always use references instead of arrays ( or hashes for that matter) simply because thats the notation I'm used to. ;)


    ___________
    Eric Hodges
[reply]

In Section Meditations