| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years, 4 months |
| seen | Jan 10 at 5:43 | |
| stats | profile views | 2 |
|
Nov 9 |
awarded | Teacher |
|
Feb 13 |
comment |
Voronoi regions of a (convex) polygon Two books, Graphics Gems IV and Numerical Recipes, provide good discussion as well as source code. I recommend either. |
|
Feb 1 |
comment |
Collision detection of convex shapes on voxel terrain An irregular shape (i.e. one with a protrusion) is definitely suited to a hierarchical BB structure (think something like a specialized octree). In the case of a simple cube with a spike, I would enclose the whole object in one large bounding box. Within that box, I would have two smaller BB's - one enclosing the cube and one enclosing the spike. At worst, you have three high-level hit tests before knowing that an intersection occurred with the spike. Of course, this strategy assumes you can decompose your complex objects into a number of smaller ones. (I think that's reasonable.) |
|
Feb 1 |
answered | Collision detection of convex shapes on voxel terrain |
|
Jan 25 |
awarded | Supporter |
|
Jan 25 |
comment |
Why is Reinforcement Learning so rarely used in pathfinding? +1 for your statement on the reward function. And, no, I believe it's a fair characterization. RL can be great at what it does, but I would not expect strict pathfinding to be in that set. (Note that I am deliberately excluding motion planning from this discussion. RL has been successfully applied to that sort of problem). |