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 bounding-boxes
Search options answers only
not deleted
user 2624
The smallest box shape that fully encloses a 3D mesh. They are usually used for things like broad phase culling, a technique to do an initial coarse check for which parts of a 3D scene to include for rendering or collision detection.
1
vote
Resolving bounding box collision detection
There's a couple of issues with the posted code.
Your collision-checking loop looks something like this:
for(Y) {
for(X) {
if (collision) {
hitSomething = true;
f …
- 9,039
4
votes
Accepted
Array-based tilemaps and bounding box (aabb?), how to do efficient tile collisions?
The reason there isn't a standard AABB or partition strategy for tile-based maps is that it's already easier to detect collisions against it than using AABBs.
static int TILE_WIDTH=16, TILE_HEIGHT=1 …
- 9,039