2 * viking -- GPS Data and Topo Analyzer, Explorer, and Manager
4 * Copyright (C) 2003-2005, Evan Battaglia <gtoevan@gmx.net>
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.
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.
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
41 VikTrack *vik_track_new()
43 VikTrack *tr = g_malloc0 ( sizeof ( VikTrack ) );
48 void vik_track_set_comment_no_copy(VikTrack *tr, gchar *comment)
51 g_free ( tr->comment );
52 tr->comment = comment;
56 void vik_track_set_comment(VikTrack *tr, const gchar *comment)
59 g_free ( tr->comment );
61 if ( comment && comment[0] != '\0' )
62 tr->comment = g_strdup(comment);
67 void vik_track_ref(VikTrack *tr)
72 void vik_track_set_property_dialog(VikTrack *tr, GtkWidget *dialog)
74 /* Warning: does not check for existing dialog */
75 tr->property_dialog = dialog;
78 void vik_track_clear_property_dialog(VikTrack *tr)
80 tr->property_dialog = NULL;
83 void vik_track_free(VikTrack *tr)
85 if ( tr->ref_count-- > 1 )
89 g_free ( tr->comment );
90 g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL );
91 g_list_free( tr->trackpoints );
92 if (tr->property_dialog)
93 gtk_widget_destroy ( GTK_WIDGET(tr->property_dialog) );
97 VikTrack *vik_track_copy ( const VikTrack *tr )
99 VikTrack *new_tr = vik_track_new();
100 VikTrackpoint *new_tp;
101 GList *tp_iter = tr->trackpoints;
102 new_tr->visible = tr->visible;
103 new_tr->trackpoints = NULL;
106 new_tp = g_malloc ( sizeof ( VikTrackpoint ) );
107 *new_tp = *((VikTrackpoint *)(tp_iter->data));
108 new_tr->trackpoints = g_list_append ( new_tr->trackpoints, new_tp );
109 tp_iter = tp_iter->next;
111 vik_track_set_comment(new_tr,tr->comment);
115 VikTrackpoint *vik_trackpoint_new()
117 VikTrackpoint *tp = g_malloc0(sizeof(VikTrackpoint));
123 void vik_trackpoint_free(VikTrackpoint *tp)
128 VikTrackpoint *vik_trackpoint_copy(VikTrackpoint *tp)
130 VikTrackpoint *rv = vik_trackpoint_new();
135 gdouble vik_track_get_length(const VikTrack *tr)
138 if ( tr->trackpoints )
140 GList *iter = tr->trackpoints->next;
143 if ( ! VIK_TRACKPOINT(iter->data)->newsegment )
144 len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
145 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
152 gdouble vik_track_get_length_including_gaps(const VikTrack *tr)
155 if ( tr->trackpoints )
157 GList *iter = tr->trackpoints->next;
160 len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
161 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
168 gulong vik_track_get_tp_count(const VikTrack *tr)
171 GList *iter = tr->trackpoints;
180 gulong vik_track_get_dup_point_count ( const VikTrack *tr )
183 GList *iter = tr->trackpoints;
186 if ( iter->next && vik_coord_equals ( &(VIK_TRACKPOINT(iter->data)->coord),
187 &(VIK_TRACKPOINT(iter->next->data)->coord) ) )
194 void vik_track_remove_dup_points ( VikTrack *tr )
196 GList *iter = tr->trackpoints;
199 if ( iter->next && vik_coord_equals ( &(VIK_TRACKPOINT(iter->data)->coord),
200 &(VIK_TRACKPOINT(iter->next->data)->coord) ) )
202 g_free ( iter->next->data );
203 tr->trackpoints = g_list_delete_link ( tr->trackpoints, iter->next );
210 guint vik_track_get_segment_count(const VikTrack *tr)
213 GList *iter = tr->trackpoints;
216 while ( (iter = iter->next) )
218 if ( VIK_TRACKPOINT(iter->data)->newsegment )
224 VikTrack **vik_track_split_into_segments(VikTrack *t, guint *ret_len)
229 guint segs = vik_track_get_segment_count(t);
238 rv = g_malloc ( segs * sizeof(VikTrack *) );
239 tr = vik_track_copy ( t );
241 iter = tr->trackpoints;
244 while ( (iter = iter->next) )
246 if ( VIK_TRACKPOINT(iter->data)->newsegment )
248 iter->prev->next = NULL;
250 rv[i] = vik_track_new();
252 vik_track_set_comment ( rv[i], tr->comment );
253 rv[i]->visible = tr->visible;
254 rv[i]->trackpoints = iter;
262 void vik_track_reverse ( VikTrack *tr )
265 tr->trackpoints = g_list_reverse(tr->trackpoints);
267 /* fix 'newsegment' */
268 iter = g_list_last ( tr->trackpoints );
271 if ( ! iter->next ) /* last segment, was first, cancel newsegment. */
272 VIK_TRACKPOINT(iter->data)->newsegment = FALSE;
273 if ( ! iter->prev ) /* first segment by convention has newsegment flag. */
274 VIK_TRACKPOINT(iter->data)->newsegment = TRUE;
275 else if ( VIK_TRACKPOINT(iter->data)->newsegment && iter->next )
277 VIK_TRACKPOINT(iter->next->data)->newsegment = TRUE;
278 VIK_TRACKPOINT(iter->data)->newsegment = FALSE;
284 gdouble vik_track_get_average_speed(const VikTrack *tr)
288 if ( tr->trackpoints )
290 GList *iter = tr->trackpoints->next;
293 if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
294 VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
295 (! VIK_TRACKPOINT(iter->data)->newsegment) )
297 len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
298 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
299 time += ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
304 return (time == 0) ? 0 : ABS(len/time);
307 gdouble vik_track_get_max_speed(const VikTrack *tr)
309 gdouble maxspeed = 0.0, speed = 0.0;
310 if ( tr->trackpoints )
312 GList *iter = tr->trackpoints->next;
315 if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
316 VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
317 (! VIK_TRACKPOINT(iter->data)->newsegment) )
319 speed = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), &(VIK_TRACKPOINT(iter->prev->data)->coord) )
320 / ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
321 if ( speed > maxspeed )
330 void vik_track_convert ( VikTrack *tr, VikCoordMode dest_mode )
332 GList *iter = tr->trackpoints;
335 vik_coord_convert ( &(VIK_TRACKPOINT(iter->data)->coord), dest_mode );
340 /* I understood this when I wrote it ... maybe ... Basically it eats up the
341 * proper amounts of length on the track and averages elevation over that. */
342 gdouble *vik_track_make_elevation_map ( const VikTrack *tr, guint16 num_chunks )
345 gdouble total_length, chunk_length, current_dist, current_area_under_curve, current_seg_length, dist_along_seg = 0.0;
346 gdouble altitude1, altitude2;
347 guint16 current_chunk;
348 gboolean ignore_it = FALSE;
350 GList *iter = tr->trackpoints;
352 if (!iter || !iter->next) /* zero- or one-point track */
355 { /* test if there's anything worth calculating */
356 gboolean okay = FALSE;
359 if ( VIK_TRACKPOINT(iter->data)->altitude != VIK_DEFAULT_ALTITUDE ) {
368 iter = tr->trackpoints;
370 g_assert ( num_chunks < 16000 );
372 pts = g_malloc ( sizeof(gdouble) * num_chunks );
374 total_length = vik_track_get_length_including_gaps ( tr );
375 chunk_length = total_length / num_chunks;
377 /* Zero chunk_length (eg, track of 2 tp with the same loc) will cause crash */
378 if (chunk_length <= 0)
382 current_area_under_curve = 0;
384 current_seg_length = 0;
386 current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
387 &(VIK_TRACKPOINT(iter->next->data)->coord) );
388 altitude1 = VIK_TRACKPOINT(iter->data)->altitude;
389 altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude;
392 while ( current_chunk < num_chunks ) {
394 /* go along current seg */
395 if ( current_seg_length && (current_seg_length - dist_along_seg) > chunk_length ) {
396 dist_along_seg += chunk_length;
400 * /x altitude = alt_at_pt_1 + alt_at_pt_2 / 2 = altitude1 + slope * dist_value_of_pt_inbetween_pt1_and_pt2
401 * /xx avg altitude = area under curve / chunk len
402 *pt1 *xxx avg altitude = altitude1 + (altitude2-altitude1)/(current_seg_length)*(dist_along_seg + (chunk_len/2))
408 pts[current_chunk] = VIK_DEFAULT_ALTITUDE;
410 pts[current_chunk] = altitude1 + (altitude2-altitude1)*((dist_along_seg - (chunk_length/2))/current_seg_length);
414 /* finish current seg */
415 if ( current_seg_length ) {
416 gdouble altitude_at_dist_along_seg = altitude1 + (altitude2-altitude1)/(current_seg_length)*dist_along_seg;
417 current_dist = current_seg_length - dist_along_seg;
418 current_area_under_curve = current_dist*(altitude_at_dist_along_seg + altitude2)*0.5;
419 } else { current_dist = current_area_under_curve = 0; } /* should only happen if first current_seg_length == 0 */
421 /* get intervening segs */
423 while ( iter && iter->next ) {
424 current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
425 &(VIK_TRACKPOINT(iter->next->data)->coord) );
426 altitude1 = VIK_TRACKPOINT(iter->data)->altitude;
427 altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude;
428 ignore_it = VIK_TRACKPOINT(iter->next->data)->newsegment;
430 if ( chunk_length - current_dist >= current_seg_length ) {
431 current_dist += current_seg_length;
432 current_area_under_curve += current_seg_length * (altitude1+altitude2) * 0.5;
440 dist_along_seg = chunk_length - current_dist;
441 if ( ignore_it || !iter->next ) {
442 pts[current_chunk] = current_area_under_curve / current_dist;
445 for (i = current_chunk + 1; i < num_chunks; i++)
446 pts[i] = pts[current_chunk];
451 current_area_under_curve += dist_along_seg * (altitude1 + (altitude2 - altitude1)*dist_along_seg/current_seg_length);
452 pts[current_chunk] = current_area_under_curve / chunk_length;
464 void vik_track_get_total_elevation_gain(const VikTrack *tr, gdouble *up, gdouble *down)
468 if ( tr->trackpoints && VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE )
470 GList *iter = tr->trackpoints->next;
473 diff = VIK_TRACKPOINT(iter->data)->altitude - VIK_TRACKPOINT(iter->prev->data)->altitude;
481 *up = *down = VIK_DEFAULT_ALTITUDE;
485 /* by Alex Foobarian */
486 gdouble *vik_track_make_speed_map ( const VikTrack *tr, guint16 num_chunks )
489 gdouble duration, chunk_dur;
491 int i, pt_count, numpts, index;
494 if ( ! tr->trackpoints )
497 g_assert ( num_chunks < 16000 );
499 t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
500 t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
503 if ( !t1 || !t2 || !duration )
507 g_warning("negative duration: unsorted trackpoint timestamps?");
510 pt_count = vik_track_get_tp_count(tr);
512 v = g_malloc ( sizeof(gdouble) * num_chunks );
513 chunk_dur = duration / num_chunks;
515 s = g_malloc(sizeof(double) * pt_count);
516 t = g_malloc(sizeof(double) * pt_count);
518 iter = tr->trackpoints->next;
521 t[0] = VIK_TRACKPOINT(iter->prev->data)->timestamp;
524 s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) );
525 t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
530 /* In the following computation, we iterate through periods of time of duration chunk_dur.
531 * The first period begins at the beginning of the track. The last period ends at the end of the track.
533 index = 0; /* index of the current trackpoint. */
534 for (i = 0; i < num_chunks; i++) {
535 /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur.
536 * find the first trackpoint outside the current interval, averaging the speeds between intermediate trackpoints.
538 if (t[0] + i*chunk_dur >= t[index]) {
539 gdouble acc_t = 0, acc_s = 0;
541 while (t[0] + i*chunk_dur >= t[index]) {
542 acc_s += (s[index+1]-s[index]);
543 acc_t += (t[index+1]-t[index]);
561 /* by Alex Foobarian */
562 VikTrackpoint *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist, gdouble *meters_from_start )
564 gdouble dist = vik_track_get_length_including_gaps(tr) * reldist;
565 gdouble current_dist = 0.0;
566 gdouble current_inc = 0.0;
567 if ( tr->trackpoints )
569 GList *iter = tr->trackpoints->next;
570 GList *last_iter = NULL;
571 gdouble last_dist = 0.0;
574 current_inc = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
575 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
576 last_dist = current_dist;
577 current_dist += current_inc;
578 if ( current_dist >= dist )
583 if (!iter) { /* passing the end the track */
585 if (meters_from_start)
586 *meters_from_start = last_dist;
587 return(VIK_TRACKPOINT(last_iter->data));
592 /* we've gone past the dist already, was prev trackpoint closer? */
593 /* should do a vik_coord_average_weighted() thingy. */
594 if ( iter->prev && abs(current_dist-current_inc-dist) < abs(current_dist-dist) ) {
595 if (meters_from_start)
596 *meters_from_start = last_dist;
600 if (meters_from_start)
601 *meters_from_start = current_dist;
603 return VIK_TRACKPOINT(iter->data);
609 VikTrackpoint *vik_track_get_closest_tp_by_percentage_time ( VikTrack *tr, gdouble reltime, time_t *seconds_from_start )
611 time_t t_pos, t_start, t_end, t_total;
612 t_start = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
613 t_end = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
614 t_total = t_end - t_start;
616 t_pos = t_start + t_total * reltime;
618 if ( !tr->trackpoints )
621 GList *iter = tr->trackpoints;
624 if (VIK_TRACKPOINT(iter->data)->timestamp == t_pos)
626 if (VIK_TRACKPOINT(iter->data)->timestamp > t_pos) {
627 if (iter->prev == NULL) /* first trackpoint */
629 time_t t_before = t_pos - VIK_TRACKPOINT(iter->prev)->timestamp;
630 time_t t_after = VIK_TRACKPOINT(iter->data)->timestamp - t_pos;
631 if (t_before <= t_after)
635 else if ((iter->next == NULL) && (t_pos < (VIK_TRACKPOINT(iter->data)->timestamp + 3))) /* last trackpoint: accommodate for round-off */
642 if (seconds_from_start)
643 *seconds_from_start = VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
644 return VIK_TRACKPOINT(iter->data);
647 gboolean vik_track_get_minmax_alt ( const VikTrack *tr, gdouble *min_alt, gdouble *max_alt )
651 if ( tr && tr->trackpoints && tr->trackpoints->data && (VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE) ) {
652 GList *iter = tr->trackpoints->next;
656 tmp_alt = VIK_TRACKPOINT(iter->data)->altitude;
657 if ( tmp_alt > *max_alt )
659 if ( tmp_alt < *min_alt )
668 void vik_track_marshall ( VikTrack *tr, guint8 **data, guint *datalen)
671 GByteArray *b = g_byte_array_new();
675 g_byte_array_append(b, (guint8 *)tr, sizeof(*tr));
677 /* we'll fill out number of trackpoints later */
679 g_byte_array_append(b, (guint8 *)&len, sizeof(len));
681 tps = tr->trackpoints;
684 g_byte_array_append(b, (guint8 *)tps->data, sizeof(VikTrackpoint));
688 *(guint *)(b->data + intp) = ntp;
690 len = (tr->comment) ? strlen(tr->comment)+1 : 0;
691 g_byte_array_append(b, (guint8 *)&len, sizeof(len));
692 if (tr->comment) g_byte_array_append(b, (guint8 *)tr->comment, len);
696 g_byte_array_free(b, FALSE);
699 VikTrack *vik_track_unmarshall (guint8 *data, guint datalen)
702 VikTrack *new_tr = vik_track_new();
703 VikTrackpoint *new_tp;
707 /* only the visibility is needed */
708 new_tr->visible = ((VikTrack *)data)->visible;
709 data += sizeof(*new_tr);
711 ntp = *(guint *)data;
714 for (i=0; i<ntp; i++) {
715 new_tp = vik_trackpoint_new();
716 memcpy(new_tp, data, sizeof(*new_tp));
717 data += sizeof(*new_tp);
718 new_tr->trackpoints = g_list_append(new_tr->trackpoints, new_tp);
721 len = *(guint *)data;
724 new_tr->comment = g_strdup((gchar *)data);
729 void vik_track_apply_dem_data ( VikTrack *tr )
733 tp_iter = tr->trackpoints;
735 /* TODO: of the 4 possible choices we have for choosing an elevation
736 * (trackpoint in between samples), choose the one with the least elevation change
738 elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(tp_iter->data)->coord), VIK_DEM_INTERPOL_BEST );
739 if ( elev != VIK_DEM_INVALID_ELEVATION )
740 VIK_TRACKPOINT(tp_iter->data)->altitude = elev;
741 tp_iter = tp_iter->next;
745 /* appends t2 to t1, leaving t2 with no trackpoints */
746 void vik_track_steal_and_append_trackpoints ( VikTrack *t1, VikTrack *t2 )
748 if ( t1->trackpoints ) {
749 GList *tpiter = t1->trackpoints;
750 while ( tpiter->next )
751 tpiter = tpiter->next;
752 tpiter->next = t2->trackpoints;
753 t2->trackpoints->prev = tpiter;
755 t1->trackpoints = t2->trackpoints;
756 t2->trackpoints = NULL;
759 /* starting at the end, looks backwards for the last "double point", a duplicate trackpoint.
760 * this is indicative of magic scissors continued use. If there is no double point,
761 * deletes all the trackpoints. Returns the new end of the track (or the start if
762 * there are no double points
764 VikCoord *vik_track_cut_back_to_double_point ( VikTrack *tr )
766 GList *iter = tr->trackpoints;
775 while ( iter->prev ) {
776 if ( vik_coord_equals((VikCoord *)iter->data, (VikCoord *)iter->prev->data) ) {
777 GList *prev = iter->prev;
779 rv = g_malloc(sizeof(VikCoord));
780 *rv = *((VikCoord *) iter->data);
782 /* truncate trackpoint list */
783 iter->prev = NULL; /* pretend it's the end */
784 g_list_foreach ( iter, (GFunc) g_free, NULL );
794 /* no double point found! */
795 rv = g_malloc(sizeof(VikCoord));
796 *rv = *((VikCoord *) tr->trackpoints->data);
797 g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL );
798 g_list_free( tr->trackpoints );
799 tr->trackpoints = NULL;