Timeline for Finding direction of travel in a world with wrapped edges
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16, 2011 at 16:08 | history | edited | Toomai | CC BY-SA 3.0 |
fixed...again
|
| Nov 16, 2011 at 16:06 | comment | added | Toomai | Ugh this is what happens when you don't have to opportunity to test code before posting it. Will fix. If someone finds another error with this I'll probably just delete it before too many people get mislead. | |
| Nov 16, 2011 at 13:46 | comment | added | sam hocevar |
Why is this the accepted answer?? It doesn't even work. Suppose MapX is 100, T.X is 90 and S.X is 10. dx should clearly be 20, but this algorithm will return 30!
|
|
| Nov 16, 2011 at 12:26 | vote | accept | crazy | ||
| Nov 16, 2011 at 1:59 | history | migrated | from stackoverflow.com (revisions) | ||
| Nov 15, 2011 at 16:38 | comment | added | Scott Chamberlain | Still got a few errors on what the sign of dx and dy will be when all is said and done, mind if I edit? | |
| Nov 15, 2011 at 16:28 | comment | added | Toomai | Right then I'll fix that. | |
| Nov 15, 2011 at 16:00 | comment | added | Scott Chamberlain | You need some work on the signs of dx and dy as the code as is will break if T.X is less than S.X or T.Y is less than X.Y. Other than that this is the best solution IMHO. | |
| Nov 15, 2011 at 15:56 | history | answered | Toomai | CC BY-SA 3.0 |