]>
Commit | Line | Data |
---|---|---|
50a14534 EB |
1 | /* |
2 | * viking -- GPS Data and Topo Analyzer, Explorer, and Manager | |
3 | * | |
4 | * Copyright (C) 2003-2005, Evan Battaglia <gtoevan@gmx.net> | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or modify | |
7 | * it under the terms of the GNU General Public License as published by | |
8 | * the Free Software Foundation; either version 2 of the License, or | |
9 | * (at your option) any later version. | |
10 | * | |
11 | * This program is distributed in the hope that it will be useful, | |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | * GNU General Public License for more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License | |
17 | * along with this program; if not, write to the Free Software | |
18 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
19 | * | |
20 | */ | |
21 | ||
22 | #include <glib.h> | |
23 | #include <time.h> | |
9903c388 | 24 | #include <stdio.h> |
bf35388d | 25 | #include <stdlib.h> |
ddc47a46 | 26 | #include <string.h> |
bf35388d | 27 | #include <math.h> |
50a14534 EB |
28 | #include "coords.h" |
29 | #include "vikcoord.h" | |
30 | #include "viktrack.h" | |
31 | #include "globals.h" | |
ad0a8c2d | 32 | #include "dems.h" |
50a14534 EB |
33 | |
34 | VikTrack *vik_track_new() | |
35 | { | |
8c4f1350 | 36 | VikTrack *tr = g_malloc0 ( sizeof ( VikTrack ) ); |
50a14534 EB |
37 | tr->ref_count = 1; |
38 | return tr; | |
39 | } | |
40 | ||
41 | void vik_track_set_comment_no_copy(VikTrack *tr, gchar *comment) | |
42 | { | |
43 | if ( tr->comment ) | |
44 | g_free ( tr->comment ); | |
45 | tr->comment = comment; | |
46 | } | |
47 | ||
48 | ||
49 | void vik_track_set_comment(VikTrack *tr, const gchar *comment) | |
50 | { | |
51 | if ( tr->comment ) | |
52 | g_free ( tr->comment ); | |
53 | ||
54 | if ( comment && comment[0] != '\0' ) | |
55 | tr->comment = g_strdup(comment); | |
56 | else | |
57 | tr->comment = NULL; | |
58 | } | |
59 | ||
60 | void vik_track_ref(VikTrack *tr) | |
61 | { | |
62 | tr->ref_count++; | |
63 | } | |
64 | ||
21700912 QT |
65 | void vik_track_set_property_dialog(VikTrack *tr, GtkWidget *dialog) |
66 | { | |
67 | /* Warning: does not check for existing dialog */ | |
68 | tr->property_dialog = dialog; | |
69 | } | |
70 | ||
71 | void vik_track_clear_property_dialog(VikTrack *tr) | |
72 | { | |
73 | tr->property_dialog = NULL; | |
74 | } | |
75 | ||
50a14534 EB |
76 | void vik_track_free(VikTrack *tr) |
77 | { | |
78 | if ( tr->ref_count-- > 1 ) | |
79 | return; | |
80 | ||
81 | if ( tr->comment ) | |
82 | g_free ( tr->comment ); | |
83 | g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL ); | |
84 | g_list_free( tr->trackpoints ); | |
21700912 QT |
85 | if (tr->property_dialog) |
86 | gtk_widget_destroy ( GTK_WIDGET(tr->property_dialog) ); | |
50a14534 EB |
87 | g_free ( tr ); |
88 | } | |
89 | ||
90 | VikTrack *vik_track_copy ( const VikTrack *tr ) | |
91 | { | |
92 | VikTrack *new_tr = vik_track_new(); | |
93 | VikTrackpoint *new_tp; | |
94 | GList *tp_iter = tr->trackpoints; | |
95 | new_tr->visible = tr->visible; | |
96 | new_tr->trackpoints = NULL; | |
97 | while ( tp_iter ) | |
98 | { | |
99 | new_tp = g_malloc ( sizeof ( VikTrackpoint ) ); | |
100 | *new_tp = *((VikTrackpoint *)(tp_iter->data)); | |
101 | new_tr->trackpoints = g_list_append ( new_tr->trackpoints, new_tp ); | |
102 | tp_iter = tp_iter->next; | |
103 | } | |
104 | vik_track_set_comment(new_tr,tr->comment); | |
105 | return new_tr; | |
106 | } | |
107 | ||
108 | VikTrackpoint *vik_trackpoint_new() | |
109 | { | |
a2817d3c QT |
110 | VikTrackpoint *tp = g_malloc0(sizeof(VikTrackpoint)); |
111 | tp->extended = FALSE; | |
112 | tp->speed = NAN; | |
113 | tp->course = NAN; | |
114 | return tp; | |
50a14534 EB |
115 | } |
116 | ||
117 | void vik_trackpoint_free(VikTrackpoint *tp) | |
118 | { | |
119 | g_free(tp); | |
120 | } | |
121 | ||
122 | VikTrackpoint *vik_trackpoint_copy(VikTrackpoint *tp) | |
123 | { | |
124 | VikTrackpoint *rv = vik_trackpoint_new(); | |
125 | *rv = *tp; | |
126 | return rv; | |
127 | } | |
128 | ||
129 | gdouble vik_track_get_length(const VikTrack *tr) | |
130 | { | |
131 | gdouble len = 0.0; | |
132 | if ( tr->trackpoints ) | |
133 | { | |
134 | GList *iter = tr->trackpoints->next; | |
135 | while (iter) | |
136 | { | |
137 | if ( ! VIK_TRACKPOINT(iter->data)->newsegment ) | |
138 | len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
139 | &(VIK_TRACKPOINT(iter->prev->data)->coord) ); | |
140 | iter = iter->next; | |
141 | } | |
142 | } | |
143 | return len; | |
144 | } | |
145 | ||
146 | gdouble vik_track_get_length_including_gaps(const VikTrack *tr) | |
147 | { | |
148 | gdouble len = 0.0; | |
149 | if ( tr->trackpoints ) | |
150 | { | |
151 | GList *iter = tr->trackpoints->next; | |
152 | while (iter) | |
153 | { | |
154 | len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
155 | &(VIK_TRACKPOINT(iter->prev->data)->coord) ); | |
156 | iter = iter->next; | |
157 | } | |
158 | } | |
159 | return len; | |
160 | } | |
161 | ||
162 | gulong vik_track_get_tp_count(const VikTrack *tr) | |
163 | { | |
164 | gulong num = 0; | |
165 | GList *iter = tr->trackpoints; | |
166 | while ( iter ) | |
167 | { | |
168 | num++; | |
169 | iter = iter->next; | |
170 | } | |
171 | return num; | |
172 | } | |
173 | ||
174 | gulong vik_track_get_dup_point_count ( const VikTrack *tr ) | |
175 | { | |
176 | gulong num = 0; | |
177 | GList *iter = tr->trackpoints; | |
178 | while ( iter ) | |
179 | { | |
180 | if ( iter->next && vik_coord_equals ( &(VIK_TRACKPOINT(iter->data)->coord), | |
181 | &(VIK_TRACKPOINT(iter->next->data)->coord) ) ) | |
182 | num++; | |
183 | iter = iter->next; | |
184 | } | |
185 | return num; | |
186 | } | |
187 | ||
188 | void vik_track_remove_dup_points ( VikTrack *tr ) | |
189 | { | |
190 | GList *iter = tr->trackpoints; | |
191 | while ( iter ) | |
192 | { | |
193 | if ( iter->next && vik_coord_equals ( &(VIK_TRACKPOINT(iter->data)->coord), | |
194 | &(VIK_TRACKPOINT(iter->next->data)->coord) ) ) | |
195 | { | |
196 | g_free ( iter->next->data ); | |
197 | tr->trackpoints = g_list_delete_link ( tr->trackpoints, iter->next ); | |
198 | } | |
199 | else | |
200 | iter = iter->next; | |
201 | } | |
202 | } | |
203 | ||
204 | guint vik_track_get_segment_count(const VikTrack *tr) | |
205 | { | |
206 | guint num = 1; | |
207 | GList *iter = tr->trackpoints; | |
208 | if ( !iter ) | |
209 | return 0; | |
210 | while ( (iter = iter->next) ) | |
211 | { | |
212 | if ( VIK_TRACKPOINT(iter->data)->newsegment ) | |
213 | num++; | |
214 | } | |
215 | return num; | |
216 | } | |
217 | ||
218 | VikTrack **vik_track_split_into_segments(VikTrack *t, guint *ret_len) | |
219 | { | |
220 | VikTrack **rv; | |
221 | VikTrack *tr; | |
222 | guint i; | |
223 | guint segs = vik_track_get_segment_count(t); | |
224 | GList *iter; | |
225 | ||
226 | if ( segs < 2 ) | |
227 | { | |
228 | *ret_len = 0; | |
229 | return NULL; | |
230 | } | |
231 | ||
232 | rv = g_malloc ( segs * sizeof(VikTrack *) ); | |
233 | tr = vik_track_copy ( t ); | |
234 | rv[0] = tr; | |
235 | iter = tr->trackpoints; | |
236 | ||
237 | i = 1; | |
238 | while ( (iter = iter->next) ) | |
239 | { | |
240 | if ( VIK_TRACKPOINT(iter->data)->newsegment ) | |
241 | { | |
242 | iter->prev->next = NULL; | |
243 | iter->prev = NULL; | |
244 | rv[i] = vik_track_new(); | |
245 | if ( tr->comment ) | |
246 | vik_track_set_comment ( rv[i], tr->comment ); | |
247 | rv[i]->visible = tr->visible; | |
248 | rv[i]->trackpoints = iter; | |
249 | i++; | |
250 | } | |
251 | } | |
252 | *ret_len = segs; | |
253 | return rv; | |
254 | } | |
255 | ||
256 | void vik_track_reverse ( VikTrack *tr ) | |
257 | { | |
258 | GList *iter; | |
259 | tr->trackpoints = g_list_reverse(tr->trackpoints); | |
260 | ||
261 | /* fix 'newsegment' */ | |
262 | iter = g_list_last ( tr->trackpoints ); | |
263 | while ( iter ) | |
264 | { | |
265 | if ( ! iter->next ) /* last segment, was first, cancel newsegment. */ | |
266 | VIK_TRACKPOINT(iter->data)->newsegment = FALSE; | |
267 | if ( ! iter->prev ) /* first segment by convention has newsegment flag. */ | |
268 | VIK_TRACKPOINT(iter->data)->newsegment = TRUE; | |
269 | else if ( VIK_TRACKPOINT(iter->data)->newsegment && iter->next ) | |
270 | { | |
271 | VIK_TRACKPOINT(iter->next->data)->newsegment = TRUE; | |
272 | VIK_TRACKPOINT(iter->data)->newsegment = FALSE; | |
273 | } | |
274 | iter = iter->prev; | |
275 | } | |
276 | } | |
277 | ||
278 | gdouble vik_track_get_average_speed(const VikTrack *tr) | |
279 | { | |
280 | gdouble len = 0.0; | |
281 | guint32 time = 0; | |
282 | if ( tr->trackpoints ) | |
283 | { | |
284 | GList *iter = tr->trackpoints->next; | |
285 | while (iter) | |
286 | { | |
287 | if ( VIK_TRACKPOINT(iter->data)->has_timestamp && | |
288 | VIK_TRACKPOINT(iter->prev->data)->has_timestamp && | |
289 | (! VIK_TRACKPOINT(iter->data)->newsegment) ) | |
290 | { | |
291 | len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
292 | &(VIK_TRACKPOINT(iter->prev->data)->coord) ); | |
293 | time += ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp); | |
294 | } | |
295 | iter = iter->next; | |
296 | } | |
297 | } | |
298 | return (time == 0) ? 0 : ABS(len/time); | |
299 | } | |
300 | ||
301 | gdouble vik_track_get_max_speed(const VikTrack *tr) | |
302 | { | |
303 | gdouble maxspeed = 0.0, speed = 0.0; | |
304 | if ( tr->trackpoints ) | |
305 | { | |
306 | GList *iter = tr->trackpoints->next; | |
307 | while (iter) | |
308 | { | |
309 | if ( VIK_TRACKPOINT(iter->data)->has_timestamp && | |
310 | VIK_TRACKPOINT(iter->prev->data)->has_timestamp && | |
311 | (! VIK_TRACKPOINT(iter->data)->newsegment) ) | |
312 | { | |
313 | speed = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), &(VIK_TRACKPOINT(iter->prev->data)->coord) ) | |
314 | / ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp); | |
315 | if ( speed > maxspeed ) | |
316 | maxspeed = speed; | |
317 | } | |
318 | iter = iter->next; | |
319 | } | |
320 | } | |
321 | return maxspeed; | |
322 | } | |
323 | ||
324 | void vik_track_convert ( VikTrack *tr, VikCoordMode dest_mode ) | |
325 | { | |
326 | GList *iter = tr->trackpoints; | |
327 | while (iter) | |
328 | { | |
329 | vik_coord_convert ( &(VIK_TRACKPOINT(iter->data)->coord), dest_mode ); | |
330 | iter = iter->next; | |
331 | } | |
332 | } | |
333 | ||
334 | /* I understood this when I wrote it ... maybe ... Basically it eats up the | |
335 | * proper amounts of length on the track and averages elevation over that. */ | |
336 | gdouble *vik_track_make_elevation_map ( const VikTrack *tr, guint16 num_chunks ) | |
337 | { | |
338 | gdouble *pts; | |
339 | gdouble total_length, chunk_length, current_dist, current_area_under_curve, current_seg_length, dist_along_seg = 0.0; | |
340 | gdouble altitude1, altitude2; | |
341 | guint16 current_chunk; | |
342 | gboolean ignore_it = FALSE; | |
343 | ||
344 | GList *iter = tr->trackpoints; | |
345 | ||
c3deba01 | 346 | if (!iter || !iter->next) /* zero- or one-point track */ |
4b31042b QT |
347 | return NULL; |
348 | ||
c79f0206 EB |
349 | { /* test if there's anything worth calculating */ |
350 | gboolean okay = FALSE; | |
351 | while ( iter ) | |
352 | { | |
353 | if ( VIK_TRACKPOINT(iter->data)->altitude != VIK_DEFAULT_ALTITUDE ) { | |
354 | okay = TRUE; break; | |
355 | } | |
356 | iter = iter->next; | |
357 | } | |
358 | if ( ! okay ) | |
359 | return NULL; | |
360 | } | |
361 | ||
0f941532 | 362 | iter = tr->trackpoints; |
c79f0206 | 363 | |
50a14534 EB |
364 | g_assert ( num_chunks < 16000 ); |
365 | ||
366 | pts = g_malloc ( sizeof(gdouble) * num_chunks ); | |
367 | ||
368 | total_length = vik_track_get_length_including_gaps ( tr ); | |
369 | chunk_length = total_length / num_chunks; | |
370 | ||
371 | current_dist = 0.0; | |
372 | current_area_under_curve = 0; | |
373 | current_chunk = 0; | |
374 | current_seg_length = 0; | |
375 | ||
376 | current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
377 | &(VIK_TRACKPOINT(iter->next->data)->coord) ); | |
378 | altitude1 = VIK_TRACKPOINT(iter->data)->altitude; | |
379 | altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude; | |
380 | dist_along_seg = 0; | |
381 | ||
382 | while ( current_chunk < num_chunks ) { | |
383 | ||
384 | /* go along current seg */ | |
385 | if ( current_seg_length && (current_seg_length - dist_along_seg) > chunk_length ) { | |
386 | dist_along_seg += chunk_length; | |
387 | ||
388 | /* / | |
389 | * pt2 * | |
390 | * /x altitude = alt_at_pt_1 + alt_at_pt_2 / 2 = altitude1 + slope * dist_value_of_pt_inbetween_pt1_and_pt2 | |
391 | * /xx avg altitude = area under curve / chunk len | |
392 | *pt1 *xxx avg altitude = altitude1 + (altitude2-altitude1)/(current_seg_length)*(dist_along_seg + (chunk_len/2)) | |
393 | * / xxx | |
394 | * / xxx | |
395 | **/ | |
396 | ||
397 | if ( ignore_it ) | |
398 | pts[current_chunk] = VIK_DEFAULT_ALTITUDE; | |
399 | else | |
9903c388 | 400 | pts[current_chunk] = altitude1 + (altitude2-altitude1)*((dist_along_seg - (chunk_length/2))/current_seg_length); |
50a14534 EB |
401 | |
402 | current_chunk++; | |
403 | } else { | |
404 | /* finish current seg */ | |
405 | if ( current_seg_length ) { | |
406 | gdouble altitude_at_dist_along_seg = altitude1 + (altitude2-altitude1)/(current_seg_length)*dist_along_seg; | |
407 | current_dist = current_seg_length - dist_along_seg; | |
408 | current_area_under_curve = current_dist*(altitude_at_dist_along_seg + altitude2)*0.5; | |
409 | } else { current_dist = current_area_under_curve = 0; } /* should only happen if first current_seg_length == 0 */ | |
410 | ||
411 | /* get intervening segs */ | |
412 | iter = iter->next; | |
413 | while ( iter && iter->next ) { | |
414 | current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
415 | &(VIK_TRACKPOINT(iter->next->data)->coord) ); | |
416 | altitude1 = VIK_TRACKPOINT(iter->data)->altitude; | |
417 | altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude; | |
418 | ignore_it = VIK_TRACKPOINT(iter->next->data)->newsegment; | |
419 | ||
420 | if ( chunk_length - current_dist >= current_seg_length ) { | |
421 | current_dist += current_seg_length; | |
422 | current_area_under_curve += current_seg_length * (altitude1+altitude2) * 0.5; | |
423 | iter = iter->next; | |
424 | } else { | |
425 | break; | |
426 | } | |
427 | } | |
428 | ||
429 | /* final seg */ | |
430 | dist_along_seg = chunk_length - current_dist; | |
9903c388 | 431 | if ( ignore_it || !iter->next ) { |
50a14534 | 432 | pts[current_chunk] = current_area_under_curve / current_dist; |
9903c388 | 433 | } |
50a14534 EB |
434 | else { |
435 | current_area_under_curve += dist_along_seg * (altitude1 + (altitude2 - altitude1)*dist_along_seg/current_seg_length); | |
436 | pts[current_chunk] = current_area_under_curve / chunk_length; | |
437 | } | |
438 | ||
439 | current_dist = 0; | |
440 | current_chunk++; | |
441 | } | |
442 | } | |
443 | ||
444 | return pts; | |
445 | } | |
446 | ||
447 | ||
448 | void vik_track_get_total_elevation_gain(const VikTrack *tr, gdouble *up, gdouble *down) | |
449 | { | |
450 | gdouble diff; | |
451 | *up = *down = 0; | |
8c4f1350 | 452 | if ( tr->trackpoints && VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE ) |
50a14534 EB |
453 | { |
454 | GList *iter = tr->trackpoints->next; | |
455 | while (iter) | |
456 | { | |
457 | diff = VIK_TRACKPOINT(iter->data)->altitude - VIK_TRACKPOINT(iter->prev->data)->altitude; | |
458 | if ( diff > 0 ) | |
459 | *up += diff; | |
460 | else | |
461 | *down -= diff; | |
462 | iter = iter->next; | |
463 | } | |
bf35388d EB |
464 | } else |
465 | *up = *down = VIK_DEFAULT_ALTITUDE; | |
466 | } | |
467 | ||
468 | typedef struct { | |
469 | double a, b, c, d; | |
470 | } spline_coeff_t; | |
471 | ||
472 | void compute_spline(int n, double *x, double *f, spline_coeff_t *p) | |
473 | { | |
474 | double *h, *alpha, *B, *m; | |
475 | int i; | |
ef4c2671 AF |
476 | int orig_n = n; |
477 | double new_x[3], new_f[3]; | |
478 | ||
479 | if (n==0) return; | |
480 | if (n==1) { | |
481 | new_x[0] = x[0]; | |
482 | new_f[0] = f[0]; | |
483 | new_x[1] = x[0]+0.00001; | |
484 | new_f[1] = f[0]; | |
485 | x = new_x; | |
486 | f = new_f; | |
487 | n = 3; | |
488 | } | |
489 | if (n==2) { | |
490 | new_x[0] = x[0]; | |
491 | new_f[0] = f[0]; | |
492 | new_x[1] = x[1]; | |
493 | new_f[1] = f[1]; | |
494 | new_x[2] = x[1] + x[1]-x[0]; | |
495 | new_f[2] = f[1] + f[1]-f[0]; | |
496 | x = new_x; | |
497 | f = new_f; | |
498 | n = 3; | |
499 | } | |
bf35388d EB |
500 | |
501 | /* we're solving a linear system of equations of the form Ax = B. | |
502 | * The matrix a is tridiagonal and consists of coefficients in | |
503 | * the h[] and alpha[] arrays. | |
504 | */ | |
505 | ||
506 | h = (double *)malloc(sizeof(double) * (n-1)); | |
507 | for (i=0; i<n-1; i++) { | |
508 | h[i] = x[i+1]-x[i]; | |
509 | } | |
510 | ||
511 | alpha = (double *)malloc(sizeof(double) * (n-2)); | |
512 | for (i=0; i<n-2; i++) { | |
513 | alpha[i] = 2 * (h[i] + h[i+1]); | |
50a14534 | 514 | } |
bf35388d EB |
515 | |
516 | /* B[] is the vector on the right hand side of the equation */ | |
517 | B = (double *)malloc(sizeof(double) * (n-2)); | |
518 | for (i=0; i<n-2; i++) { | |
519 | B[i] = 6 * ((f[i+2] - f[i+1])/h[i+1] - (f[i+1] - f[i])/h[i]); | |
520 | } | |
521 | ||
522 | /* Now solve the n-2 by n-2 system */ | |
523 | m = (double *)malloc(sizeof(double) * (n-2)); | |
524 | for (i=1; i<=n-3; i++) { | |
525 | /* | |
526 | d0 = alpha 0 | |
527 | a0 = h1 | |
528 | c0 = h1 | |
529 | ||
530 | di = di - (ai-1 / di-1) * ci-1 | |
531 | bi = bi - (ai-1 / di-1) * bi-1 | |
532 | ; | |
533 | */ | |
534 | alpha[i] = alpha[i] - (h[i]/alpha[i-1]) * h[i]; | |
535 | B[i] = B[i] - (h[i]/alpha[i-1]) * B[i-1]; | |
536 | } | |
537 | /* xn-3 = bn-3 / dn-3; */ | |
538 | m[n-3] = B[n-3]/alpha[n-3]; | |
539 | for (i=n-4; i>=0; i--) { | |
540 | m[i] = (B[i]-h[i+1]*m[i+1])/alpha[i]; | |
541 | } | |
542 | ||
ef4c2671 | 543 | for (i=0; i<orig_n-1; i++) { |
bf35388d EB |
544 | double mi, mi1; |
545 | mi = (i==(n-2)) ? 0 : m[i]; | |
546 | mi1 = (i==0) ? 0 : m[i-1]; | |
547 | ||
548 | p[i].a = f[i+1]; | |
549 | p[i].b = (f[i+1] - f[i]) / h[i] + h[i] * (2*mi + mi1) / 6; | |
550 | p[i].c = mi/2; | |
551 | p[i].d = (mi-mi1)/(6*h[i]); | |
552 | } | |
553 | ||
554 | free(alpha); | |
555 | free(B); | |
556 | free(h); | |
557 | free(m); | |
50a14534 | 558 | } |
25e44eac | 559 | |
bf35388d | 560 | /* by Alex Foobarian */ |
25e44eac AF |
561 | gdouble *vik_track_make_speed_map ( const VikTrack *tr, guint16 num_chunks ) |
562 | { | |
bf35388d EB |
563 | gdouble *v, *s, *t; |
564 | gdouble duration, chunk_dur, T, s_prev, s_now; | |
25e44eac | 565 | time_t t1, t2; |
bf35388d EB |
566 | int i, pt_count, numpts, spline; |
567 | GList *iter; | |
568 | spline_coeff_t *p; | |
25e44eac | 569 | |
24d5c7e2 EB |
570 | if ( ! tr->trackpoints ) |
571 | return NULL; | |
25e44eac | 572 | |
24d5c7e2 | 573 | g_assert ( num_chunks < 16000 ); |
25e44eac | 574 | |
68fb2913 | 575 | #ifdef XXXXXXXXXXXXXXXXXX |
7432fddf AF |
576 | iter = tr->trackpoints; |
577 | while (iter) { | |
578 | ||
579 | } | |
68fb2913 | 580 | #endif /*XXXXXXXXXXXXXXXXXX*/ |
7432fddf | 581 | |
25e44eac AF |
582 | t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp; |
583 | t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp; | |
584 | duration = t2 - t1; | |
c79f0206 EB |
585 | |
586 | if ( !t1 || !t2 || !duration ) | |
587 | return NULL; | |
588 | ||
25e44eac | 589 | if (duration < 0) { |
7742da66 | 590 | g_warning("negative duration: unsorted trackpoint timestamps?\n"); |
25e44eac AF |
591 | return NULL; |
592 | } | |
bf35388d | 593 | pt_count = vik_track_get_tp_count(tr); |
24d5c7e2 | 594 | |
bf35388d | 595 | v = g_malloc ( sizeof(gdouble) * num_chunks ); |
25e44eac | 596 | chunk_dur = duration / num_chunks; |
bf35388d EB |
597 | |
598 | s = g_malloc(sizeof(double) * pt_count); | |
599 | t = g_malloc(sizeof(double) * pt_count); | |
600 | p = g_malloc(sizeof(spline_coeff_t) * (pt_count-1)); | |
601 | ||
602 | iter = tr->trackpoints->next; | |
603 | numpts = 0; | |
604 | s[0] = 0; | |
605 | t[0] = VIK_TRACKPOINT(iter->prev->data)->timestamp; | |
606 | numpts++; | |
607 | while (iter) { | |
608 | s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) ); | |
609 | t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp; | |
610 | numpts++; | |
611 | iter = iter->next; | |
25e44eac AF |
612 | } |
613 | ||
bf35388d EB |
614 | compute_spline(numpts, t, s, p); |
615 | ||
bf35388d EB |
616 | /* the spline gives us distances at chunk_dur intervals. from these, |
617 | * we obtain average speed in each interval. | |
618 | */ | |
619 | spline = 0; | |
620 | T = t[spline]; | |
621 | s_prev = | |
622 | p[spline].d * pow(T - t[spline+1], 3) + | |
623 | p[spline].c * pow(T - t[spline+1], 2) + | |
624 | p[spline].b * (T - t[spline+1]) + | |
625 | p[spline].a; | |
626 | for (i = 0; i < num_chunks; i++, T+=chunk_dur) { | |
627 | while (T > t[spline+1]) { | |
628 | spline++; | |
629 | } | |
630 | s_now = | |
631 | p[spline].d * pow(T - t[spline+1], 3) + | |
632 | p[spline].c * pow(T - t[spline+1], 2) + | |
633 | p[spline].b * (T - t[spline+1]) + | |
634 | p[spline].a; | |
635 | v[i] = (s_now - s_prev) / chunk_dur; | |
636 | s_prev = s_now; | |
637 | /* | |
638 | * old method of averages | |
639 | v[i] = (s[spline+1]-s[spline])/(t[spline+1]-t[spline]); | |
640 | */ | |
641 | } | |
642 | g_free(s); | |
643 | g_free(t); | |
644 | g_free(p); | |
645 | return v; | |
25e44eac | 646 | } |
24d5c7e2 | 647 | |
bf35388d | 648 | /* by Alex Foobarian */ |
ddc2372e | 649 | VikTrackpoint *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist, gdouble *meters_from_start ) |
24d5c7e2 EB |
650 | { |
651 | gdouble dist = vik_track_get_length_including_gaps(tr) * reldist; | |
652 | gdouble current_dist = 0.0; | |
653 | gdouble current_inc = 0.0; | |
24d5c7e2 EB |
654 | if ( tr->trackpoints ) |
655 | { | |
656 | GList *iter = tr->trackpoints->next; | |
ecb51018 | 657 | GList *last_iter = NULL; |
ddc2372e | 658 | gdouble last_dist = 0.0; |
24d5c7e2 EB |
659 | while (iter) |
660 | { | |
661 | current_inc = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
662 | &(VIK_TRACKPOINT(iter->prev->data)->coord) ); | |
ddc2372e | 663 | last_dist = current_dist; |
24d5c7e2 EB |
664 | current_dist += current_inc; |
665 | if ( current_dist >= dist ) | |
666 | break; | |
ecb51018 | 667 | last_iter = iter; |
24d5c7e2 EB |
668 | iter = iter->next; |
669 | } | |
ddc2372e QT |
670 | if (!iter) { /* passing the end the track */ |
671 | if (last_iter) { | |
672 | if (meters_from_start) | |
673 | *meters_from_start = last_dist; | |
674 | return(VIK_TRACKPOINT(last_iter->data)); | |
675 | } | |
676 | else | |
677 | return NULL; | |
678 | } | |
24d5c7e2 EB |
679 | /* we've gone past the dist already, was prev trackpoint closer? */ |
680 | /* should do a vik_coord_average_weighted() thingy. */ | |
ddc2372e QT |
681 | if ( iter->prev && abs(current_dist-current_inc-dist) < abs(current_dist-dist) ) { |
682 | if (meters_from_start) | |
683 | *meters_from_start = last_dist; | |
24d5c7e2 | 684 | iter = iter->prev; |
ddc2372e QT |
685 | } |
686 | else | |
687 | if (meters_from_start) | |
688 | *meters_from_start = current_dist; | |
24d5c7e2 | 689 | |
e1e2f2c6 | 690 | return VIK_TRACKPOINT(iter->data); |
24d5c7e2 EB |
691 | |
692 | } | |
693 | return NULL; | |
694 | } | |
b42a25ba | 695 | |
ddc2372e | 696 | VikTrackpoint *vik_track_get_closest_tp_by_percentage_time ( VikTrack *tr, gdouble reltime, time_t *seconds_from_start ) |
32e48121 QT |
697 | { |
698 | time_t t_pos, t_start, t_end, t_total; | |
699 | t_start = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp; | |
700 | t_end = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp; | |
701 | t_total = t_end - t_start; | |
702 | ||
703 | t_pos = t_start + t_total * reltime; | |
704 | ||
ddc2372e QT |
705 | if ( !tr->trackpoints ) |
706 | return NULL; | |
32e48121 | 707 | |
ddc2372e QT |
708 | GList *iter = tr->trackpoints; |
709 | ||
710 | while (iter) { | |
711 | if (VIK_TRACKPOINT(iter->data)->timestamp == t_pos) | |
712 | break; | |
713 | if (VIK_TRACKPOINT(iter->data)->timestamp > t_pos) { | |
714 | if (iter->prev == NULL) /* first trackpoint */ | |
715 | break; | |
716 | time_t t_before = t_pos - VIK_TRACKPOINT(iter->prev)->timestamp; | |
717 | time_t t_after = VIK_TRACKPOINT(iter->data)->timestamp - t_pos; | |
718 | if (t_before <= t_after) | |
719 | iter = iter->prev; | |
720 | break; | |
32e48121 | 721 | } |
ddc2372e QT |
722 | else if ((iter->next == NULL) && (t_pos < (VIK_TRACKPOINT(iter->data)->timestamp + 3))) /* last trackpoint: accommodate for round-off */ |
723 | break; | |
724 | iter = iter->next; | |
32e48121 | 725 | } |
ddc2372e QT |
726 | |
727 | if (!iter) | |
728 | return NULL; | |
729 | if (seconds_from_start) | |
730 | *seconds_from_start = VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(tr->trackpoints->data)->timestamp; | |
731 | return VIK_TRACKPOINT(iter->data); | |
32e48121 QT |
732 | } |
733 | ||
b42a25ba EB |
734 | gboolean vik_track_get_minmax_alt ( const VikTrack *tr, gdouble *min_alt, gdouble *max_alt ) |
735 | { | |
736 | *min_alt = 25000; | |
737 | *max_alt = -5000; | |
738 | if ( tr && tr->trackpoints && tr->trackpoints->data && (VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE) ) { | |
739 | GList *iter = tr->trackpoints->next; | |
740 | gdouble tmp_alt; | |
741 | while (iter) | |
742 | { | |
743 | tmp_alt = VIK_TRACKPOINT(iter->data)->altitude; | |
744 | if ( tmp_alt > *max_alt ) | |
745 | *max_alt = tmp_alt; | |
746 | if ( tmp_alt < *min_alt ) | |
747 | *min_alt = tmp_alt; | |
748 | iter = iter->next; | |
749 | } | |
750 | return TRUE; | |
751 | } | |
752 | return FALSE; | |
753 | } | |
ddc47a46 AF |
754 | |
755 | void vik_track_marshall ( VikTrack *tr, guint8 **data, guint *datalen) | |
756 | { | |
757 | GList *tps; | |
758 | GByteArray *b = g_byte_array_new(); | |
759 | guint len; | |
760 | guint intp, ntp; | |
761 | ||
762 | g_byte_array_append(b, (guint8 *)tr, sizeof(*tr)); | |
763 | ||
764 | /* we'll fill out number of trackpoints later */ | |
765 | intp = b->len; | |
766 | g_byte_array_append(b, (guint8 *)&len, sizeof(len)); | |
767 | ||
768 | tps = tr->trackpoints; | |
769 | ntp = 0; | |
770 | while (tps) { | |
771 | g_byte_array_append(b, (guint8 *)tps->data, sizeof(VikTrackpoint)); | |
772 | tps = tps->next; | |
773 | ntp++; | |
774 | } | |
775 | *(guint *)(b->data + intp) = ntp; | |
776 | ||
777 | len = (tr->comment) ? strlen(tr->comment)+1 : 0; | |
778 | g_byte_array_append(b, (guint8 *)&len, sizeof(len)); | |
779 | if (tr->comment) g_byte_array_append(b, (guint8 *)tr->comment, len); | |
780 | ||
781 | *data = b->data; | |
782 | *datalen = b->len; | |
783 | g_byte_array_free(b, FALSE); | |
784 | } | |
785 | ||
786 | VikTrack *vik_track_unmarshall (guint8 *data, guint datalen) | |
787 | { | |
788 | guint len; | |
789 | VikTrack *new_tr = vik_track_new(); | |
790 | VikTrackpoint *new_tp; | |
791 | guint ntp; | |
792 | gint i; | |
793 | ||
794 | /* only the visibility is needed */ | |
795 | new_tr->visible = ((VikTrack *)data)->visible; | |
796 | data += sizeof(*new_tr); | |
797 | ||
798 | ntp = *(guint *)data; | |
799 | data += sizeof(ntp); | |
800 | ||
801 | for (i=0; i<ntp; i++) { | |
802 | new_tp = vik_trackpoint_new(); | |
803 | memcpy(new_tp, data, sizeof(*new_tp)); | |
804 | data += sizeof(*new_tp); | |
805 | new_tr->trackpoints = g_list_append(new_tr->trackpoints, new_tp); | |
806 | } | |
807 | ||
808 | len = *(guint *)data; | |
809 | data += sizeof(len); | |
810 | if (len) { | |
811 | new_tr->comment = g_strdup((gchar *)data); | |
812 | } | |
813 | return new_tr; | |
814 | } | |
ad0a8c2d | 815 | |
55906514 | 816 | void vik_track_apply_dem_data ( VikTrack *tr ) |
ad0a8c2d EB |
817 | { |
818 | GList *tp_iter; | |
819 | gint16 elev; | |
ad0a8c2d EB |
820 | tp_iter = tr->trackpoints; |
821 | while ( tp_iter ) { | |
822 | /* TODO: of the 4 possible choices we have for choosing an elevation | |
823 | * (trackpoint in between samples), choose the one with the least elevation change | |
824 | * as the last */ | |
5ef1d57e | 825 | elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(tp_iter->data)->coord), VIK_DEM_INTERPOL_BEST ); |
ad0a8c2d EB |
826 | if ( elev != VIK_DEM_INVALID_ELEVATION ) |
827 | VIK_TRACKPOINT(tp_iter->data)->altitude = elev; | |
828 | tp_iter = tp_iter->next; | |
829 | } | |
830 | } | |
bddd2056 EB |
831 | |
832 | /* appends t2 to t1, leaving t2 with no trackpoints */ | |
833 | void vik_track_steal_and_append_trackpoints ( VikTrack *t1, VikTrack *t2 ) | |
834 | { | |
835 | if ( t1->trackpoints ) { | |
836 | GList *tpiter = t1->trackpoints; | |
837 | while ( tpiter->next ) | |
838 | tpiter = tpiter->next; | |
839 | tpiter->next = t2->trackpoints; | |
840 | t2->trackpoints->prev = tpiter; | |
841 | } else | |
842 | t1->trackpoints = t2->trackpoints; | |
843 | t2->trackpoints = NULL; | |
844 | } | |
c3deba01 EB |
845 | |
846 | /* starting at the end, looks backwards for the last "double point", a duplicate trackpoint. | |
847 | * this is indicative of magic scissors continued use. If there is no double point, | |
848 | * deletes all the trackpoints. Returns the new end of the track (or the start if | |
849 | * there are no double points | |
850 | */ | |
851 | VikCoord *vik_track_cut_back_to_double_point ( VikTrack *tr ) | |
852 | { | |
853 | GList *iter = tr->trackpoints; | |
854 | VikCoord *rv; | |
855 | ||
856 | if ( !iter ) | |
857 | return NULL; | |
858 | while ( iter->next ) | |
859 | iter = iter->next; | |
860 | ||
861 | ||
862 | while ( iter->prev ) { | |
863 | if ( vik_coord_equals((VikCoord *)iter->data, (VikCoord *)iter->prev->data) ) { | |
864 | GList *prev = iter->prev; | |
865 | ||
866 | rv = g_malloc(sizeof(VikCoord)); | |
867 | *rv = *((VikCoord *) iter->data); | |
868 | ||
869 | /* truncate trackpoint list */ | |
870 | iter->prev = NULL; /* pretend it's the end */ | |
871 | g_list_foreach ( iter, (GFunc) g_free, NULL ); | |
872 | g_list_free( iter ); | |
873 | ||
874 | prev->next = NULL; | |
875 | ||
876 | return rv; | |
877 | } | |
878 | iter = iter->prev; | |
879 | } | |
880 | ||
881 | /* no double point found! */ | |
882 | rv = g_malloc(sizeof(VikCoord)); | |
883 | *rv = *((VikCoord *) tr->trackpoints->data); | |
884 | g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL ); | |
885 | g_list_free( tr->trackpoints ); | |
886 | tr->trackpoints = NULL; | |
887 | return rv; | |
888 | } | |
889 |