Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with ray
Search options not deleted
user 5904
0
votes
Accepted
Ray vs AABB (2D) reporting hits
The short answer is that the "branchy" code in the blog post is wrong, and my intuition is correct. The branchless does work correctly, as explained the blog post.
- 1,203
0
votes
1
answer
189
views
Ray vs AABB (2D) reporting hits
I've been working a 2D ray versus AABB implementation. I worked it out on paper, then read about a popular "branchless" algorithm. … The ray is at (3,0) and goes up. Standard Cartesian coordinates.
This returns true that there is an intersection. Clearly there is not. …
- 1,203