2 * viking -- GPS Data and Topo Analyzer, Explorer, and Manager
4 * Copyright (C) 2003-2005, Evan Battaglia <gtoevan@gmx.net>
5 * Copyright (c) 2012, Rob Norris <rw_norris@hotmail.com>
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
42 VikTrack *vik_track_new()
44 VikTrack *tr = g_malloc0 ( sizeof ( VikTrack ) );
49 void vik_track_set_comment_no_copy(VikTrack *tr, gchar *comment)
52 g_free ( tr->comment );
53 tr->comment = comment;
57 void vik_track_set_name(VikTrack *tr, const gchar *name)
62 tr->name = g_strdup(name);
65 void vik_track_set_comment(VikTrack *tr, const gchar *comment)
68 g_free ( tr->comment );
70 if ( comment && comment[0] != '\0' )
71 tr->comment = g_strdup(comment);
76 void vik_track_set_description(VikTrack *tr, const gchar *description)
78 if ( tr->description )
79 g_free ( tr->description );
81 if ( description && description[0] != '\0' )
82 tr->description = g_strdup(description);
84 tr->description = NULL;
87 void vik_track_ref(VikTrack *tr)
92 void vik_track_set_property_dialog(VikTrack *tr, GtkWidget *dialog)
94 /* Warning: does not check for existing dialog */
95 tr->property_dialog = dialog;
98 void vik_track_clear_property_dialog(VikTrack *tr)
100 tr->property_dialog = NULL;
103 void vik_track_free(VikTrack *tr)
105 if ( tr->ref_count-- > 1 )
111 g_free ( tr->comment );
112 if ( tr->description )
113 g_free ( tr->description );
114 g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL );
115 g_list_free( tr->trackpoints );
116 if (tr->property_dialog)
117 if ( GTK_IS_WIDGET(tr->property_dialog) )
118 gtk_widget_destroy ( GTK_WIDGET(tr->property_dialog) );
124 * @tr: The Track to copy
125 * @copy_points: Whether to copy the track points or not
127 * Normally for copying the track it's best to copy all the trackpoints
128 * However for some operations such as splitting tracks the trackpoints will be managed separately, so no need to copy them.
130 * Returns: the copied VikTrack
132 VikTrack *vik_track_copy ( const VikTrack *tr, gboolean copy_points )
134 VikTrack *new_tr = vik_track_new();
135 VikTrackpoint *new_tp;
136 GList *tp_iter = tr->trackpoints;
137 new_tr->visible = tr->visible;
138 new_tr->is_route = tr->is_route;
139 new_tr->has_color = tr->has_color;
140 new_tr->color = tr->color;
141 new_tr->bbox = tr->bbox;
142 new_tr->trackpoints = NULL;
147 new_tp = g_malloc ( sizeof ( VikTrackpoint ) );
148 *new_tp = *((VikTrackpoint *)(tp_iter->data));
149 new_tr->trackpoints = g_list_append ( new_tr->trackpoints, new_tp );
150 tp_iter = tp_iter->next;
153 vik_track_set_name(new_tr,tr->name);
154 vik_track_set_comment(new_tr,tr->comment);
155 vik_track_set_description(new_tr,tr->description);
159 VikTrackpoint *vik_trackpoint_new()
161 VikTrackpoint *tp = g_malloc0(sizeof(VikTrackpoint));
164 tp->altitude = VIK_DEFAULT_ALTITUDE;
165 tp->hdop = VIK_DEFAULT_DOP;
166 tp->vdop = VIK_DEFAULT_DOP;
167 tp->pdop = VIK_DEFAULT_DOP;
171 void vik_trackpoint_free(VikTrackpoint *tp)
176 VikTrackpoint *vik_trackpoint_copy(VikTrackpoint *tp)
178 VikTrackpoint *rv = vik_trackpoint_new();
184 * track_recalculate_bounds_last_tp:
185 * @trk: The track to consider the recalculation on
187 * A faster bounds check, since it only considers the last track point
189 static void track_recalculate_bounds_last_tp ( VikTrack *trk )
191 GList *tpl = g_list_last ( trk->trackpoints );
195 // See if this trackpoint increases the track bounds and update if so
196 vik_coord_to_latlon ( &(VIK_TRACKPOINT(tpl->data)->coord), &ll );
197 if ( ll.lat > trk->bbox.north )
198 trk->bbox.north = ll.lat;
199 if ( ll.lon < trk->bbox.west )
200 trk->bbox.west = ll.lon;
201 if ( ll.lat < trk->bbox.south )
202 trk->bbox.south = ll.lat;
203 if ( ll.lon > trk->bbox.east )
204 trk->bbox.east = ll.lon;
209 * vik_track_add_trackpoint:
210 * @tr: The track to which the trackpoint will be added
211 * @tp: The trackpoint to add
212 * @recalculate: Whether to perform any associated properties recalculations
213 * Generally one should avoid recalculation via this method if adding lots of points
214 * (But ensure calculate_bounds() is called after adding all points!!)
216 * The trackpoint is added to the end of the existing trackpoint list
218 void vik_track_add_trackpoint ( VikTrack *tr, VikTrackpoint *tp, gboolean recalculate )
220 tr->trackpoints = g_list_append ( tr->trackpoints, tp );
222 track_recalculate_bounds_last_tp ( tr );
225 gdouble vik_track_get_length(const VikTrack *tr)
228 if ( tr->trackpoints )
230 GList *iter = tr->trackpoints->next;
233 if ( ! VIK_TRACKPOINT(iter->data)->newsegment )
234 len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
235 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
242 gdouble vik_track_get_length_including_gaps(const VikTrack *tr)
245 if ( tr->trackpoints )
247 GList *iter = tr->trackpoints->next;
250 len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
251 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
258 gulong vik_track_get_tp_count(const VikTrack *tr)
261 GList *iter = tr->trackpoints;
270 gulong vik_track_get_dup_point_count ( const VikTrack *tr )
273 GList *iter = tr->trackpoints;
276 if ( iter->next && vik_coord_equals ( &(VIK_TRACKPOINT(iter->data)->coord),
277 &(VIK_TRACKPOINT(iter->next->data)->coord) ) )
285 * Deletes adjacent points that have the same position
286 * Returns the number of points that were deleted
288 gulong vik_track_remove_dup_points ( VikTrack *tr )
291 GList *iter = tr->trackpoints;
294 if ( iter->next && vik_coord_equals ( &(VIK_TRACKPOINT(iter->data)->coord),
295 &(VIK_TRACKPOINT(iter->next->data)->coord) ) )
298 // Maintain track segments
299 if ( VIK_TRACKPOINT(iter->next->data)->newsegment && (iter->next)->next )
300 VIK_TRACKPOINT(((iter->next)->next)->data)->newsegment = TRUE;
302 vik_trackpoint_free ( iter->next->data );
303 tr->trackpoints = g_list_delete_link ( tr->trackpoints, iter->next );
309 // NB isn't really be necessary as removing duplicate points shouldn't alter the bounds!
310 vik_track_calculate_bounds ( tr );
316 * Get a count of trackpoints with the same defined timestamp
317 * Note is using timestamps with a resolution with 1 second
319 gulong vik_track_get_same_time_point_count ( const VikTrack *tr )
322 GList *iter = tr->trackpoints;
325 ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
326 VIK_TRACKPOINT(iter->next->data)->has_timestamp ) &&
327 ( VIK_TRACKPOINT(iter->data)->timestamp ==
328 VIK_TRACKPOINT(iter->next->data)->timestamp) )
336 * Deletes adjacent points that have the same defined timestamp
337 * Returns the number of points that were deleted
339 gulong vik_track_remove_same_time_points ( VikTrack *tr )
342 GList *iter = tr->trackpoints;
345 ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
346 VIK_TRACKPOINT(iter->next->data)->has_timestamp ) &&
347 ( VIK_TRACKPOINT(iter->data)->timestamp ==
348 VIK_TRACKPOINT(iter->next->data)->timestamp) ) {
352 // Maintain track segments
353 if ( VIK_TRACKPOINT(iter->next->data)->newsegment && (iter->next)->next )
354 VIK_TRACKPOINT(((iter->next)->next)->data)->newsegment = TRUE;
356 vik_trackpoint_free ( iter->next->data );
357 tr->trackpoints = g_list_delete_link ( tr->trackpoints, iter->next );
363 vik_track_calculate_bounds ( tr );
369 * Deletes all 'extra' trackpoint information
370 * such as time stamps, speed, course etc...
372 void vik_track_to_routepoints ( VikTrack *tr )
374 GList *iter = tr->trackpoints;
377 // c.f. with vik_trackpoint_new()
379 VIK_TRACKPOINT(iter->data)->has_timestamp = FALSE;
380 VIK_TRACKPOINT(iter->data)->timestamp = 0;
381 VIK_TRACKPOINT(iter->data)->speed = NAN;
382 VIK_TRACKPOINT(iter->data)->course = NAN;
383 VIK_TRACKPOINT(iter->data)->hdop = VIK_DEFAULT_DOP;
384 VIK_TRACKPOINT(iter->data)->vdop = VIK_DEFAULT_DOP;
385 VIK_TRACKPOINT(iter->data)->pdop = VIK_DEFAULT_DOP;
386 VIK_TRACKPOINT(iter->data)->nsats = 0;
387 VIK_TRACKPOINT(iter->data)->fix_mode = VIK_GPS_MODE_NOT_SEEN;
393 guint vik_track_get_segment_count(const VikTrack *tr)
396 GList *iter = tr->trackpoints;
399 while ( (iter = iter->next) )
401 if ( VIK_TRACKPOINT(iter->data)->newsegment )
407 VikTrack **vik_track_split_into_segments(VikTrack *t, guint *ret_len)
412 guint segs = vik_track_get_segment_count(t);
421 rv = g_malloc ( segs * sizeof(VikTrack *) );
422 tr = vik_track_copy ( t, TRUE );
424 iter = tr->trackpoints;
427 while ( (iter = iter->next) )
429 if ( VIK_TRACKPOINT(iter->data)->newsegment )
431 iter->prev->next = NULL;
433 rv[i] = vik_track_copy ( tr, FALSE );
434 rv[i]->trackpoints = iter;
436 vik_track_calculate_bounds ( rv[i] );
446 * Simply remove any subsequent segment markers in a track to form one continuous track
447 * Return the number of segments merged
449 guint vik_track_merge_segments(VikTrack *tr)
452 GList *iter = tr->trackpoints;
456 // Always skip the first point as this should be the first segment
459 while ( (iter = iter->next) )
461 if ( VIK_TRACKPOINT(iter->data)->newsegment ) {
462 VIK_TRACKPOINT(iter->data)->newsegment = FALSE;
469 void vik_track_reverse ( VikTrack *tr )
471 if ( ! tr->trackpoints )
474 tr->trackpoints = g_list_reverse(tr->trackpoints);
476 /* fix 'newsegment' */
477 GList *iter = g_list_last ( tr->trackpoints );
480 if ( ! iter->next ) /* last segment, was first, cancel newsegment. */
481 VIK_TRACKPOINT(iter->data)->newsegment = FALSE;
482 if ( ! iter->prev ) /* first segment by convention has newsegment flag. */
483 VIK_TRACKPOINT(iter->data)->newsegment = TRUE;
484 else if ( VIK_TRACKPOINT(iter->data)->newsegment && iter->next )
486 VIK_TRACKPOINT(iter->next->data)->newsegment = TRUE;
487 VIK_TRACKPOINT(iter->data)->newsegment = FALSE;
493 gdouble vik_track_get_average_speed(const VikTrack *tr)
497 if ( tr->trackpoints )
499 GList *iter = tr->trackpoints->next;
502 if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
503 VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
504 (! VIK_TRACKPOINT(iter->data)->newsegment) )
506 len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
507 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
508 time += ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
513 return (time == 0) ? 0 : ABS(len/time);
517 * Based on a simple average speed, but with a twist - to give a moving average.
518 * . GPSs often report a moving average in their statistics output
519 * . bicycle speedos often don't factor in time when stopped - hence reporting a moving average for speed
521 * Often GPS track will record every second but not when stationary
522 * This method doesn't use samples that differ over the specified time limit - effectively skipping that time chunk from the total time
524 * Suggest to use 60 seconds as the stop length (as the default used in the TrackWaypoint draw stops factor)
526 gdouble vik_track_get_average_speed_moving (const VikTrack *tr, int stop_length_seconds)
530 if ( tr->trackpoints )
532 GList *iter = tr->trackpoints->next;
535 if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
536 VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
537 (! VIK_TRACKPOINT(iter->data)->newsegment) )
539 if ( ( VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp ) < stop_length_seconds ) {
540 len += vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
541 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
543 time += ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
549 return (time == 0) ? 0 : ABS(len/time);
552 gdouble vik_track_get_max_speed(const VikTrack *tr)
554 gdouble maxspeed = 0.0, speed = 0.0;
555 if ( tr->trackpoints )
557 GList *iter = tr->trackpoints->next;
560 if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
561 VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
562 (! VIK_TRACKPOINT(iter->data)->newsegment) )
564 speed = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), &(VIK_TRACKPOINT(iter->prev->data)->coord) )
565 / ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
566 if ( speed > maxspeed )
575 void vik_track_convert ( VikTrack *tr, VikCoordMode dest_mode )
577 GList *iter = tr->trackpoints;
580 vik_coord_convert ( &(VIK_TRACKPOINT(iter->data)->coord), dest_mode );
585 /* I understood this when I wrote it ... maybe ... Basically it eats up the
586 * proper amounts of length on the track and averages elevation over that. */
587 gdouble *vik_track_make_elevation_map ( const VikTrack *tr, guint16 num_chunks )
590 gdouble total_length, chunk_length, current_dist, current_area_under_curve, current_seg_length, dist_along_seg = 0.0;
591 gdouble altitude1, altitude2;
592 guint16 current_chunk;
593 gboolean ignore_it = FALSE;
595 GList *iter = tr->trackpoints;
597 if (!iter || !iter->next) /* zero- or one-point track */
600 { /* test if there's anything worth calculating */
601 gboolean okay = FALSE;
604 // Sometimes a GPS device (or indeed any random file) can have stupid numbers for elevations
605 // Since when is 9.9999e+24 a valid elevation!!
606 // This can happen when a track (with no elevations) is uploaded to a GPS device and then redownloaded (e.g. using a Garmin Legend EtrexHCx)
607 // Some protection against trying to work with crazily massive numbers (otherwise get SIGFPE, Arithmetic exception)
608 if ( VIK_TRACKPOINT(iter->data)->altitude != VIK_DEFAULT_ALTITUDE &&
609 VIK_TRACKPOINT(iter->data)->altitude < 1E9 ) {
618 iter = tr->trackpoints;
620 g_assert ( num_chunks < 16000 );
622 pts = g_malloc ( sizeof(gdouble) * num_chunks );
624 total_length = vik_track_get_length_including_gaps ( tr );
625 chunk_length = total_length / num_chunks;
627 /* Zero chunk_length (eg, track of 2 tp with the same loc) will cause crash */
628 if (chunk_length <= 0) {
634 current_area_under_curve = 0;
636 current_seg_length = 0;
638 current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
639 &(VIK_TRACKPOINT(iter->next->data)->coord) );
640 altitude1 = VIK_TRACKPOINT(iter->data)->altitude;
641 altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude;
644 while ( current_chunk < num_chunks ) {
646 /* go along current seg */
647 if ( current_seg_length && (current_seg_length - dist_along_seg) > chunk_length ) {
648 dist_along_seg += chunk_length;
652 * /x altitude = alt_at_pt_1 + alt_at_pt_2 / 2 = altitude1 + slope * dist_value_of_pt_inbetween_pt1_and_pt2
653 * /xx avg altitude = area under curve / chunk len
654 *pt1 *xxx avg altitude = altitude1 + (altitude2-altitude1)/(current_seg_length)*(dist_along_seg + (chunk_len/2))
660 // Seemly can't determine average for this section - so use last known good value (much better than just sticking in zero)
661 pts[current_chunk] = altitude1;
663 pts[current_chunk] = altitude1 + (altitude2-altitude1)*((dist_along_seg - (chunk_length/2))/current_seg_length);
667 /* finish current seg */
668 if ( current_seg_length ) {
669 gdouble altitude_at_dist_along_seg = altitude1 + (altitude2-altitude1)/(current_seg_length)*dist_along_seg;
670 current_dist = current_seg_length - dist_along_seg;
671 current_area_under_curve = current_dist*(altitude_at_dist_along_seg + altitude2)*0.5;
672 } else { current_dist = current_area_under_curve = 0; } /* should only happen if first current_seg_length == 0 */
674 /* get intervening segs */
676 while ( iter && iter->next ) {
677 current_seg_length = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
678 &(VIK_TRACKPOINT(iter->next->data)->coord) );
679 altitude1 = VIK_TRACKPOINT(iter->data)->altitude;
680 altitude2 = VIK_TRACKPOINT(iter->next->data)->altitude;
681 ignore_it = VIK_TRACKPOINT(iter->next->data)->newsegment;
683 if ( chunk_length - current_dist >= current_seg_length ) {
684 current_dist += current_seg_length;
685 current_area_under_curve += current_seg_length * (altitude1+altitude2) * 0.5;
693 dist_along_seg = chunk_length - current_dist;
694 if ( ignore_it || ( iter && !iter->next ) ) {
695 pts[current_chunk] = current_area_under_curve / current_dist;
698 for (i = current_chunk + 1; i < num_chunks; i++)
699 pts[i] = pts[current_chunk];
704 current_area_under_curve += dist_along_seg * (altitude1 + (altitude2 - altitude1)*dist_along_seg/current_seg_length);
705 pts[current_chunk] = current_area_under_curve / chunk_length;
717 void vik_track_get_total_elevation_gain(const VikTrack *tr, gdouble *up, gdouble *down)
721 if ( tr->trackpoints && VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE )
723 GList *iter = tr->trackpoints->next;
726 diff = VIK_TRACKPOINT(iter->data)->altitude - VIK_TRACKPOINT(iter->prev->data)->altitude;
734 *up = *down = VIK_DEFAULT_ALTITUDE;
737 gdouble *vik_track_make_gradient_map ( const VikTrack *tr, guint16 num_chunks )
741 gdouble total_length, chunk_length, current_gradient;
742 gdouble altitude1, altitude2;
743 guint16 current_chunk;
745 g_assert ( num_chunks < 16000 );
747 total_length = vik_track_get_length_including_gaps ( tr );
748 chunk_length = total_length / num_chunks;
750 /* Zero chunk_length (eg, track of 2 tp with the same loc) will cause crash */
751 if (chunk_length <= 0) {
755 altitudes = vik_track_make_elevation_map (tr, num_chunks);
756 if (altitudes == NULL) {
760 current_gradient = 0.0;
761 pts = g_malloc ( sizeof(gdouble) * num_chunks );
762 for (current_chunk = 0; current_chunk < (num_chunks - 1); current_chunk++) {
763 altitude1 = altitudes[current_chunk];
764 altitude2 = altitudes[current_chunk + 1];
765 current_gradient = 100.0 * (altitude2 - altitude1) / chunk_length;
767 pts[current_chunk] = current_gradient;
770 pts[current_chunk] = current_gradient;
775 /* by Alex Foobarian */
776 gdouble *vik_track_make_speed_map ( const VikTrack *tr, guint16 num_chunks )
779 gdouble duration, chunk_dur;
781 int i, pt_count, numpts, index;
784 if ( ! tr->trackpoints )
787 g_assert ( num_chunks < 16000 );
789 t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
790 t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
793 if ( !t1 || !t2 || !duration )
797 g_warning("negative duration: unsorted trackpoint timestamps?");
800 pt_count = vik_track_get_tp_count(tr);
802 v = g_malloc ( sizeof(gdouble) * num_chunks );
803 chunk_dur = duration / num_chunks;
805 s = g_malloc(sizeof(double) * pt_count);
806 t = g_malloc(sizeof(double) * pt_count);
808 iter = tr->trackpoints->next;
811 t[0] = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
814 s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) );
815 t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
820 /* In the following computation, we iterate through periods of time of duration chunk_dur.
821 * The first period begins at the beginning of the track. The last period ends at the end of the track.
823 index = 0; /* index of the current trackpoint. */
824 for (i = 0; i < num_chunks; i++) {
825 /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur.
826 * find the first trackpoint outside the current interval, averaging the speeds between intermediate trackpoints.
828 if (t[0] + i*chunk_dur >= t[index]) {
829 gdouble acc_t = 0, acc_s = 0;
830 while (t[0] + i*chunk_dur >= t[index]) {
831 acc_s += (s[index+1]-s[index]);
832 acc_t += (t[index+1]-t[index]);
850 * Make a distance/time map, heavily based on the vik_track_make_speed_map method
852 gdouble *vik_track_make_distance_map ( const VikTrack *tr, guint16 num_chunks )
855 gdouble duration, chunk_dur;
857 int i, pt_count, numpts, index;
860 if ( ! tr->trackpoints )
863 t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
864 t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
867 if ( !t1 || !t2 || !duration )
871 g_warning("negative duration: unsorted trackpoint timestamps?");
874 pt_count = vik_track_get_tp_count(tr);
876 v = g_malloc ( sizeof(gdouble) * num_chunks );
877 chunk_dur = duration / num_chunks;
879 s = g_malloc(sizeof(double) * pt_count);
880 t = g_malloc(sizeof(double) * pt_count);
882 iter = tr->trackpoints->next;
885 t[0] = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
888 s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) );
889 t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
894 /* In the following computation, we iterate through periods of time of duration chunk_dur.
895 * The first period begins at the beginning of the track. The last period ends at the end of the track.
897 index = 0; /* index of the current trackpoint. */
898 for (i = 0; i < num_chunks; i++) {
899 /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur.
900 * find the first trackpoint outside the current interval, averaging the distance between intermediate trackpoints.
902 if (t[0] + i*chunk_dur >= t[index]) {
903 gdouble acc_s = 0; // No need for acc_t
904 while (t[0] + i*chunk_dur >= t[index]) {
905 acc_s += (s[index+1]-s[index]);
908 // The only bit that's really different from the speed map - just keep an accululative record distance
909 v[i] = i ? v[i-1]+acc_s : acc_s;
924 * This uses the 'time' based method to make the graph, (which is a simpler compared to the elevation/distance)
925 * This results in a slightly blocky graph when it does not have many trackpoints: <60
926 * NB Somehow the elevation/distance applies some kind of smoothing algorithm,
927 * but I don't think any one understands it any more (I certainly don't ATM)
929 gdouble *vik_track_make_elevation_time_map ( const VikTrack *tr, guint16 num_chunks )
932 gdouble duration, chunk_dur;
933 GList *iter = tr->trackpoints;
935 if (!iter || !iter->next) /* zero- or one-point track */
938 /* test if there's anything worth calculating */
939 gboolean okay = FALSE;
941 if ( VIK_TRACKPOINT(iter->data)->altitude != VIK_DEFAULT_ALTITUDE ) {
950 t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
951 t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
954 if ( !t1 || !t2 || !duration )
958 g_warning("negative duration: unsorted trackpoint timestamps?");
961 gint pt_count = vik_track_get_tp_count(tr);
963 // Reset iterator back to the beginning
964 iter = tr->trackpoints;
966 gdouble *pts = g_malloc ( sizeof(gdouble) * num_chunks ); // The return altitude values
967 gdouble *s = g_malloc(sizeof(double) * pt_count); // calculation altitudes
968 gdouble *t = g_malloc(sizeof(double) * pt_count); // calculation times
970 chunk_dur = duration / num_chunks;
972 s[0] = VIK_TRACKPOINT(iter->data)->altitude;
973 t[0] = VIK_TRACKPOINT(iter->data)->timestamp;
974 iter = tr->trackpoints->next;
977 s[numpts] = VIK_TRACKPOINT(iter->data)->altitude;
978 t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
983 /* In the following computation, we iterate through periods of time of duration chunk_dur.
984 * The first period begins at the beginning of the track. The last period ends at the end of the track.
986 gint index = 0; /* index of the current trackpoint. */
988 for (i = 0; i < num_chunks; i++) {
989 /* we are now covering the interval from t[0] + i*chunk_dur to t[0] + (i+1)*chunk_dur.
990 * find the first trackpoint outside the current interval, averaging the heights between intermediate trackpoints.
992 if (t[0] + i*chunk_dur >= t[index]) {
993 gdouble acc_s = s[index]; // initialise to first point
994 while (t[0] + i*chunk_dur >= t[index]) {
995 acc_s += (s[index+1]-s[index]);
1014 * Make a speed/distance map
1016 gdouble *vik_track_make_speed_dist_map ( const VikTrack *tr, guint16 num_chunks )
1020 gint i, pt_count, numpts, index;
1022 gdouble duration, total_length, chunk_length;
1024 if ( ! tr->trackpoints )
1027 t1 = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
1028 t2 = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
1031 if ( !t1 || !t2 || !duration )
1035 g_warning("negative duration: unsorted trackpoint timestamps?");
1039 total_length = vik_track_get_length_including_gaps ( tr );
1040 chunk_length = total_length / num_chunks;
1041 pt_count = vik_track_get_tp_count(tr);
1043 if (chunk_length <= 0) {
1047 v = g_malloc ( sizeof(gdouble) * num_chunks );
1048 s = g_malloc ( sizeof(double) * pt_count );
1049 t = g_malloc ( sizeof(double) * pt_count );
1051 // No special handling of segments ATM...
1052 iter = tr->trackpoints->next;
1055 t[0] = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
1058 s[numpts] = s[numpts-1] + vik_coord_diff ( &(VIK_TRACKPOINT(iter->prev->data)->coord), &(VIK_TRACKPOINT(iter->data)->coord) );
1059 t[numpts] = VIK_TRACKPOINT(iter->data)->timestamp;
1064 // Iterate through a portion of the track to get an average speed for that part
1065 // This will essentially interpolate between segments, which I think is right given the usage of 'get_length_including_gaps'
1066 index = 0; /* index of the current trackpoint. */
1067 for (i = 0; i < num_chunks; i++) {
1068 // Similar to the make_speed_map, but instead of using a time chunk, use a distance chunk
1069 if (s[0] + i*chunk_length >= s[index]) {
1070 gdouble acc_t = 0, acc_s = 0;
1071 while (s[0] + i*chunk_length >= s[index]) {
1072 acc_s += (s[index+1]-s[index]);
1073 acc_t += (t[index+1]-t[index]);
1090 /* by Alex Foobarian */
1091 VikTrackpoint *vik_track_get_closest_tp_by_percentage_dist ( VikTrack *tr, gdouble reldist, gdouble *meters_from_start )
1093 gdouble dist = vik_track_get_length_including_gaps(tr) * reldist;
1094 gdouble current_dist = 0.0;
1095 gdouble current_inc = 0.0;
1096 if ( tr->trackpoints )
1098 GList *iter = tr->trackpoints->next;
1099 GList *last_iter = NULL;
1100 gdouble last_dist = 0.0;
1103 current_inc = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord),
1104 &(VIK_TRACKPOINT(iter->prev->data)->coord) );
1105 last_dist = current_dist;
1106 current_dist += current_inc;
1107 if ( current_dist >= dist )
1112 if (!iter) { /* passing the end the track */
1114 if (meters_from_start)
1115 *meters_from_start = last_dist;
1116 return(VIK_TRACKPOINT(last_iter->data));
1121 /* we've gone past the dist already, was prev trackpoint closer? */
1122 /* should do a vik_coord_average_weighted() thingy. */
1123 if ( iter->prev && abs(current_dist-current_inc-dist) < abs(current_dist-dist) ) {
1124 if (meters_from_start)
1125 *meters_from_start = last_dist;
1129 if (meters_from_start)
1130 *meters_from_start = current_dist;
1132 return VIK_TRACKPOINT(iter->data);
1138 VikTrackpoint *vik_track_get_closest_tp_by_percentage_time ( VikTrack *tr, gdouble reltime, time_t *seconds_from_start )
1140 time_t t_pos, t_start, t_end, t_total;
1141 t_start = VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
1142 t_end = VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->timestamp;
1143 t_total = t_end - t_start;
1145 t_pos = t_start + t_total * reltime;
1147 if ( !tr->trackpoints )
1150 GList *iter = tr->trackpoints;
1153 if (VIK_TRACKPOINT(iter->data)->timestamp == t_pos)
1155 if (VIK_TRACKPOINT(iter->data)->timestamp > t_pos) {
1156 if (iter->prev == NULL) /* first trackpoint */
1158 time_t t_before = t_pos - VIK_TRACKPOINT(iter->prev->data)->timestamp;
1159 time_t t_after = VIK_TRACKPOINT(iter->data)->timestamp - t_pos;
1160 if (t_before <= t_after)
1164 else if ((iter->next == NULL) && (t_pos < (VIK_TRACKPOINT(iter->data)->timestamp + 3))) /* last trackpoint: accommodate for round-off */
1171 if (seconds_from_start)
1172 *seconds_from_start = VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(tr->trackpoints->data)->timestamp;
1173 return VIK_TRACKPOINT(iter->data);
1176 VikTrackpoint* vik_track_get_tp_by_max_speed ( const VikTrack *tr )
1178 gdouble maxspeed = 0.0, speed = 0.0;
1180 if ( !tr->trackpoints )
1183 GList *iter = tr->trackpoints;
1184 VikTrackpoint *max_speed_tp = NULL;
1188 if ( VIK_TRACKPOINT(iter->data)->has_timestamp &&
1189 VIK_TRACKPOINT(iter->prev->data)->has_timestamp &&
1190 (! VIK_TRACKPOINT(iter->data)->newsegment) ) {
1191 speed = vik_coord_diff ( &(VIK_TRACKPOINT(iter->data)->coord), &(VIK_TRACKPOINT(iter->prev->data)->coord) )
1192 / ABS(VIK_TRACKPOINT(iter->data)->timestamp - VIK_TRACKPOINT(iter->prev->data)->timestamp);
1193 if ( speed > maxspeed ) {
1195 max_speed_tp = VIK_TRACKPOINT(iter->data);
1205 return max_speed_tp;
1208 VikTrackpoint* vik_track_get_tp_by_max_alt ( const VikTrack *tr )
1210 gdouble maxalt = -5000.0;
1211 if ( !tr->trackpoints )
1214 GList *iter = tr->trackpoints;
1215 VikTrackpoint *max_alt_tp = NULL;
1218 if ( VIK_TRACKPOINT(iter->data)->altitude > maxalt ) {
1219 maxalt = VIK_TRACKPOINT(iter->data)->altitude;
1220 max_alt_tp = VIK_TRACKPOINT(iter->data);
1231 VikTrackpoint* vik_track_get_tp_by_min_alt ( const VikTrack *tr )
1233 gdouble minalt = 25000.0;
1234 if ( !tr->trackpoints )
1237 GList *iter = tr->trackpoints;
1238 VikTrackpoint *min_alt_tp = NULL;
1241 if ( VIK_TRACKPOINT(iter->data)->altitude < minalt ) {
1242 minalt = VIK_TRACKPOINT(iter->data)->altitude;
1243 min_alt_tp = VIK_TRACKPOINT(iter->data);
1254 gboolean vik_track_get_minmax_alt ( const VikTrack *tr, gdouble *min_alt, gdouble *max_alt )
1258 if ( tr && tr->trackpoints && tr->trackpoints->data && (VIK_TRACKPOINT(tr->trackpoints->data)->altitude != VIK_DEFAULT_ALTITUDE) ) {
1259 GList *iter = tr->trackpoints->next;
1263 tmp_alt = VIK_TRACKPOINT(iter->data)->altitude;
1264 if ( tmp_alt > *max_alt )
1266 if ( tmp_alt < *min_alt )
1275 void vik_track_marshall ( VikTrack *tr, guint8 **data, guint *datalen)
1278 GByteArray *b = g_byte_array_new();
1282 g_byte_array_append(b, (guint8 *)tr, sizeof(*tr));
1284 /* we'll fill out number of trackpoints later */
1286 g_byte_array_append(b, (guint8 *)&len, sizeof(len));
1288 tps = tr->trackpoints;
1291 g_byte_array_append(b, (guint8 *)tps->data, sizeof(VikTrackpoint));
1295 *(guint *)(b->data + intp) = ntp;
1297 // This allocates space for variant sized strings
1298 // and copies that amount of data from the track to byte array
1299 #define vtm_append(s) \
1300 len = (s) ? strlen(s)+1 : 0; \
1301 g_byte_array_append(b, (guint8 *)&len, sizeof(len)); \
1302 if (s) g_byte_array_append(b, (guint8 *)s, len);
1304 vtm_append(tr->name);
1305 vtm_append(tr->comment);
1306 vtm_append(tr->description);
1310 g_byte_array_free(b, FALSE);
1314 * Take a byte array and convert it into a Track
1316 VikTrack *vik_track_unmarshall (guint8 *data, guint datalen)
1319 VikTrack *new_tr = vik_track_new();
1320 VikTrackpoint *new_tp;
1324 /* basic properties: */
1325 new_tr->visible = ((VikTrack *)data)->visible;
1326 new_tr->is_route = ((VikTrack *)data)->is_route;
1327 new_tr->has_color = ((VikTrack *)data)->has_color;
1328 new_tr->color = ((VikTrack *)data)->color;
1329 new_tr->bbox = ((VikTrack *)data)->bbox;
1331 data += sizeof(*new_tr);
1333 ntp = *(guint *)data;
1334 data += sizeof(ntp);
1336 for (i=0; i<ntp; i++) {
1337 new_tp = vik_trackpoint_new();
1338 memcpy(new_tp, data, sizeof(*new_tp));
1339 data += sizeof(*new_tp);
1340 new_tr->trackpoints = g_list_append(new_tr->trackpoints, new_tp);
1343 #define vtu_get(s) \
1344 len = *(guint *)data; \
1345 data += sizeof(len); \
1347 (s) = g_strdup((gchar *)data); \
1353 vtu_get(new_tr->name);
1354 vtu_get(new_tr->comment);
1355 vtu_get(new_tr->description);
1361 * (Re)Calculate the bounds of the given track,
1362 * updating the track's bounds data.
1363 * This should be called whenever a track's trackpoints are changed
1365 void vik_track_calculate_bounds ( VikTrack *trk )
1368 tp_iter = trk->trackpoints;
1370 struct LatLon topleft, bottomright, ll;
1372 // Set bounds to first point
1374 vik_coord_to_latlon ( &(VIK_TRACKPOINT(tp_iter->data)->coord), &topleft );
1375 vik_coord_to_latlon ( &(VIK_TRACKPOINT(tp_iter->data)->coord), &bottomright );
1379 // See if this trackpoint increases the track bounds.
1381 vik_coord_to_latlon ( &(VIK_TRACKPOINT(tp_iter->data)->coord), &ll );
1383 if ( ll.lat > topleft.lat) topleft.lat = ll.lat;
1384 if ( ll.lon < topleft.lon) topleft.lon = ll.lon;
1385 if ( ll.lat < bottomright.lat) bottomright.lat = ll.lat;
1386 if ( ll.lon > bottomright.lon) bottomright.lon = ll.lon;
1388 tp_iter = tp_iter->next;
1391 g_debug ( g_strdup_printf("Bounds of track: '%s' is: %f,%f to: %f,%f", trk->name, topleft.lat, topleft.lon, bottomright.lat, bottomright.lon ) );
1393 trk->bbox.north = topleft.lat;
1394 trk->bbox.east = bottomright.lon;
1395 trk->bbox.south = bottomright.lat;
1396 trk->bbox.west = topleft.lon;
1402 void vik_track_apply_dem_data ( VikTrack *tr )
1406 tp_iter = tr->trackpoints;
1408 /* TODO: of the 4 possible choices we have for choosing an elevation
1409 * (trackpoint in between samples), choose the one with the least elevation change
1411 elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(tp_iter->data)->coord), VIK_DEM_INTERPOL_BEST );
1412 if ( elev != VIK_DEM_INVALID_ELEVATION )
1413 VIK_TRACKPOINT(tp_iter->data)->altitude = elev;
1414 tp_iter = tp_iter->next;
1419 * vik_track_apply_dem_data_last_trackpoint:
1420 * Apply DEM data (if available) - to only the last trackpoint
1422 void vik_track_apply_dem_data_last_trackpoint ( VikTrack *tr )
1425 if ( tr->trackpoints ) {
1426 /* As in vik_track_apply_dem_data above - use 'best' interpolation method */
1427 elev = a_dems_get_elev_by_coord ( &(VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->coord), VIK_DEM_INTERPOL_BEST );
1428 if ( elev != VIK_DEM_INVALID_ELEVATION )
1429 VIK_TRACKPOINT(g_list_last(tr->trackpoints)->data)->altitude = elev;
1434 * vik_track_steal_and_append_trackpoints:
1436 * appends t2 to t1, leaving t2 with no trackpoints
1438 void vik_track_steal_and_append_trackpoints ( VikTrack *t1, VikTrack *t2 )
1440 if ( t1->trackpoints ) {
1441 t1->trackpoints = g_list_concat ( t1->trackpoints, t2->trackpoints );
1443 t1->trackpoints = t2->trackpoints;
1444 t2->trackpoints = NULL;
1446 // Trackpoints updated - so update the bounds
1447 vik_track_calculate_bounds ( t1 );
1451 * vik_track_cut_back_to_double_point:
1453 * starting at the end, looks backwards for the last "double point", a duplicate trackpoint.
1454 * If there is no double point, deletes all the trackpoints.
1456 * Returns: the new end of the track (or the start if there are no double points)
1458 VikCoord *vik_track_cut_back_to_double_point ( VikTrack *tr )
1460 GList *iter = tr->trackpoints;
1465 while ( iter->next )
1469 while ( iter->prev ) {
1470 if ( vik_coord_equals((VikCoord *)iter->data, (VikCoord *)iter->prev->data) ) {
1471 GList *prev = iter->prev;
1473 rv = g_malloc(sizeof(VikCoord));
1474 *rv = *((VikCoord *) iter->data);
1476 /* truncate trackpoint list */
1477 iter->prev = NULL; /* pretend it's the end */
1478 g_list_foreach ( iter, (GFunc) g_free, NULL );
1479 g_list_free( iter );
1488 /* no double point found! */
1489 rv = g_malloc(sizeof(VikCoord));
1490 *rv = *((VikCoord *) tr->trackpoints->data);
1491 g_list_foreach ( tr->trackpoints, (GFunc) g_free, NULL );
1492 g_list_free( tr->trackpoints );
1493 tr->trackpoints = NULL;