I posted a few weeks back about A Star Path finding on a spherical map. It was extremely inefficient, but demo’d the concept quite well.
This next version is far more efficient and can find a path in an average (on my machine) of about 2 milliseconds.
This version is using raycasts against points on a mesh to determine where to go.
There is a list of navpoints that are positioned at each vertex on the mesh, these points make up our navigation system.
This WebGl version runs quite well, but is significantly slower than a standalone build.