Timeline for most efficient AABB vs Ray collision algorithms
Current License: CC BY-SA 4.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2020 at 7:15 | comment | added | Engineer | @TylerShellberg Sometimes you can also nudge the data to prevent these pathological cases from occurring. This can be a more performant solution than adding additional runtime checks; however, it's not always possible. | |
| Feb 3, 2020 at 23:39 | comment | added | Tyler Shellberg | To anyone using the "branch-less approach", be warned that it will fail if the ray's origin starts along one of the planes of the box, and it is also parallel to that plane. IE, if we get a "line hit" or "plane hit" (not sure the term). In that case the result is a nan value, and the results are junk. Additional checks need to be added to fix that. Also, if using C++ std::min and std::max, it is far from branchless depending on implementation. | |
| S Jan 19, 2020 at 16:27 | history | suggested | Razakhel | CC BY-SA 4.0 | Added code link for the branchless approach |
| Jan 19, 2020 at 16:14 | review | Suggested edits | |||
| S Jan 19, 2020 at 16:27 | |||||
| Apr 15, 2017 at 8:03 | history | edited | Engineer | CC BY-SA 3.0 | added 106 characters in body |
| S Apr 15, 2017 at 8:02 | history | suggested | z0rberg's | CC BY-SA 3.0 | Fixed broken links: Changed 1st to archive.org and replaced the second, non-archived, with something equal. o7 |
| Apr 15, 2017 at 6:58 | review | Suggested edits | |||
| S Apr 15, 2017 at 8:02 | |||||
| Sep 15, 2016 at 5:06 | comment | added | Engineer | How about this? Just search "raybox.c branchless". | |
| May 3, 2016 at 16:46 | history | edited | Engineer | CC BY-SA 3.0 | added 58 characters in body |
| May 3, 2016 at 16:45 | comment | added | Engineer | Hi @GiorgioLiggio and thanks for the heads up. I've included details on the article in my answer - this should help people find it even if links break. For now, here is a reference implementation. | |
| May 3, 2016 at 15:13 | comment | added | liggiorgio | The two links you provide generate "Not found" and "Forbidden" errors respectively... | |
| Dec 23, 2012 at 14:03 | comment | added | Engineer | A well commented implementation of Woo's algorithm may be found here. | |
| Dec 23, 2012 at 14:01 | history | edited | Engineer | CC BY-SA 3.0 | added 197 characters in body |
| Oct 13, 2012 at 13:45 | comment | added | bobobobo | The article is here | |
| Dec 16, 2011 at 9:51 | vote | accept | Dollarslice | ||
| Dec 14, 2011 at 11:12 | comment | added | Engineer | Pleasure, Sir. I'd also suggest comparing any algorithms you find on this sort of basis. (There are more official lists like this elsewhere, but can't find any right now.) | |
| Dec 13, 2011 at 20:15 | history | edited | Engineer | CC BY-SA 3.0 | added 23 characters in body |
| Dec 13, 2011 at 20:09 | history | edited | Engineer | CC BY-SA 3.0 | added 23 characters in body |
| Dec 13, 2011 at 20:04 | history | answered | Engineer | CC BY-SA 3.0 |