Mr. Smith
Reputation
Top tag
Next privilege 200 Rep.
 Jul 21 awarded Critic Jul 21 awarded Popular Question Jul 21 comment My algorithm that extracts the largest box that can be made from smaller boxes, is too slow That two nodes are completely filled doesn't imply that they should be merged; it's not a step towards finding the largest box; if you merge them, you'll likely have to split them again at a later point once the largest box is found. I don't see how an octree helps in this scenario. Jul 21 revised My algorithm that extracts the largest box that can be made from smaller boxes, is too slow deleted 164 characters in body Jul 21 revised My algorithm that extracts the largest box that can be made from smaller boxes, is too slow added 355 characters in body Jul 21 comment My algorithm that extracts the largest box that can be made from smaller boxes, is too slow @Rotem Perhaps, but I'm actually looking for alternative algorithms rather than a review of my code. I've provided my code just as a force of habit. Jul 21 revised My algorithm that extracts the largest box that can be made from smaller boxes, is too slow added 148 characters in body Jul 21 asked My algorithm that extracts the largest box that can be made from smaller boxes, is too slow Jun 19 awarded Popular Question Sep 24 awarded Autobiographer Jan 15 asked How do I find which line connected two squares? Dec 16 awarded Scholar Dec 16 accepted Faster reads, on an infinite grid plane, than using a hash table? Dec 16 comment Faster reads, on an infinite grid plane, than using a hash table? Good call on the memory locality; instead of `for(y)for(x)` I switched it to `for(x)for(y)` (causing `y*h+x` to be effectively random) and performance went from 1012% to 270%. At that low of difference, it's not worth the effort. You were right all along. Dec 16 revised Faster reads, on an infinite grid plane, than using a hash table? deleted 402 characters in body Dec 15 revised Faster reads, on an infinite grid plane, than using a hash table? added 38 characters in body Dec 15 awarded Supporter Dec 15 revised Faster reads, on an infinite grid plane, than using a hash table? added 19 characters in body Dec 15 revised Faster reads, on an infinite grid plane, than using a hash table? added 367 characters in body Dec 14 revised Faster reads, on an infinite grid plane, than using a hash table? added 44 characters in body