Hello,
Thank you for your replies.
I was familiar with the "Survex Aven" method, but it was "Distance along
the survey legs between these points" that I was looking for.
The method proposed by Benedikt Hallinger (shortestPath.py) works very well.
I'm currently unable to compile "survex-dist" (I get an error), the
method proposed by Alastair Gott.
Eric Georges
Le 05/09/2025 à 09:26, Benedikt Hallinger a écrit :
Hi,
I once found a GPL2 library called "survex.py" from Thomas Holder.
Using that it is possible to find the shortest path (as you walk)
between two points.
Survex itself just shows the shortest path as the crow flies.
I made a convinience wrapper "shortestPath.py" for the task, call
example (linux):
$ ./shortestPath.py Hirlatzhoehle.Zubringer.1.1.0
Hirlatzhoehle.Alter_Teil.2.1.55
('Shortest route length:', 2214.546790435116, 'm')
('Cumulated height going upwards:', 354, 'm')
('Cumulated depth going downwards:', -196, 'm')
I hope its useful,
greetings, Beni
Am 2025-09-04 22:28, schrieb eric georges via Therion:
Hello,
I'd like to know if there's a method for calculating the distance
between two survey station, and also for identifying the shortest
path, or even for determining all possible paths.
I think this should be possible using the .slq file.
thanks
Eric Georges
_______________________________________________
Therion mailing list
[email protected]
https://mailman.speleo.sk/listinfo/therion
_______________________________________________
Therion mailing list
[email protected]
https://mailman.speleo.sk/listinfo/therion
