Sign in to follow this  
lucky6969b

Can concave polygons be used in pathfinding?

Recommended Posts

My apologies first if I say something silly because I am no graphic expert,

I am just a programmer. Most of the times I heard about the

usages of convex polygons which are plenty.

But can a concave polygon be used in the pathfinding process?

Thanks Jack

Edited by lucky6969b

Share this post


Link to post
Share on other sites

Hello Ashaman73,

Thank you for clearing up my doubts,

I asked this question because I suddenly think of this thing that might or might not work.

Originally I have several navmeshes with different radii, I want to use them for cooperative pathfinding as an alternative

to steering.

Now I'd like to calculate the intersection between these navmeshes, if navmesh A, B and C intersect, then they can

cooperatively path find, if just A and B intersect, agent C can ignore the other 2 agents, and A and B can continue

to cooperative pathfind. I've found a library actually which does this, but the caveat is the results may be concave.

 

https://sourceforge.net/projects/polyclipping/files/clipper_ver6.1.3a.zip/stats/map

 

How do you call a process which turns a concave poly into a convex poly? Triangulation is not the word?

 

What is your opinion?

Thanks

Jack

Edited by lucky6969b

Share this post


Link to post
Share on other sites
It's called convex decomposition, and apparently there are quite a few papers on the topic. Most are probably more complex than what you need.

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this