Question

I’m writing a collision detection system for a 3D platformer video game. All the basics are working well. But when the character lands on a steep-slope polygon, I need them to slide down the slope of the polygon. I can do most of this, but I can’t find out how to calculate the downward vector that matches the slope of the given polygon they have collided with. I have searched many forums, including this one, but can’t find the answer.

Each polygon is composed of 3 vertices (x, y, z) in world space.

I also have the surface normal for each polygon, and am familiar with dot and cross products.

I can also calculate a simple angle value for the polygon by taking the arccos of the dot product of the face normal and the world up vector, which gives the angle of the slope of the polygon from level ground, like 60 degrees. If the angle is steeper than 60 degrees, I decide that the character should slide down the slope. But I need the downward vector that matches the slope of the polygon, so I can apply their position to it over time and thus, slide down.

I believe the slope vector should be perpendicular to the surface normal, but I don’t see how to calculate it given the information I have.

Thanks for any help…

Answer 1

If you want a vector independent of the player’s velocity just find the center of your triangle and get a vector from that to the lowest vertex. Omitting tests for degenerate cases it would look something like:

Vertex center = Sum(vertex[0], vertex[1], vertex[2]) / 3;
Vertex lowest = Min(vertex[0], vertex[1], vertex[2]); // min of your up/down coordinate
Vector slopeVector = Normalize(lowest - center);

Edit:
This wouldn’t work well for equilateral triangles or ones where the desired ‘low’ point is not in the direction of a vertex. A more general solution might be to rotate the normal by 90 degrees around an axis defined by the center of the triangle and a point on the side of the triangle halfway between the highest and lowest points.

Ideally you don’t independently calculate this but instead calculate overall slope gradients interpolated across many triangles exactly like calculating interpolated vertex normals.