Algorithm for calculating the shortest path between two points on the surface of a three-dimensional grid

Question

I am looking for an algorithm to calculate the following:

I have:

• Three-dimensional triangular grid. Triangles do not necessarily lie in the same plane. The angle between the normal vectors of two adjacent triangles is less than 90 degrees.

• Two points. Two points lie either on the edge of the triangular grid or inside the triangle of the grid.

I need to compute a polyline that represents the shortest path between two points on a grid.

What is the easiest and / or effective strategy for this?

Answer 1

; , "" .

, , . 2d ( ); ( ) .

---

Edit

. () , , , , , "" . :

• Google " 3d-" ,
• .: fooobar.com/questions/344150/... - danh