]>
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 | ||
6374e157 QT |
371 | /* Zero chunk_length (eg, track of 2 tp with the same loc) will cause crash */ |
372 | if (chunk_length <= 0) | |
373 | return NULL; | |
374 | ||
50a14534 EB |
375 | current_dist = 0.0; |
376 | current_area_under_curve = 0; | |
377 | current_chunk = 0; | |
378 | current_seg_length = 0; | |
379 | ||
380 | current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
381 | &(VIK_TRACKPOINT(iter->next->data)->coord) ); | |
382 | altitude1 = VIK_TRACKPOINT(iter->data)->altitude; | |
383 | altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude; | |
384 | dist_along_seg = 0; | |
385 | ||
386 | while ( current_chunk < num_chunks ) { | |
387 | ||
388 | /* go along current seg */ | |
389 | if ( current_seg_length && (current_seg_length - dist_along_seg) > chunk_length ) { | |
390 | dist_along_seg += chunk_length; | |
391 | ||
392 | /* / | |
393 | * pt2 * | |
394 | * /x altitude = alt_at_pt_1 + alt_at_pt_2 / 2 = altitude1 + slope * dist_value_of_pt_inbetween_pt1_and_pt2 | |
395 | * /xx avg altitude = area under curve / chunk len | |
396 | *pt1 *xxx avg altitude = altitude1 + (altitude2-altitude1)/(current_seg_length)*(dist_along_seg + (chunk_len/2)) | |
397 | * / xxx | |
398 | * / xxx | |
399 | **/ | |
400 | ||
401 | if ( ignore_it ) | |
402 | pts[current_chunk] = VIK_DEFAULT_ALTITUDE; | |
403 | else | |
9903c388 | 404 | pts[current_chunk] = altitude1 + (altitude2-altitude1)*((dist_along_seg - (chunk_length/2))/current_seg_length); |
50a14534 EB |
405 | |
406 | current_chunk++; | |
407 | } else { | |
408 | /* finish current seg */ | |
409 | if ( current_seg_length ) { | |
410 | gdouble altitude_at_dist_along_seg = altitude1 + (altitude2-altitude1)/(current_seg_length)*dist_along_seg; | |
411 | current_dist = current_seg_length - dist_along_seg; | |
412 | current_area_under_curve = current_dist*(altitude_at_dist_along_seg + altitude2)*0.5; | |
413 | } else { current_dist = current_area_under_curve = 0; } /* should only happen if first current_seg_length == 0 */ | |
414 | ||
415 | /* get intervening segs */ | |
416 | iter = iter->next; | |
417 | while ( iter && iter->next ) { | |
418 | current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
419 | &(VIK_TRACKPOINT(iter->next->data)->coord) ); | |
420 | altitude1 = VIK_TRACKPOINT(iter->data)->altitude; | |
421 | altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude; | |
422 | ignore_it = VIK_TRACKPOINT(iter->next->data)->newsegment; | |
423 | ||
424 | if ( chunk_length - current_dist >= current_seg_length ) { | |
425 | current_dist += current_seg_length; | |
426 | current_area_under_curve += current_seg_length * (altitude1+altitude2) * 0.5; | |
427 | iter = iter->next; | |
428 | } else { | |
429 | break; | |
430 | } | |
431 | } | |
432 | ||
433 | /* final seg */ | |
434 | dist_along_seg = chunk_length - current_dist; | |
9903c388 | 435 | if ( ignore_it || !iter->next ) { |
50a14534 | 436 | pts[current_chunk] = current_area_under_curve / current_dist; |
61950ef8 QT |
437 | if (!iter->next) { |
438 | int i; | |
439 | for (i = current_chunk + 1; i < num_chunks; i++) | |
440 | pts[i] = pts[current_chunk]; | |
441 | break; | |
442 | } | |
9903c388 | 443 | } |
50a14534 EB |
444 | else { |
445 | current_area_under_curve += dist_along_seg * (altitude1 + (altitude2 - altitude1)*dist_along_seg/current_seg_length); | |
446 | pts[current_chunk] = current_area_under_curve / chunk_length; | |
447 | } | |
448 | ||
449 | current_dist = 0; | |
450 | current_chunk++; | |
451 | } | |
452 | } | |
453 | ||
454 | return pts; | |
455 | } | |
456 | ||
457 | ||
458 | void vik_track_get_total_elevation_gain(const VikTrack *tr, gdouble *up, gdouble *down) | |
459 | { | |
460 | gdouble diff; | |
461 | *up = *down = 0; | |
8c4f1350 | 462 | if ( tr->trackpoints && VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE ) |
50a14534 EB |
463 | { |
464 | GList *iter = tr->trackpoints->next; | |
465 | while (iter) | |
466 | { | |
467 | diff = VIK_TRACKPOINT(iter->data)->altitude - VIK_TRACKPOINT(iter->prev->data)->altitude; | |
468 | if ( diff > 0 ) | |
469 | *up += diff; | |
470 | else | |
471 | *down -= diff; | |
472 | iter = iter->next; | |
473 | } | |
bf35388d EB |
474 | } else |
475 | *up = *down = VIK_DEFAULT_ALTITUDE; | |
476 | } | |
477 | ||
25e44eac | 478 | |
bf35388d | 479 | /* by Alex Foobarian */ |
25e44eac AF |
480 | gdouble *vik_track_make_speed_map ( const VikTrack *tr, guint16 num_chunks ) |
481 | { | |
bf35388d EB |
482 | gdouble *v, *s, *t; |
483 | gdouble duration, chunk_dur, T, s_prev, s_now; | |
25e44eac | 484 | time_t t1, t2; |
d03d80e6 | 485 | int i, pt_count, numpts, index; |
bf35388d | 486 | GList *iter; |
25e44eac | 487 | |
24d5c7e2 EB |
488 | if ( ! tr->trackpoints ) |
489 | return NULL; | |
25e44eac | 490 | |
24d5c7e2 | 491 | g_assert ( num_chunks < 16000 ); |
25e44eac AF |
492 | |
493 | t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp; | |
494 | t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp; | |
495 | duration = t2 - t1; | |
c79f0206 EB |
496 | |
497 | if ( !t1 || !t2 || !duration ) | |
498 | return NULL; | |
499 | ||
25e44eac | 500 | if (duration < 0) { |
7742da66 | 501 | g_warning("negative duration: unsorted trackpoint timestamps?\n"); |
25e44eac AF |
502 | return NULL; |
503 | } | |
bf35388d | 504 | pt_count = vik_track_get_tp_count(tr); |
24d5c7e2 | 505 | |
bf35388d | 506 | v = g_malloc ( sizeof(gdouble) * num_chunks ); |
25e44eac | 507 | chunk_dur = duration / num_chunks; |
bf35388d EB |
508 | |
509 | s = g_malloc(sizeof(double) * pt_count); | |
510 | t = g_malloc(sizeof(double) * pt_count); | |
bf35388d EB |
511 | |
512 | iter = tr->trackpoints->next; | |
513 | numpts = 0; | |
514 | s[0] = 0; | |
515 | t[0] = VIK_TRACKPOINT(iter->prev->data)->timestamp; | |
516 | numpts++; | |
517 | while (iter) { | |
518 | s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) ); | |
519 | t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp; | |
520 | numpts++; | |
521 | iter = iter->next; | |
25e44eac AF |
522 | } |
523 | ||
d03d80e6 AF |
524 | /* In the following computation, we iterate through periods of time of duration chunk_dur. |
525 | * The first period begins at the beginning of the track. The last period ends at the end of the track. | |
bf35388d | 526 | */ |
d03d80e6 AF |
527 | index = 0; /* index of the current trackpoint. */ |
528 | for (i = 0; i < num_chunks; i++) { | |
529 | /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur. | |
530 | * find the first trackpoint outside the current interval, averaging the speeds between intermediate trackpoints. | |
531 | */ | |
532 | if (t[0] + i*chunk_dur >= t[index]) { | |
533 | gdouble acc_t = 0, acc_s = 0; | |
534 | numpts = 0; | |
535 | while (t[0] + i*chunk_dur >= t[index]) { | |
536 | acc_s += (s[index+1]-s[index]); | |
537 | acc_t += (t[index+1]-t[index]); | |
538 | index++; | |
539 | numpts++; | |
540 | } | |
541 | v[i] = acc_s/acc_t; | |
542 | } | |
543 | else if (i) { | |
544 | v[i] = v[i-1]; | |
545 | } | |
546 | else { | |
547 | v[i] = 0; | |
bf35388d | 548 | } |
bf35388d EB |
549 | } |
550 | g_free(s); | |
551 | g_free(t); | |
bf35388d | 552 | return v; |
25e44eac | 553 | } |
24d5c7e2 | 554 | |
bf35388d | 555 | /* by Alex Foobarian */ |
ddc2372e | 556 | VikTrackpoint *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist, gdouble *meters_from_start ) |
24d5c7e2 EB |
557 | { |
558 | gdouble dist = vik_track_get_length_including_gaps(tr) * reldist; | |
559 | gdouble current_dist = 0.0; | |
560 | gdouble current_inc = 0.0; | |
24d5c7e2 EB |
561 | if ( tr->trackpoints ) |
562 | { | |
563 | GList *iter = tr->trackpoints->next; | |
ecb51018 | 564 | GList *last_iter = NULL; |
ddc2372e | 565 | gdouble last_dist = 0.0; |
24d5c7e2 EB |
566 | while (iter) |
567 | { | |
568 | current_inc = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), | |
569 | &(VIK_TRACKPOINT(iter->prev->data)->coord) ); | |
ddc2372e | 570 | last_dist = current_dist; |
24d5c7e2 EB |
571 | current_dist += current_inc; |
572 | if ( current_dist >= dist ) | |
573 | break; | |
ecb51018 | 574 | last_iter = iter; |
24d5c7e2 EB |
575 | iter = iter->next; |
576 | } | |
ddc2372e QT |
577 | if (!iter) { /* passing the end the track */ |
578 | if (last_iter) { | |
579 | if (meters_from_start) | |
580 | *meters_from_start = last_dist; | |
581 | return(VIK_TRACKPOINT(last_iter->data)); | |
582 | } | |
583 | else | |
584 | return NULL; | |
585 | } | |
24d5c7e2 EB |
586 | /* we've gone past the dist already, was prev trackpoint closer? */ |
587 | /* should do a vik_coord_average_weighted() thingy. */ | |
ddc2372e QT |
588 | if ( iter->prev && abs(current_dist-current_inc-dist) < abs(current_dist-dist) ) { |
589 | if (meters_from_start) | |
590 | *meters_from_start = last_dist; | |
24d5c7e2 | 591 | iter = iter->prev; |
ddc2372e QT |
592 | } |
593 | else | |
594 | if (meters_from_start) | |
595 | *meters_from_start = current_dist; | |
24d5c7e2 | 596 | |
e1e2f2c6 | 597 | return VIK_TRACKPOINT(iter->data); |
24d5c7e2 EB |
598 | |
599 | } | |
600 | return NULL; | |
601 | } | |
b42a25ba | 602 | |
ddc2372e | 603 | VikTrackpoint *vik_track_get_closest_tp_by_percentage_time ( VikTrack *tr, gdouble reltime, time_t *seconds_from_start ) |
32e48121 QT |
604 | { |
605 | time_t t_pos, t_start, t_end, t_total; | |
606 | t_start = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp; | |
607 | t_end = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp; | |
608 | t_total = t_end - t_start; | |
609 | ||
610 | t_pos = t_start + t_total * reltime; | |
611 | ||
ddc2372e QT |
612 | if ( !tr->trackpoints ) |
613 | return NULL; | |
32e48121 | 614 | |
ddc2372e QT |
615 | GList *iter = tr->trackpoints; |
616 | ||
617 | while (iter) { | |
618 | if (VIK_TRACKPOINT(iter->data)->timestamp == t_pos) | |
619 | break; | |
620 | if (VIK_TRACKPOINT(iter->data)->timestamp > t_pos) { | |
621 | if (iter->prev == NULL) /* first trackpoint */ | |
622 | break; | |
623 | time_t t_before = t_pos - VIK_TRACKPOINT(iter->prev)->timestamp; | |
624 | time_t t_after = VIK_TRACKPOINT(iter->data)->timestamp - t_pos; | |
625 | if (t_before <= t_after) | |
626 | iter = iter->prev; | |
627 | break; | |
32e48121 | 628 | } |
ddc2372e QT |
629 | else if ((iter->next == NULL) && (t_pos < (VIK_TRACKPOINT(iter->data)->timestamp + 3))) /* last trackpoint: accommodate for round-off */ |
630 | break; | |
631 | iter = iter->next; | |
32e48121 | 632 | } |
ddc2372e QT |
633 | |
634 | if (!iter) | |
635 | return NULL; | |
636 | if (seconds_from_start) | |
637 | *seconds_from_start = VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(tr->trackpoints->data)->timestamp; | |
638 | return VIK_TRACKPOINT(iter->data); | |
32e48121 QT |
639 | } |
640 | ||
b42a25ba EB |
641 | gboolean vik_track_get_minmax_alt ( const VikTrack *tr, gdouble *min_alt, gdouble *max_alt ) |
642 | { | |
643 | *min_alt = 25000; | |
644 | *max_alt = -5000; | |
645 | if ( tr && tr->trackpoints && tr->trackpoints->data && (VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE) ) { | |
646 | GList *iter = tr->trackpoints->next; | |
647 | gdouble tmp_alt; | |
648 | while (iter) | |
649 | { | |
650 | tmp_alt = VIK_TRACKPOINT(iter->data)->altitude; | |
651 | if ( tmp_alt > *max_alt ) | |
652 | *max_alt = tmp_alt; | |
653 | if ( tmp_alt < *min_alt ) | |
654 | *min_alt = tmp_alt; | |
655 | iter = iter->next; | |
656 | } | |
657 | return TRUE; | |
658 | } | |
659 | return FALSE; | |
660 | } | |
ddc47a46 AF |
661 | |
662 | void vik_track_marshall ( VikTrack *tr, guint8 **data, guint *datalen) | |
663 | { | |
664 | GList *tps; | |
665 | GByteArray *b = g_byte_array_new(); | |
666 | guint len; | |
667 | guint intp, ntp; | |
668 | ||
669 | g_byte_array_append(b, (guint8 *)tr, sizeof(*tr)); | |
670 | ||
671 | /* we'll fill out number of trackpoints later */ | |
672 | intp = b->len; | |
673 | g_byte_array_append(b, (guint8 *)&len, sizeof(len)); | |
674 | ||
675 | tps = tr->trackpoints; | |
676 | ntp = 0; | |
677 | while (tps) { | |
678 | g_byte_array_append(b, (guint8 *)tps->data, sizeof(VikTrackpoint)); | |
679 | tps = tps->next; | |
680 | ntp++; | |
681 | } | |
682 | *(guint *)(b->data + intp) = ntp; | |
683 | ||
684 | len = (tr->comment) ? strlen(tr->comment)+1 : 0; | |
685 | g_byte_array_append(b, (guint8 *)&len, sizeof(len)); | |
686 | if (tr->comment) g_byte_array_append(b, (guint8 *)tr->comment, len); | |
687 | ||
688 | *data = b->data; | |
689 | *datalen = b->len; | |
690 | g_byte_array_free(b, FALSE); | |
691 | } | |
692 | ||
693 | VikTrack *vik_track_unmarshall (guint8 *data, guint datalen) | |
694 | { | |
695 | guint len; | |
696 | VikTrack *new_tr = vik_track_new(); | |
697 | VikTrackpoint *new_tp; | |
698 | guint ntp; | |
699 | gint i; | |
700 | ||
701 | /* only the visibility is needed */ | |
702 | new_tr->visible = ((VikTrack *)data)->visible; | |
703 | data += sizeof(*new_tr); | |
704 | ||
705 | ntp = *(guint *)data; | |
706 | data += sizeof(ntp); | |
707 | ||
708 | for (i=0; i<ntp; i++) { | |
709 | new_tp = vik_trackpoint_new(); | |
710 | memcpy(new_tp, data, sizeof(*new_tp)); | |
711 | data += sizeof(*new_tp); | |
712 | new_tr->trackpoints = g_list_append(new_tr->trackpoints, new_tp); | |
713 | } | |
714 | ||
715 | len = *(guint *)data; | |
716 | data += sizeof(len); | |
717 | if (len) { | |
718 | new_tr->comment = g_strdup((gchar *)data); | |
719 | } | |
720 | return new_tr; | |
721 | } | |
ad0a8c2d | 722 | |
55906514 | 723 | void vik_track_apply_dem_data ( VikTrack *tr ) |
ad0a8c2d EB |
724 | { |
725 | GList *tp_iter; | |
726 | gint16 elev; | |
ad0a8c2d EB |
727 | tp_iter = tr->trackpoints; |
728 | while ( tp_iter ) { | |
729 | /* TODO: of the 4 possible choices we have for choosing an elevation | |
730 | * (trackpoint in between samples), choose the one with the least elevation change | |
731 | * as the last */ | |
5ef1d57e | 732 | elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(tp_iter->data)->coord), VIK_DEM_INTERPOL_BEST ); |
ad0a8c2d EB |
733 | if ( elev != VIK_DEM_INVALID_ELEVATION ) |
734 | VIK_TRACKPOINT(tp_iter->data)->altitude = elev; | |
735 | tp_iter = tp_iter->next; | |
736 | } | |
737 | } | |
bddd2056 EB |
738 | |
739 | /* appends t2 to t1, leaving t2 with no trackpoints */ | |
740 | void vik_track_steal_and_append_trackpoints ( VikTrack *t1, VikTrack *t2 ) | |
741 | { | |
742 | if ( t1->trackpoints ) { | |
743 | GList *tpiter = t1->trackpoints; | |
744 | while ( tpiter->next ) | |
745 | tpiter = tpiter->next; | |
746 | tpiter->next = t2->trackpoints; | |
747 | t2->trackpoints->prev = tpiter; | |
748 | } else | |
749 | t1->trackpoints = t2->trackpoints; | |
750 | t2->trackpoints = NULL; | |
751 | } | |
c3deba01 EB |
752 | |
753 | /* starting at the end, looks backwards for the last "double point", a duplicate trackpoint. | |
754 | * this is indicative of magic scissors continued use. If there is no double point, | |
755 | * deletes all the trackpoints. Returns the new end of the track (or the start if | |
756 | * there are no double points | |
757 | */ | |
758 | VikCoord *vik_track_cut_back_to_double_point ( VikTrack *tr ) | |
759 | { | |
760 | GList *iter = tr->trackpoints; | |
761 | VikCoord *rv; | |
762 | ||
763 | if ( !iter ) | |
764 | return NULL; | |
765 | while ( iter->next ) | |
766 | iter = iter->next; | |
767 | ||
768 | ||
769 | while ( iter->prev ) { | |
770 | if ( vik_coord_equals((VikCoord *)iter->data, (VikCoord *)iter->prev->data) ) { | |
771 | GList *prev = iter->prev; | |
772 | ||
773 | rv = g_malloc(sizeof(VikCoord)); | |
774 | *rv = *((VikCoord *) iter->data); | |
775 | ||
776 | /* truncate trackpoint list */ | |
777 | iter->prev = NULL; /* pretend it's the end */ | |
778 | g_list_foreach ( iter, (GFunc) g_free, NULL ); | |
779 | g_list_free( iter ); | |
780 | ||
781 | prev->next = NULL; | |
782 | ||
783 | return rv; | |
784 | } | |
785 | iter = iter->prev; | |
786 | } | |
787 | ||
788 | /* no double point found! */ | |
789 | rv = g_malloc(sizeof(VikCoord)); | |
790 | *rv = *((VikCoord *) tr->trackpoints->data); | |
791 | g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL ); | |
792 | g_list_free( tr->trackpoints ); | |
793 | tr->trackpoints = NULL; | |
794 | return rv; | |
795 | } | |
796 |