Hi Tim—
I’m not sure what algorithm Paralog uses. However, there are some difficulties in calculating this kind of distance which you may not have thought of…
Perhaps the most obvious thing would be to calculate distance along the path between the start and end of the competition window. This would give you your “total” distance traveled. However, I think there is a major issue inherent in this calculation, described by the “coastline paradox”:
http://en.wikipedia.org/wiki/Coastline_paradox
Essentially, there is no well-defined notion of “length” for the path between two points. Unfortunately, the total distance measured in this way depends sensitively on the where you choose to measure the individual positions. Our flight paths aren’t truly fractal, but they can have features which are small relative to the distance between consecutive points, so my feeling is that the coastline paradox applies. I suppose, as an experiment, that one could try calculating distance using various “granularities” to see if the distance converges to a single value.
Assuming there is no well-defined notion of path length, the best solution, I think, is to calculate the distance between the point where you entered the competition window and the point where you left it. This is the “straight-line” distance, and it is shorter than any “total” distance you might choose. This makes it the most conservative measurement of distance, which I think is a nice quality for competitions and records. Calculating glide ratio from the straight-line distance and the size of the competition window would again give you the most conservative measurement.
Hope this helps!
Michael
--
You received this message because you are subscribed to the Google Groups "FlySight Developers" group.
To unsubscribe from this group and stop receiving emails from it, send an email to flysight-dev...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.