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