+
+ 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;
+ 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;
+ }
+
+ compute_spline(numpts, t, s, p);
+
+ /*
+ 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);
+ }
+ */
+
+ /* the spline gives us distances at chunk_dur intervals. from these,
+ * we obtain average speed in each interval.
+ */
+ 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]);
+ */
+ }
+ g_free(s);
+ g_free(t);
+ g_free(p);
+ return v;
+}
+
+/* by Alex Foobarian */
+VikTrackpoint *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist )
+{
+ gdouble dist = vik_track_get_length_including_gaps(tr) * reldist;
+ gdouble current_dist = 0.0;
+ gdouble current_inc = 0.0;
+ if ( tr->trackpoints )
+ {
+ GList *iter = tr->trackpoints->next;
+ GList *last_iter = NULL;
+ while (iter)
+ {
+ current_inc = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
+ &(VIK_TRACKPOINT(iter->prev->data)->coord) );
+ current_dist += current_inc;
+ if ( current_dist >= dist )
+ break;
+ last_iter = iter;