Find path around obstacles at specified locations ( e.g. furniture in a room )
Find path between regularly spaced obstacles ( e.g. crops in a field https://ravenspoint.wordpress.com/2020/07/16/ferrero-rocher-trees-computational-geometry )
Input is read from a space delimited text file, selected using menu item File | Calculate
Details
The algorithm is a fast approximation of the travelling salesman problem which tries to minimize the amount of backtracking. Details