How do you achieve string pulling programmatically?
How do you eliminate mid-points as you see them?
I am puzzled in the following scenerio,

   x xb   x  *** x   ***x    ***a    ***

How does the algorithm cut point a across to point b?
Thanks
Jack

You can check what is the farthest node in your path that you have straight-line access to, and then skip the intermediate nodes.

Quote: Original post by alvaro
You can check what is the farthest node in your path that you have straight-line access to, and then skip the intermediate nodes.

Shoot a ray and test if it hits any obstacles?
Thanks
Jack

Quote: Original post by lucky6969b

Quote: Original post by alvaro
You can check what is the farthest node in your path that you have straight-line access to, and then skip the intermediate nodes.

Shoot a ray and test if it hits any obstacles?

If in your game that guarantees clearance, sure.

By that, he means exceptions such as pits, ledges, low overhangs, etc.