0
\$\begingroup\$

I have a navigation mesh consisting of triangles. I'm using the center of each triangle as a node for a pathfinding algorithm (A*). I would like to do path straightening with Simple Stupid Funnel Algorithm, as explained here https://digestingduck.blogspot.com/2010/03/simple-stupid-funnel-algorithm.html. However I don't know what the best approach is for finding the edges along the calculated path, to use for string pulling. I can find the sequence of triangles that form the path. But how do I figure out the edges between them that I should use?

Do I need to store the data for each triangle of all its adjacent triangles and which vertices they share?

\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.