* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
#include <glib.h>
#include <time.h>
-#include <stdio.h>
#include <stdlib.h>
+#ifdef HAVE_STRING_H
#include <string.h>
+#endif
+#ifdef HAVE_MATH_H
#include <math.h>
+#endif
+
#include "coords.h"
#include "vikcoord.h"
#include "viktrack.h"
#include "globals.h"
+#include "dems.h"
VikTrack *vik_track_new()
{
}
+void vik_track_set_name(VikTrack *tr, const gchar *name)
+{
+ if ( tr->name )
+ g_free ( tr->name );
+
+ if ( name && name[0] != '\0' )
+ tr->name = g_strdup(name);
+ else
+ tr->name = NULL;
+}
+
void vik_track_set_comment(VikTrack *tr, const gchar *comment)
{
if ( tr->comment )
tr->comment = NULL;
}
+void vik_track_set_description(VikTrack *tr, const gchar *description)
+{
+ if ( tr->description )
+ g_free ( tr->description );
+
+ if ( description && description[0] != '\0' )
+ tr->description = g_strdup(description);
+ else
+ tr->description = NULL;
+}
+
void vik_track_ref(VikTrack *tr)
{
tr->ref_count++;
}
+void vik_track_set_property_dialog(VikTrack *tr, GtkWidget *dialog)
+{
+ /* Warning: does not check for existing dialog */
+ tr->property_dialog = dialog;
+}
+
+void vik_track_clear_property_dialog(VikTrack *tr)
+{
+ tr->property_dialog = NULL;
+}
+
void vik_track_free(VikTrack *tr)
{
if ( tr->ref_count-- > 1 )
return;
+ if ( tr->name )
+ g_free ( tr->name );
if ( tr->comment )
g_free ( tr->comment );
+ if ( tr->description )
+ g_free ( tr->description );
g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL );
g_list_free( tr->trackpoints );
+ if (tr->property_dialog)
+ if ( GTK_IS_WIDGET(tr->property_dialog) )
+ gtk_widget_destroy ( GTK_WIDGET(tr->property_dialog) );
g_free ( tr );
}
new_tr->trackpoints = g_list_append ( new_tr->trackpoints, new_tp );
tp_iter = tp_iter->next;
}
+ vik_track_set_name(new_tr,tr->name);
vik_track_set_comment(new_tr,tr->comment);
+ vik_track_set_description(new_tr,tr->description);
return new_tr;
}
VikTrackpoint *vik_trackpoint_new()
{
- return g_malloc0(sizeof(VikTrackpoint));
+ VikTrackpoint *tp = g_malloc0(sizeof(VikTrackpoint));
+ tp->speed = NAN;
+ tp->course = NAN;
+ tp->altitude = VIK_DEFAULT_ALTITUDE;
+ tp->hdop = VIK_DEFAULT_DOP;
+ tp->vdop = VIK_DEFAULT_DOP;
+ tp->pdop = VIK_DEFAULT_DOP;
+ return tp;
}
void vik_trackpoint_free(VikTrackpoint *tp)
return num;
}
-void vik_track_remove_dup_points ( VikTrack *tr )
+/*
+ * Deletes adjacent points that have the same position
+ * Returns the number of points that were deleted
+ */
+gulong vik_track_remove_dup_points ( VikTrack *tr )
{
+ gulong num = 0;
GList *iter = tr->trackpoints;
while ( iter )
{
if ( iter->next && vik_coord_equals ( &(VIK_TRACKPOINT(iter->data)->coord),
&(VIK_TRACKPOINT(iter->next->data)->coord) ) )
{
- g_free ( iter->next->data );
+ num++;
+ // Maintain track segments
+ if ( VIK_TRACKPOINT(iter->next->data)->newsegment && (iter->next)->next )
+ VIK_TRACKPOINT(((iter->next)->next)->data)->newsegment = TRUE;
+
+ vik_trackpoint_free ( iter->next->data );
tr->trackpoints = g_list_delete_link ( tr->trackpoints, iter->next );
}
else
iter = iter->next;
}
+ return num;
+}
+
+/*
+ * Get a count of trackpoints with the same defined timestamp
+ * Note is using timestamps with a resolution with 1 second
+ */
+gulong vik_track_get_same_time_point_count ( const VikTrack *tr )
+{
+ gulong num = 0;
+ GList *iter = tr->trackpoints;
+ while ( iter ) {
+ if ( iter->next &&
+ ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
+ VIK_TRACKPOINT(iter->next->data)->has_timestamp ) &&
+ ( VIK_TRACKPOINT(iter->data)->timestamp ==
+ VIK_TRACKPOINT(iter->next->data)->timestamp) )
+ num++;
+ iter = iter->next;
+ }
+ return num;
+}
+
+/*
+ * Deletes adjacent points that have the same defined timestamp
+ * Returns the number of points that were deleted
+ */
+gulong vik_track_remove_same_time_points ( VikTrack *tr )
+{
+ gulong num = 0;
+ GList *iter = tr->trackpoints;
+ while ( iter ) {
+ if ( iter->next &&
+ ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
+ VIK_TRACKPOINT(iter->next->data)->has_timestamp ) &&
+ ( VIK_TRACKPOINT(iter->data)->timestamp ==
+ VIK_TRACKPOINT(iter->next->data)->timestamp) ) {
+
+ num++;
+
+ // Maintain track segments
+ if ( VIK_TRACKPOINT(iter->next->data)->newsegment && (iter->next)->next )
+ VIK_TRACKPOINT(((iter->next)->next)->data)->newsegment = TRUE;
+
+ vik_trackpoint_free ( iter->next->data );
+ tr->trackpoints = g_list_delete_link ( tr->trackpoints, iter->next );
+ }
+ else
+ iter = iter->next;
+ }
+ return num;
}
guint vik_track_get_segment_count(const VikTrack *tr)
iter->prev->next = NULL;
iter->prev = NULL;
rv[i] = vik_track_new();
+ // TODO: consider new naming strategy here
+ if ( tr->name )
+ vik_track_set_name ( rv[i], tr->name );
if ( tr->comment )
vik_track_set_comment ( rv[i], tr->comment );
+ if ( tr->description )
+ vik_track_set_description ( rv[i], tr->description );
rv[i]->visible = tr->visible;
rv[i]->trackpoints = iter;
i++;
return rv;
}
+/*
+ * Simply remove any subsequent segment markers in a track to form one continuous track
+ * Return the number of segments merged
+ */
+guint vik_track_merge_segments(VikTrack *tr)
+{
+ guint num = 0;
+ GList *iter = tr->trackpoints;
+ if ( !iter )
+ return num;
+
+ // Always skip the first point as this should be the first segment
+ iter = iter->next;
+
+ while ( (iter = iter->next) )
+ {
+ if ( VIK_TRACKPOINT(iter->data)->newsegment ) {
+ VIK_TRACKPOINT(iter->data)->newsegment = FALSE;
+ num++;
+ }
+ }
+ return num;
+}
+
void vik_track_reverse ( VikTrack *tr )
{
GList *iter;
return (time == 0) ? 0 : ABS(len/time);
}
+/**
+ * Based on a simple average speed, but with a twist - to give a moving average.
+ * . GPSs often report a moving average in their statistics output
+ * . bicycle speedos often don't factor in time when stopped - hence reporting a moving average for speed
+ *
+ * Often GPS track will record every second but not when stationary
+ * This method doesn't use samples that differ over the specified time limit - effectively skipping that time chunk from the total time
+ *
+ * Suggest to use 60 seconds as the stop length (as the default used in the TrackWaypoint draw stops factor)
+ */
+gdouble vik_track_get_average_speed_moving (const VikTrack *tr, int stop_length_seconds)
+{
+ gdouble len = 0.0;
+ guint32 time = 0;
+ if ( tr->trackpoints )
+ {
+ GList *iter = tr->trackpoints->next;
+ while (iter)
+ {
+ if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
+ VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
+ (! VIK_TRACKPOINT(iter->data)->newsegment) )
+ {
+ if ( ( VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp ) < stop_length_seconds ) {
+ len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
+ &(VIK_TRACKPOINT(iter->prev->data)->coord) );
+
+ time += ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
+ }
+ }
+ iter = iter->next;
+ }
+ }
+ return (time == 0) ? 0 : ABS(len/time);
+}
+
gdouble vik_track_get_max_speed(const VikTrack *tr)
{
gdouble maxspeed = 0.0, speed = 0.0;
GList *iter = tr->trackpoints;
+ if (!iter || !iter->next) /* zero- or one-point track */
+ return NULL;
+
{ /* test if there's anything worth calculating */
gboolean okay = FALSE;
while ( iter )
{
- if ( VIK_TRACKPOINT(iter->data)->altitude != VIK_DEFAULT_ALTITUDE ) {
+ // Sometimes a GPS device (or indeed any random file) can have stupid numbers for elevations
+ // Since when is 9.9999e+24 a valid elevation!!
+ // This can happen when a track (with no elevations) is uploaded to a GPS device and then redownloaded (e.g. using a Garmin Legend EtrexHCx)
+ // Some protection against trying to work with crazily massive numbers (otherwise get SIGFPE, Arithmetic exception)
+ if ( VIK_TRACKPOINT(iter->data)->altitude != VIK_DEFAULT_ALTITUDE &&
+ VIK_TRACKPOINT(iter->data)->altitude < 1E9 ) {
okay = TRUE; break;
}
iter = iter->next;
return NULL;
}
-
+ iter = tr->trackpoints;
g_assert ( num_chunks < 16000 );
total_length = vik_track_get_length_including_gaps ( tr );
chunk_length = total_length / num_chunks;
+ /* Zero chunk_length (eg, track of 2 tp with the same loc) will cause crash */
+ if (chunk_length <= 0) {
+ g_free(pts);
+ return NULL;
+ }
+
current_dist = 0.0;
current_area_under_curve = 0;
current_chunk = 0;
**/
if ( ignore_it )
- pts[current_chunk] = VIK_DEFAULT_ALTITUDE;
+ // Seemly can't determine average for this section - so use last known good value (much better than just sticking in zero)
+ pts[current_chunk] = altitude1;
else
pts[current_chunk] = altitude1 + (altitude2-altitude1)*((dist_along_seg - (chunk_length/2))/current_seg_length);
/* final seg */
dist_along_seg = chunk_length - current_dist;
- if ( ignore_it || !iter->next ) {
+ if ( ignore_it || ( iter && !iter->next ) ) {
pts[current_chunk] = current_area_under_curve / current_dist;
+ if (!iter->next) {
+ int i;
+ for (i = current_chunk + 1; i < num_chunks; i++)
+ pts[i] = pts[current_chunk];
+ break;
+ }
}
else {
current_area_under_curve += dist_along_seg * (altitude1 + (altitude2 - altitude1)*dist_along_seg/current_seg_length);
*up = *down = VIK_DEFAULT_ALTITUDE;
}
-typedef struct {
- double a, b, c, d;
-} spline_coeff_t;
-
-void compute_spline(int n, double *x, double *f, spline_coeff_t *p)
+gdouble *vik_track_make_gradient_map ( const VikTrack *tr, guint16 num_chunks )
{
- double *h, *alpha, *B, *m;
- int i;
- int orig_n = n;
- double new_x[3], new_f[3];
-
- if (n==0) return;
- if (n==1) {
- new_x[0] = x[0];
- new_f[0] = f[0];
- new_x[1] = x[0]+0.00001;
- new_f[1] = f[0];
- x = new_x;
- f = new_f;
- n = 3;
- }
- if (n==2) {
- new_x[0] = x[0];
- new_f[0] = f[0];
- new_x[1] = x[1];
- new_f[1] = f[1];
- new_x[2] = x[1] + x[1]-x[0];
- new_f[2] = f[1] + f[1]-f[0];
- x = new_x;
- f = new_f;
- n = 3;
- }
-
- /* we're solving a linear system of equations of the form Ax = B.
- * The matrix a is tridiagonal and consists of coefficients in
- * the h[] and alpha[] arrays.
- */
+ gdouble *pts;
+ gdouble *altitudes;
+ gdouble total_length, chunk_length, current_gradient;
+ gdouble altitude1, altitude2;
+ guint16 current_chunk;
- h = (double *)malloc(sizeof(double) * (n-1));
- for (i=0; i<n-1; i++) {
- h[i] = x[i+1]-x[i];
- }
+ g_assert ( num_chunks < 16000 );
- alpha = (double *)malloc(sizeof(double) * (n-2));
- for (i=0; i<n-2; i++) {
- alpha[i] = 2 * (h[i] + h[i+1]);
- }
+ total_length = vik_track_get_length_including_gaps ( tr );
+ chunk_length = total_length / num_chunks;
- /* B[] is the vector on the right hand side of the equation */
- B = (double *)malloc(sizeof(double) * (n-2));
- for (i=0; i<n-2; i++) {
- B[i] = 6 * ((f[i+2] - f[i+1])/h[i+1] - (f[i+1] - f[i])/h[i]);
+ /* Zero chunk_length (eg, track of 2 tp with the same loc) will cause crash */
+ if (chunk_length <= 0) {
+ return NULL;
}
- /* Now solve the n-2 by n-2 system */
- m = (double *)malloc(sizeof(double) * (n-2));
- for (i=1; i<=n-3; i++) {
- /*
- d0 = alpha 0
- a0 = h1
- c0 = h1
-
- di = di - (ai-1 / di-1) * ci-1
- bi = bi - (ai-1 / di-1) * bi-1
- ;
- */
- alpha[i] = alpha[i] - (h[i]/alpha[i-1]) * h[i];
- B[i] = B[i] - (h[i]/alpha[i-1]) * B[i-1];
- }
- /* xn-3 = bn-3 / dn-3; */
- m[n-3] = B[n-3]/alpha[n-3];
- for (i=n-4; i>=0; i--) {
- m[i] = (B[i]-h[i+1]*m[i+1])/alpha[i];
+ altitudes = vik_track_make_elevation_map (tr, num_chunks);
+ if (altitudes == NULL) {
+ return NULL;
}
- for (i=0; i<orig_n-1; i++) {
- double mi, mi1;
- mi = (i==(n-2)) ? 0 : m[i];
- mi1 = (i==0) ? 0 : m[i-1];
+ current_gradient = 0.0;
+ pts = g_malloc ( sizeof(gdouble) * num_chunks );
+ for (current_chunk = 0; current_chunk < (num_chunks - 1); current_chunk++) {
+ altitude1 = altitudes[current_chunk];
+ altitude2 = altitudes[current_chunk + 1];
+ current_gradient = 100.0 * (altitude2 - altitude1) / chunk_length;
- p[i].a = f[i+1];
- p[i].b = (f[i+1] - f[i]) / h[i] + h[i] * (2*mi + mi1) / 6;
- p[i].c = mi/2;
- p[i].d = (mi-mi1)/(6*h[i]);
+ pts[current_chunk] = current_gradient;
}
- free(alpha);
- free(B);
- free(h);
- free(m);
+ pts[current_chunk] = current_gradient;
+
+ return pts;
}
/* by Alex Foobarian */
gdouble *vik_track_make_speed_map ( const VikTrack *tr, guint16 num_chunks )
{
gdouble *v, *s, *t;
- gdouble duration, chunk_dur, T, s_prev, s_now;
+ gdouble duration, chunk_dur;
time_t t1, t2;
- int i, pt_count, numpts, spline;
+ int i, pt_count, numpts, index;
GList *iter;
- spline_coeff_t *p;
if ( ! tr->trackpoints )
return NULL;
return NULL;
if (duration < 0) {
- fprintf(stderr, "negative duration: unsorted trackpoint timestamps?\n");
+ g_warning("negative duration: unsorted trackpoint timestamps?");
return NULL;
}
pt_count = vik_track_get_tp_count(tr);
s = g_malloc(sizeof(double) * pt_count);
t = g_malloc(sizeof(double) * pt_count);
- p = g_malloc(sizeof(spline_coeff_t) * (pt_count-1));
iter = tr->trackpoints->next;
numpts = 0;
s[0] = 0;
- t[0] = VIK_TRACKPOINT(iter->prev->data)->timestamp;
+ t[0] = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
numpts++;
while (iter) {
s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) );
iter = iter->next;
}
- compute_spline(numpts, t, s, p);
+ /* In the following computation, we iterate through periods of time of duration chunk_dur.
+ * The first period begins at the beginning of the track. The last period ends at the end of the track.
+ */
+ index = 0; /* index of the current trackpoint. */
+ for (i = 0; i < num_chunks; i++) {
+ /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur.
+ * find the first trackpoint outside the current interval, averaging the speeds between intermediate trackpoints.
+ */
+ if (t[0] + i*chunk_dur >= t[index]) {
+ gdouble acc_t = 0, acc_s = 0;
+ while (t[0] + i*chunk_dur >= t[index]) {
+ acc_s += (s[index+1]-s[index]);
+ acc_t += (t[index+1]-t[index]);
+ index++;
+ }
+ v[i] = acc_s/acc_t;
+ }
+ else if (i) {
+ v[i] = v[i-1];
+ }
+ else {
+ v[i] = 0;
+ }
+ }
+ g_free(s);
+ g_free(t);
+ return v;
+}
+
+/**
+ * Make a distance/time map, heavily based on the vik_track_make_speed_map method
+ */
+gdouble *vik_track_make_distance_map ( const VikTrack *tr, guint16 num_chunks )
+{
+ gdouble *v, *s, *t;
+ gdouble duration, chunk_dur;
+ time_t t1, t2;
+ int i, pt_count, numpts, index;
+ GList *iter;
+
+ if ( ! tr->trackpoints )
+ return NULL;
+
+ t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
+ t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
+ duration = t2 - t1;
+
+ if ( !t1 || !t2 || !duration )
+ return NULL;
+
+ if (duration < 0) {
+ g_warning("negative duration: unsorted trackpoint timestamps?");
+ return NULL;
+ }
+ pt_count = vik_track_get_tp_count(tr);
+
+ v = g_malloc ( sizeof(gdouble) * num_chunks );
+ chunk_dur = duration / num_chunks;
+
+ s = g_malloc(sizeof(double) * pt_count);
+ t = g_malloc(sizeof(double) * pt_count);
+
+ iter = tr->trackpoints->next;
+ numpts = 0;
+ s[0] = 0;
+ t[0] = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
+ numpts++;
+ while (iter) {
+ s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) );
+ t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
+ numpts++;
+ iter = iter->next;
+ }
+
+ /* In the following computation, we iterate through periods of time of duration chunk_dur.
+ * The first period begins at the beginning of the track. The last period ends at the end of the track.
+ */
+ index = 0; /* index of the current trackpoint. */
+ for (i = 0; i < num_chunks; i++) {
+ /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur.
+ * find the first trackpoint outside the current interval, averaging the distance between intermediate trackpoints.
+ */
+ if (t[0] + i*chunk_dur >= t[index]) {
+ gdouble acc_s = 0; // No need for acc_t
+ while (t[0] + i*chunk_dur >= t[index]) {
+ acc_s += (s[index+1]-s[index]);
+ index++;
+ }
+ // The only bit that's really different from the speed map - just keep an accululative record distance
+ v[i] = i ? v[i-1]+acc_s : acc_s;
+ }
+ else if (i) {
+ v[i] = v[i-1];
+ }
+ else {
+ v[i] = 0;
+ }
+ }
+ g_free(s);
+ g_free(t);
+ return v;
+}
+
+/**
+ * This uses the 'time' based method to make the graph, (which is a simpler compared to the elevation/distance)
+ * This results in a slightly blocky graph when it does not have many trackpoints: <60
+ * NB Somehow the elevation/distance applies some kind of smoothing algorithm,
+ * but I don't think any one understands it any more (I certainly don't ATM)
+ */
+gdouble *vik_track_make_elevation_time_map ( const VikTrack *tr, guint16 num_chunks )
+{
+ time_t t1, t2;
+ gdouble duration, chunk_dur;
+ GList *iter = tr->trackpoints;
+
+ if (!iter || !iter->next) /* zero- or one-point track */
+ return NULL;
+
+ /* test if there's anything worth calculating */
+ gboolean okay = FALSE;
+ while ( iter ) {
+ if ( VIK_TRACKPOINT(iter->data)->altitude != VIK_DEFAULT_ALTITUDE ) {
+ okay = TRUE;
+ break;
+ }
+ iter = iter->next;
+ }
+ if ( ! okay )
+ return NULL;
+
+ t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
+ t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
+ duration = t2 - t1;
+
+ if ( !t1 || !t2 || !duration )
+ return NULL;
+
+ if (duration < 0) {
+ g_warning("negative duration: unsorted trackpoint timestamps?");
+ return NULL;
+ }
+ gint pt_count = vik_track_get_tp_count(tr);
+
+ // Reset iterator back to the beginning
+ iter = tr->trackpoints;
+
+ gdouble *pts = g_malloc ( sizeof(gdouble) * num_chunks ); // The return altitude values
+ gdouble *s = g_malloc(sizeof(double) * pt_count); // calculation altitudes
+ gdouble *t = g_malloc(sizeof(double) * pt_count); // calculation times
+
+ chunk_dur = duration / num_chunks;
- /*
- printf("Got spline\n");
- for (i=0; i<numpts-1; i++) {
- printf("a = %15f b = %15f c = %15f d = %15f\n", p[i].a, p[i].b, p[i].c, p[i].d);
+ s[0] = VIK_TRACKPOINT(iter->data)->altitude;
+ t[0] = VIK_TRACKPOINT(iter->data)->timestamp;
+ iter = tr->trackpoints->next;
+ gint numpts = 1;
+ while (iter) {
+ s[numpts] = VIK_TRACKPOINT(iter->data)->altitude;
+ t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
+ numpts++;
+ iter = iter->next;
}
- */
- /* the spline gives us distances at chunk_dur intervals. from these,
- * we obtain average speed in each interval.
+ /* In the following computation, we iterate through periods of time of duration chunk_dur.
+ * The first period begins at the beginning of the track. The last period ends at the end of the track.
*/
- spline = 0;
- T = t[spline];
- s_prev =
- p[spline].d * pow(T - t[spline+1], 3) +
- p[spline].c * pow(T - t[spline+1], 2) +
- p[spline].b * (T - t[spline+1]) +
- p[spline].a;
- for (i = 0; i < num_chunks; i++, T+=chunk_dur) {
- while (T > t[spline+1]) {
- spline++;
- }
- s_now =
- p[spline].d * pow(T - t[spline+1], 3) +
- p[spline].c * pow(T - t[spline+1], 2) +
- p[spline].b * (T - t[spline+1]) +
- p[spline].a;
- v[i] = (s_now - s_prev) / chunk_dur;
- s_prev = s_now;
- /*
- * old method of averages
- v[i] = (s[spline+1]-s[spline])/(t[spline+1]-t[spline]);
- */
+ gint index = 0; /* index of the current trackpoint. */
+ gint i;
+ for (i = 0; i < num_chunks; i++) {
+ /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur.
+ * find the first trackpoint outside the current interval, averaging the heights between intermediate trackpoints.
+ */
+ if (t[0] + i*chunk_dur >= t[index]) {
+ gdouble acc_s = s[index]; // initialise to first point
+ while (t[0] + i*chunk_dur >= t[index]) {
+ acc_s += (s[index+1]-s[index]);
+ index++;
+ }
+ pts[i] = acc_s;
+ }
+ else if (i) {
+ pts[i] = pts[i-1];
+ }
+ else {
+ pts[i] = 0;
+ }
+ }
+ g_free(s);
+ g_free(t);
+
+ return pts;
+}
+
+/**
+ * Make a speed/distance map
+ */
+gdouble *vik_track_make_speed_dist_map ( const VikTrack *tr, guint16 num_chunks )
+{
+ gdouble *v, *s, *t;
+ time_t t1, t2;
+ gint i, pt_count, numpts, index;
+ GList *iter;
+ gdouble duration, total_length, chunk_length;
+
+ if ( ! tr->trackpoints )
+ return NULL;
+
+ t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
+ t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
+ duration = t2 - t1;
+
+ if ( !t1 || !t2 || !duration )
+ return NULL;
+
+ if (duration < 0) {
+ g_warning("negative duration: unsorted trackpoint timestamps?");
+ return NULL;
+ }
+
+ total_length = vik_track_get_length_including_gaps ( tr );
+ chunk_length = total_length / num_chunks;
+ pt_count = vik_track_get_tp_count(tr);
+
+ if (chunk_length <= 0) {
+ return NULL;
+ }
+
+ v = g_malloc ( sizeof(gdouble) * num_chunks );
+ s = g_malloc ( sizeof(double) * pt_count );
+ t = g_malloc ( sizeof(double) * pt_count );
+
+ // No special handling of segments ATM...
+ iter = tr->trackpoints->next;
+ numpts = 0;
+ s[0] = 0;
+ t[0] = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
+ numpts++;
+ while (iter) {
+ s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) );
+ t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
+ numpts++;
+ iter = iter->next;
+ }
+
+ // Iterate through a portion of the track to get an average speed for that part
+ // This will essentially interpolate between segments, which I think is right given the usage of 'get_length_including_gaps'
+ index = 0; /* index of the current trackpoint. */
+ for (i = 0; i < num_chunks; i++) {
+ // Similar to the make_speed_map, but instead of using a time chunk, use a distance chunk
+ if (s[0] + i*chunk_length >= s[index]) {
+ gdouble acc_t = 0, acc_s = 0;
+ while (s[0] + i*chunk_length >= s[index]) {
+ acc_s += (s[index+1]-s[index]);
+ acc_t += (t[index+1]-t[index]);
+ index++;
+ }
+ v[i] = acc_s/acc_t;
+ }
+ else if (i) {
+ v[i] = v[i-1];
+ }
+ else {
+ v[i] = 0;
+ }
}
g_free(s);
g_free(t);
- g_free(p);
return v;
}
/* by Alex Foobarian */
-VikCoord *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist )
+VikTrackpoint *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist, gdouble *meters_from_start )
{
gdouble dist = vik_track_get_length_including_gaps(tr) * reldist;
gdouble current_dist = 0.0;
gdouble current_inc = 0.0;
- VikCoord *rv;
if ( tr->trackpoints )
{
GList *iter = tr->trackpoints->next;
+ GList *last_iter = NULL;
+ gdouble last_dist = 0.0;
while (iter)
{
current_inc = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
&(VIK_TRACKPOINT(iter->prev->data)->coord) );
+ last_dist = current_dist;
current_dist += current_inc;
if ( current_dist >= dist )
break;
+ last_iter = iter;
iter = iter->next;
}
+ if (!iter) { /* passing the end the track */
+ if (last_iter) {
+ if (meters_from_start)
+ *meters_from_start = last_dist;
+ return(VIK_TRACKPOINT(last_iter->data));
+ }
+ else
+ return NULL;
+ }
/* we've gone past the dist already, was prev trackpoint closer? */
/* should do a vik_coord_average_weighted() thingy. */
- if ( iter->prev && abs(current_dist-current_inc-dist) < abs(current_dist-dist) )
+ if ( iter->prev && abs(current_dist-current_inc-dist) < abs(current_dist-dist) ) {
+ if (meters_from_start)
+ *meters_from_start = last_dist;
iter = iter->prev;
+ }
+ else
+ if (meters_from_start)
+ *meters_from_start = current_dist;
+
+ return VIK_TRACKPOINT(iter->data);
+
+ }
+ return NULL;
+}
+
+VikTrackpoint *vik_track_get_closest_tp_by_percentage_time ( VikTrack *tr, gdouble reltime, time_t *seconds_from_start )
+{
+ time_t t_pos, t_start, t_end, t_total;
+ t_start = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
+ t_end = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
+ t_total = t_end - t_start;
+
+ t_pos = t_start + t_total * reltime;
+
+ if ( !tr->trackpoints )
+ return NULL;
+
+ GList *iter = tr->trackpoints;
+
+ while (iter) {
+ if (VIK_TRACKPOINT(iter->data)->timestamp == t_pos)
+ break;
+ if (VIK_TRACKPOINT(iter->data)->timestamp > t_pos) {
+ if (iter->prev == NULL) /* first trackpoint */
+ break;
+ time_t t_before = t_pos - VIK_TRACKPOINT(iter->prev)->timestamp;
+ time_t t_after = VIK_TRACKPOINT(iter->data)->timestamp - t_pos;
+ if (t_before <= t_after)
+ iter = iter->prev;
+ break;
+ }
+ else if ((iter->next == NULL) && (t_pos < (VIK_TRACKPOINT(iter->data)->timestamp + 3))) /* last trackpoint: accommodate for round-off */
+ break;
+ iter = iter->next;
+ }
+ if (!iter)
+ return NULL;
+ if (seconds_from_start)
+ *seconds_from_start = VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
+ return VIK_TRACKPOINT(iter->data);
+}
+VikTrackpoint* vik_track_get_tp_by_max_speed ( const VikTrack *tr )
+{
+ gdouble maxspeed = 0.0, speed = 0.0;
- rv = g_malloc(sizeof(VikCoord));
- *rv = VIK_TRACKPOINT(iter->data)->coord;
+ if ( !tr->trackpoints )
+ return NULL;
- return rv;
+ GList *iter = tr->trackpoints;
+ VikTrackpoint *max_speed_tp = NULL;
+ while (iter) {
+ if (iter->prev) {
+ if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
+ VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
+ (! VIK_TRACKPOINT(iter->data)->newsegment) ) {
+ speed = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), &(VIK_TRACKPOINT(iter->prev->data)->coord) )
+ / ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
+ if ( speed > maxspeed ) {
+ maxspeed = speed;
+ max_speed_tp = VIK_TRACKPOINT(iter->data);
+ }
+ }
+ }
+ iter = iter->next;
}
- return NULL;
+
+ if (!max_speed_tp)
+ return NULL;
+
+ return max_speed_tp;
+}
+
+VikTrackpoint* vik_track_get_tp_by_max_alt ( const VikTrack *tr )
+{
+ gdouble maxalt = -5000.0;
+ if ( !tr->trackpoints )
+ return NULL;
+
+ GList *iter = tr->trackpoints;
+ VikTrackpoint *max_alt_tp = NULL;
+
+ while (iter) {
+ if ( VIK_TRACKPOINT(iter->data)->altitude > maxalt ) {
+ maxalt = VIK_TRACKPOINT(iter->data)->altitude;
+ max_alt_tp = VIK_TRACKPOINT(iter->data);
+ }
+ iter = iter->next;
+ }
+
+ if (!max_alt_tp)
+ return NULL;
+
+ return max_alt_tp;
+}
+
+VikTrackpoint* vik_track_get_tp_by_min_alt ( const VikTrack *tr )
+{
+ gdouble minalt = 25000.0;
+ if ( !tr->trackpoints )
+ return NULL;
+
+ GList *iter = tr->trackpoints;
+ VikTrackpoint *min_alt_tp = NULL;
+
+ while (iter) {
+ if ( VIK_TRACKPOINT(iter->data)->altitude < minalt ) {
+ minalt = VIK_TRACKPOINT(iter->data)->altitude;
+ min_alt_tp = VIK_TRACKPOINT(iter->data);
+ }
+ iter = iter->next;
+ }
+
+ if (!min_alt_tp)
+ return NULL;
+
+ return min_alt_tp;
}
gboolean vik_track_get_minmax_alt ( const VikTrack *tr, gdouble *min_alt, gdouble *max_alt )
}
*(guint *)(b->data + intp) = ntp;
- len = (tr->comment) ? strlen(tr->comment)+1 : 0;
- g_byte_array_append(b, (guint8 *)&len, sizeof(len));
- if (tr->comment) g_byte_array_append(b, (guint8 *)tr->comment, len);
+ // This allocates space for variant sized strings
+ // and copies that amount of data from the track to byte array
+#define vtm_append(s) \
+ len = (s) ? strlen(s)+1 : 0; \
+ g_byte_array_append(b, (guint8 *)&len, sizeof(len)); \
+ if (s) g_byte_array_append(b, (guint8 *)s, len);
+
+ vtm_append(tr->name);
+ vtm_append(tr->comment);
+ vtm_append(tr->description);
*data = b->data;
*datalen = b->len;
g_byte_array_free(b, FALSE);
}
+/*
+ * Take a byte array and convert it into a Track
+ */
VikTrack *vik_track_unmarshall (guint8 *data, guint datalen)
{
guint len;
new_tr->trackpoints = g_list_append(new_tr->trackpoints, new_tp);
}
- len = *(guint *)data;
- data += sizeof(len);
- if (len) {
- new_tr->comment = g_strdup((gchar *)data);
- }
+#define vtu_get(s) \
+ len = *(guint *)data; \
+ data += sizeof(len); \
+ if (len) { \
+ (s) = g_strdup((gchar *)data); \
+ } else { \
+ (s) = NULL; \
+ } \
+ data += len;
+
+ vtu_get(new_tr->name);
+ vtu_get(new_tr->comment);
+ vtu_get(new_tr->description);
+
return new_tr;
}
+void vik_track_apply_dem_data ( VikTrack *tr )
+{
+ GList *tp_iter;
+ gint16 elev;
+ tp_iter = tr->trackpoints;
+ while ( tp_iter ) {
+ /* TODO: of the 4 possible choices we have for choosing an elevation
+ * (trackpoint in between samples), choose the one with the least elevation change
+ * as the last */
+ elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(tp_iter->data)->coord), VIK_DEM_INTERPOL_BEST );
+ if ( elev != VIK_DEM_INVALID_ELEVATION )
+ VIK_TRACKPOINT(tp_iter->data)->altitude = elev;
+ tp_iter = tp_iter->next;
+ }
+}
+
+/*
+ * Apply DEM data (if available) - to only the last trackpoint
+ */
+void vik_track_apply_dem_data_last_trackpoint ( VikTrack *tr )
+{
+ gint16 elev;
+ if ( tr->trackpoints ) {
+ /* As in vik_track_apply_dem_data above - use 'best' interpolation method */
+ elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->coord), VIK_DEM_INTERPOL_BEST );
+ if ( elev != VIK_DEM_INVALID_ELEVATION )
+ VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->altitude = elev;
+ }
+}
+
+/* appends t2 to t1, leaving t2 with no trackpoints */
+void vik_track_steal_and_append_trackpoints ( VikTrack *t1, VikTrack *t2 )
+{
+ if ( t1->trackpoints ) {
+ GList *tpiter = t1->trackpoints;
+ while ( tpiter->next )
+ tpiter = tpiter->next;
+ tpiter->next = t2->trackpoints;
+ t2->trackpoints->prev = tpiter;
+ } else
+ t1->trackpoints = t2->trackpoints;
+ t2->trackpoints = NULL;
+}
+
+/* starting at the end, looks backwards for the last "double point", a duplicate trackpoint.
+ * If there is no double point, deletes all the trackpoints.
+ * Returns the new end of the track (or the start if there are no double points)
+ */
+VikCoord *vik_track_cut_back_to_double_point ( VikTrack *tr )
+{
+ GList *iter = tr->trackpoints;
+ VikCoord *rv;
+
+ if ( !iter )
+ return NULL;
+ while ( iter->next )
+ iter = iter->next;
+
+
+ while ( iter->prev ) {
+ if ( vik_coord_equals((VikCoord *)iter->data, (VikCoord *)iter->prev->data) ) {
+ GList *prev = iter->prev;
+
+ rv = g_malloc(sizeof(VikCoord));
+ *rv = *((VikCoord *) iter->data);
+
+ /* truncate trackpoint list */
+ iter->prev = NULL; /* pretend it's the end */
+ g_list_foreach ( iter, (GFunc) g_free, NULL );
+ g_list_free( iter );
+
+ prev->next = NULL;
+
+ return rv;
+ }
+ iter = iter->prev;
+ }
+
+ /* no double point found! */
+ rv = g_malloc(sizeof(VikCoord));
+ *rv = *((VikCoord *) tr->trackpoints->data);
+ g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL );
+ g_list_free( tr->trackpoints );
+ tr->trackpoints = NULL;
+ return rv;
+}
+
projects / andy / viking.git / blobdiff