Jump to content
  • Advertisement
Sign in to follow this  
sinnelius

Procedural wall angle detection & intersection point

This topic is 893 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Developing a simple wallrun/parkour game
what i need is rather ...deceptively simple. Its based on several old game titles.

I uses, Unity, Unreal, and could find nothing alike.

I hope  i am describing this correctly:
1. character is in a set world position, near it is several meshes/ collider units, not convex definitely
2. upon a set distance radius of it, not colliding directly, the character acquires the meshes' angle, and anything that is not 'ground'
about 120 degree or less than 90 degree, (very steep wall or ledge, or a sharp valley) is considered "climbable".
3.from there, character either shoots ray, or a sweeptest to it, to acquire the hit and normal of that plane:
so if the plane is a short , descending ledge, like... stairs railing made of flat polygon, it will acquire hit point somewhere on the top most of that stairs handle, if the plane is large, than the max is clamped on the character height.
4. then, sort out the smallest distance, and the nearest is the point where character can jump to and climb.

 

I understand this topic is less of the climbing but more of the edge acquisition, 

but this is the core foundation and its been driving me nuts.
I tried things like BSPtree, but everytime i bruteforce it in unity, it gets so heavy during runtime.
I'm making something like PPSPP quality so it has to be lightweight, and using a psp game as comparison, this game must not run heavier than it

with the  same asset quality. 

Thoughts?

I'm browsing through several engines too other than Unity and Unreal, openframeworks and polycode maybe...
so this solution better be universal of sorts....

I'll put some visual examples next time.

 

 

 

Share this post


Link to post
Share on other sites
Advertisement
I'm not sure I understand what you're trying to do, but if you can brute force it you already have a sort of solution it seems? Have you tried splitting meshes up into ground and not ground before hand so that you don't have to do that at runtime? You could also use a quadtree or an octree to only test against meshes that are nearby instead of all of them (a simple bounding sphere range check might also do it). Another solution might be to use meshes that are approximations of the meshes being displayed, less triangles to sift through. Edited by Mussi

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!