I have a compound representing a 3D surface. On this surface two points. I want to find the shortest path between these two points (geodesic).
Does somebody has already think to this problem and can help on it.

Thanks for your replies


Sandor Racz's picture


I DO NOT KNOW if OpenCASCADE has this feature or not.
In general one of the options is to triangulate the surface and calculate the the distance on the resulting polyhedron between the two points. The precision in this case depends on the precision of the triangulation, of course. It can be done in a robust way. You can find quite a few related papers here: