1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272
|
using System;
using System.Collections;
using System.Collections.Generic;
using System.Drawing.Drawing2D;
using System.IO;
using System.Text;
using System.Xml;
using System.Xml.Serialization;
using QuickRoute.BusinessEntities.Importers.GPX.GPX11;
using System.Drawing;
using System.Globalization;
using Wintellect.PowerCollections;
namespace QuickRoute.BusinessEntities
{
[Serializable]
public class Session
{
#region Private fields
private SessionInfo sessionInfo = new SessionInfo();
private Route route;
private LongLat projectionOrigin;
private GeneralMatrix initialTransformationMatrix;
[NonSerialized]
private AdjustedRoute adjustedRoute;
[NonSerialized]
private List<AlphaAdjustmentChange> alphaAdjustmentChanges;
private LapCollection laps;
private HandleCollection handles = new HandleCollection();
private SessionSettings settings = new SessionSettings();
#endregion
#region Constructors
public Session(Route route, LapCollection laps, Size mapSize, SessionSettings settings)
: this(route, laps, mapSize, null, route.CenterLongLat(), settings) { }
public Session(Route route, LapCollection laps, Size mapSize, GeneralMatrix initialTransformationMatrix, SessionSettings settings)
: this(route, laps, mapSize, initialTransformationMatrix, null, settings) { }
public Session(Route route, LapCollection laps, Size mapSize, GeneralMatrix initialTransformationMatrix, LongLat projectionOrigin, SessionSettings settings)
{
this.route = route;
this.route.SuppressWaypointAttributeCalculation = true;
this.route.SmoothingIntervals = settings.SmoothingIntervals;
this.laps = laps;
this.projectionOrigin = projectionOrigin ?? route.CenterLongLat();
this.settings = settings;
this.initialTransformationMatrix = initialTransformationMatrix ??
RouteAdjustmentManager.CreateInitialTransformationMatrix(this.route, mapSize, this.projectionOrigin);
this.route.SuppressWaypointAttributeCalculation = false;
Initialize(true);
}
#endregion
#region Public properties
public SessionInfo SessionInfo
{
get { return sessionInfo ?? new SessionInfo(); }
set { sessionInfo = value; }
}
public Route Route
{
get { return route; }
set { route = value; }
}
public LongLat ProjectionOrigin
{
get { return projectionOrigin; }
set { projectionOrigin = value; }
}
public AdjustedRoute AdjustedRoute
{
get { return adjustedRoute; }
}
public LapCollection Laps
{
get { return laps; }
set { laps = value; }
}
public Handle[] Handles
{
get
{
ArrayList handleArrayList = new ArrayList();
foreach (var h in handles)
{
if (h.Type == Handle.HandleType.Handle) handleArrayList.Add(h);
}
return handleArrayList.ToArray(typeof(Handle)) as Handle[];
}
}
public Handle StartHandle
{
get { return (handles.Count > 0 ? handles[0] : null); }
}
public Handle EndHandle
{
get { return (handles.Count == 0 ? null : handles[handles.Count - 1]); }
}
public SessionSettings Settings
{
get { return settings; }
set
{
settings = value;
route.SmoothingIntervals = settings.SmoothingIntervals;
}
}
public List<AlphaAdjustmentChange> AlphaAdjustmentChanges
{
get { return alphaAdjustmentChanges; }
set
{
alphaAdjustmentChanges = value;
if (alphaAdjustmentChanges != null) alphaAdjustmentChanges.Sort();
}
}
public GeneralMatrix InitialTransformationMatrix
{
get { return initialTransformationMatrix; }
set { initialTransformationMatrix = value; }
}
#endregion
#region Public methods
public void Initialize(bool routeChanged)
{
SetLapTimesToRoute(route);
route.CalculateWaypointAttributes(routeChanged);
route.EnsureUtcTimes();
laps.EnsureUtcTimes();
CreateAdjustedRoute();
}
/// <summary>
/// To be called when a handle is added/deleted/moved. Transformation matrices are recalculated and the adjusted route is updated.
/// </summary>
/// <param name="h">The handle</param>
public void UpdateHandle(Handle h)
{
UpdateTransformationMatrices(h);
CreateAdjustedRoute();
}
//public void CreateAdjustedRoute_old()
//{
// adjustedRoute = new AdjustedRoute();
// for (int i = 0; i < route.Segments.Count; i++)
// {
// adjustedRoute.Segments.Add(new AdjustedRouteSegment());
// }
// if (StartHandle == null)
// {
// // no handles, use the initial transformation matrix for all adjusted waypoints
// for (int i = 0; i < route.Segments.Count; i++)
// {
// for (int j = 0; j < route.Segments[i].Waypoints.Count; j++)
// {
// Waypoint waypoint = route.Segments[i].Waypoints[j];
// PointD location = LinearAlgebraUtil.Transform(waypoint.LongLat.Project(projectionOrigin), initialTransformationMatrix);
// adjustedRoute.Segments[i].Waypoints.Add(new AdjustedWaypoint(location, new ParameterizedLocation(i, j)));
// }
// }
// }
// else
// {
// // there are handles, use them
// //1. Create parameterized location list for adjusted route. Include
// // a) handles
// // b) waypoints from route
// List<PLWithKey> plList = new List<PLWithKey>();
// foreach (Handle h in handles)
// {
// PLWithKey pwk = new PLWithKey(PLKey.Handle, h.ParameterizedLocation);
// plList.Add(pwk);
// }
// for (int i = 0; i < route.Segments.Count; i++)
// {
// RouteSegment rs = route.Segments[i];
// for (int j = 0; j < rs.Waypoints.Count; j++)
// {
// // todo: if a faster route line drawing is desired, don't add all waypoint locations to the list. Use some algorithm to determine which waypoints to throw away (e g these where acceleration is nearly constant). Have a look at Garmin FR305 Smart data recording algorithm.
// PLWithKey pwk = new PLWithKey(PLKey.Waypoint, new ParameterizedLocation(i, j));
// plList.Add(pwk);
// }
// }
// plList.Sort();
// // 2. Create and add an adjusted waypoint for each location in this list
// Handle previousHandle = StartHandle;
// Handle nextHandle = StartHandle;
// double previousHandleDistance = 0;
// double nextHandleDistance = 0;
// int handleIndex = -1;
// foreach (PLWithKey pwk in plList)
// {
// Waypoint w;
// PointD location0;
// PointD location1;
// double distance;
// if (pwk.Key == PLKey.Handle)
// {
// handleIndex++;
// previousHandle = handles[handleIndex];
// previousHandleDistance = route.GetDistanceFromParameterizedLocation(previousHandle.ParameterizedLocation);
// nextHandle = handleIndex < handles.Count - 1 ? handles[handleIndex + 1] : handles[handleIndex];
// nextHandleDistance = route.GetDistanceFromParameterizedLocation(nextHandle.ParameterizedLocation);
// w = route.CreateWaypointFromParameterizedLocation(pwk);
// location0 = LinearAlgebraUtil.Transform(w.LongLat.Project(projectionOrigin), previousHandle.TransformationMatrix);
// location1 = LinearAlgebraUtil.Transform(w.LongLat.Project(projectionOrigin), nextHandle.TransformationMatrix);
// distance = route.GetDistanceFromParameterizedLocation(pwk);
// }
// else
// {
// if (pwk == previousHandle.ParameterizedLocation)
// {
// continue;
// }
// w = route.Segments[pwk.SegmentIndex].Waypoints[(int)pwk.Value];
// location0 = LinearAlgebraUtil.Transform(w.LongLat.Project(projectionOrigin), previousHandle.TransformationMatrix);
// location1 = LinearAlgebraUtil.Transform(w.LongLat.Project(projectionOrigin), nextHandle.TransformationMatrix);
// distance = w.Distance;
// }
// double t;
// if (nextHandleDistance == previousHandleDistance)
// {
// t = 0;
// }
// else
// {
// t = (distance - previousHandleDistance) / (nextHandleDistance - previousHandleDistance);
// }
// AdjustedWaypoint aw = new AdjustedWaypoint((1 - t) * location0 + t * location1, pwk);
// adjustedRoute.Segments[pwk.SegmentIndex].Waypoints.Add(aw);
// }
// }
//}
/// <summary>
/// Creates an adjusted route based on the handles.
/// </summary>
public void CreateAdjustedRoute()
{
adjustedRoute = new AdjustedRoute();
for (int i = 0; i < route.Segments.Count; i++)
{
adjustedRoute.Segments.Add(new AdjustedRouteSegment());
}
if (StartHandle == null)
{
// no handles, use the initial transformation matrix for all adjusted waypoints
for (int i = 0; i < route.Segments.Count; i++)
{
for (int j = 0; j < route.Segments[i].Waypoints.Count; j++)
{
Waypoint waypoint = route.Segments[i].Waypoints[j];
PointD location = LinearAlgebraUtil.Transform(waypoint.LongLat.Project(projectionOrigin), initialTransformationMatrix);
adjustedRoute.Segments[i].Waypoints.Add(new AdjustedWaypoint(location, new ParameterizedLocation(i, j)));
}
}
}
else
{
// there are handles, use them
//1. Create parameterized location list for adjusted route. Include
// a) handles
// b) waypoints from route
List<PLWithKey> plList = new List<PLWithKey>();
// handles
foreach (Handle h in handles)
{
PLWithKey pwk = new PLWithKey(PLKey.Handle, h.ParameterizedLocation);
plList.Add(pwk);
}
// waypoints
for (int i = 0; i < route.Segments.Count; i++)
{
RouteSegment rs = route.Segments[i];
for (int j = 0; j < rs.Waypoints.Count; j++)
{
// todo: if a faster route line drawing is desired, don't add all waypoint locations to the list. Use some algorithm to determine which waypoints to throw away (e g these where acceleration is nearly constant). Have a look at Garmin FR305 Smart data recording algorithm.
PLWithKey pwk = new PLWithKey(PLKey.Waypoint, new ParameterizedLocation(i, j));
plList.Add(pwk);
}
}
plList.Sort();
// 2. Create and add an adjusted waypoint for each location in this list
Handle currentHandle = StartHandle;
int handleIndex = -1;
foreach (PLWithKey pwk in plList)
{
Waypoint w;
if (pwk.Key == PLKey.Handle)
{
if (handleIndex < handles.Count - 2 || handleIndex == -1) handleIndex++;
currentHandle = handles[handleIndex];
w = route.CreateWaypointFromParameterizedLocation(pwk);
}
else
{
w = route.Segments[pwk.SegmentIndex].Waypoints[(int)pwk.Value];
}
PointD location = LinearAlgebraUtil.Transform(w.LongLat.Project(projectionOrigin), currentHandle.TransformationMatrix);
AdjustedWaypoint aw = new AdjustedWaypoint(location, pwk);
adjustedRoute.Segments[pwk.SegmentIndex].Waypoints.Add(aw);
}
}
}
public Color GetColorFromParameterizedLocation(ParameterizedLocation pl, WaypointAttribute colorCodingAttribute)
{
RouteLineSettings rls = settings.RouteLineSettingsCollection[colorCodingAttribute];
//// determining value according to current attribute: pace, heart rate or altitude
double? value = route.GetAttributeFromParameterizedLocation(colorCodingAttribute, pl);
// experimental: dashed route
//RouteLineSettings rls = settings.RouteLineSettingsCollection[DashedAdjustedWaypointCreator.experimental_dashWaypointAttribute];
//if (value != null)
//{
// value = ((int) (value/250.0))%2 == 0 ? rls.ColorRange.StartValue : rls.ColorRange.EndValue;
//}
// need to check whether this is the end of a map reading, if so we need to reset the value so that the line following this waypoint will indicate "not reading"
if (colorCodingAttribute == WaypointAttribute.MapReadingDuration && pl.IsNode && Route.CreateWaypointFromParameterizedLocation(pl).MapReadingState == MapReadingState.EndReading)
{
value = 0;
}
Color color = rls.ColorRange.GetColor(value == null ? 0 : (double)value);
return color;
}
public GeneralMatrix GetTransformationMatrixFromParameterizedLocation(ParameterizedLocation parameterizedLocation)
{
switch (handles.Count)
{
case 0:
return initialTransformationMatrix;
case 1:
return handles[0].TransformationMatrix;
default:
for (int i = 0; i < handles.Count; i++)
{
if (parameterizedLocation <= handles[i].ParameterizedLocation) return handles[i].TransformationMatrix;
}
return EndHandle.TransformationMatrix;
}
}
/// <summary>
/// Calculates the real-world length of one map pixel.
/// </summary>
/// <returns>The length in meters.</returns>
public double GetPixelScale()
{
double sum = 0;
for (int i = 0; i < handles.Count - 1; i++)
{
double unitLength = LinearAlgebraUtil.GetUnitLengthFromTransformationMatrix(handles[i].TransformationMatrix.Inverse());
ElapsedTime startTime = new ElapsedTime((i == 0
? route.FirstWaypoint.Attributes[WaypointAttribute.ElapsedTime].Value
: route.GetAttributeFromParameterizedLocation(WaypointAttribute.ElapsedTime, handles[i].ParameterizedLocation).Value));
ElapsedTime endTime = new ElapsedTime((i == handles.Count - 2
? route.LastWaypoint.Attributes[WaypointAttribute.ElapsedTime].Value
: route.GetAttributeFromParameterizedLocation(WaypointAttribute.ElapsedTime, handles[i + 1].ParameterizedLocation).Value));
sum += unitLength * (endTime.Value - startTime.Value);
}
return route.LastWaypoint.Attributes[WaypointAttribute.ElapsedTime].Value - route.FirstWaypoint.Attributes[WaypointAttribute.ElapsedTime].Value == 0
? 0
: sum / (route.LastWaypoint.Attributes[WaypointAttribute.ElapsedTime].Value - route.FirstWaypoint.Attributes[WaypointAttribute.ElapsedTime].Value);
}
public void AddHandle(Handle h)
{
handles.Add(h);
}
public bool RemoveHandle(Handle h)
{
return handles.Remove(h);
}
public int IndexOfHandle(Handle h)
{
return handles.IndexOf(h);
}
public bool ContainsHandle(Handle h)
{
return handles.Contains(h);
}
public HandleCollection.CutHandlesData CutHandles(ParameterizedLocation parameterizedLocation, CutType cutType)
{
return handles.Cut(parameterizedLocation, cutType);
}
public void UnCutHandles(HandleCollection.CutHandlesData cutHandlesData)
{
handles.UnCut(cutHandlesData);
}
public double GetLapDirectionFromParameterizedLocation(ParameterizedLocation pl)
{
if (laps == null) return 0;
int lapIndex = GetLapIndexFromParameterizedLocation(pl);
LongLat longLat0 = route.GetLocationFromParameterizedLocation(route.GetParameterizedLocationFromTime(laps[lapIndex].Time));
LongLat longLat1 = route.GetLocationFromParameterizedLocation(route.GetParameterizedLocationFromTime(laps[lapIndex + 1].Time));
LongLat middle = longLat0 / 2 + longLat1 / 2;
PointD p0 = longLat0.Project(middle);
PointD p1 = longLat1.Project(middle);
return LinearAlgebraUtil.AnglifyD(LinearAlgebraUtil.ToDegrees(LinearAlgebraUtil.GetVectorDirectionR(p0, p1)), AngleStyle.N360CW);
}
public void DrawRoute(double zoom, Graphics graphics, Document.RouteDrawingMode mode, WaypointAttribute colorCodingAttribute, WaypointAttribute? secondaryColorCodingAttribute, SessionSettings sessionSettings)
{
// use this session's settings if no settings are specified
var rls = sessionSettings == null
? Settings.RouteLineSettingsCollection[colorCodingAttribute]
: sessionSettings.RouteLineSettingsCollection[colorCodingAttribute];
switch (mode)
{
case Document.RouteDrawingMode.Simple:
foreach (var ars in AdjustedRoute.Segments)
{
if (ars.Waypoints.Count > 1)
{
var points = new PointF[ars.Waypoints.Count];
for (var i = 0; i < ars.Waypoints.Count; i++)
{
points[i] = (PointF)(zoom * ars.Waypoints[i].Location);
}
// use monochrome color and width
var pen = new Pen(rls.MonochromeColor, (float)(zoom * (rls.MonochromeWidth))) { LineJoin = LineJoin.Round };
graphics.DrawLines(pen, points);
pen.Dispose();
}
}
break;
case Document.RouteDrawingMode.Extended:
double lineWidth = rls.Width;
double maskWidth = (rls.MaskVisible ? rls.MaskWidth : 0);
List<RouteLineVertex> vertices = CreateRouteLineVertices(
AdjustedRoute.GetFirstParameterizedLocation(),
AdjustedRoute.GetLastParameterizedLocation(),
colorCodingAttribute,
secondaryColorCodingAttribute);
// filter vertices
vertices = FilterVertices(vertices, AdjustedRoute);
for (int i = 0; i < vertices.Count - 1; i++)
{
if (vertices[i].ParameterizedLocation.SegmentIndex == vertices[i + 1].ParameterizedLocation.SegmentIndex)
{
RouteLineVertex previousVertex = (i > 0 &&
vertices[i - 1].ParameterizedLocation.SegmentIndex ==
vertices[i].ParameterizedLocation.SegmentIndex
? vertices[i - 1]
: null);
RouteLineVertex nextVertex = (i < vertices.Count - 2 &&
vertices[i + 2].ParameterizedLocation.SegmentIndex ==
vertices[i + 1].ParameterizedLocation.SegmentIndex
? vertices[i + 2]
: null);
var splitLine = secondaryColorCodingAttribute.HasValue;
var line = new RouteLine(
vertices[i],
vertices[i + 1],
previousVertex,
nextVertex,
lineWidth,
maskWidth,
zoom,
splitLine);
Brush b;
Color maskColor = GraphicsUtil.AlphaAdjustColor(rls.MaskColor, vertices[i].AlphaAdjustment);
if (splitLine)
{
var leftLineColor = GraphicsUtil.AlphaAdjustColor(vertices[i].Color, vertices[i].AlphaAdjustment);
b = new SolidBrush(leftLineColor);
graphics.FillPath(b, line.LeftLinePath);
b.Dispose();
var rightLineColor = GraphicsUtil.AlphaAdjustColor(vertices[i].SecondaryColor.Value, vertices[i].AlphaAdjustment);
b = new SolidBrush(rightLineColor);
graphics.FillPath(b, line.RightLinePath);
b.Dispose();
}
else
{
var lineColor = GraphicsUtil.AlphaAdjustColor(vertices[i].Color, vertices[i].AlphaAdjustment);
b = new SolidBrush(lineColor);
graphics.FillPath(b, line.LinePath);
b.Dispose();
}
b = new SolidBrush(maskColor);
if (line.MaskPath != null) graphics.FillPath(b, line.MaskPath);
b.Dispose();
}
}
break;
case Document.RouteDrawingMode.None:
// don't draw anything
break;
}
}
public List<PointD> GetAdjustedWaypointLocations(IList<int> legs)
{
var vertices = new List<PointD>();
bool[] legExists = new bool[laps.Count - 1];
for (int i = 1; i < laps.Count; i++)
{
legExists[i - 1] = legs.Contains(i - 1);
}
bool currentState = false;
var breakpoints = new List<ParameterizedLocation>();
for (int i = 0; i < laps.Count - 1; i++)
{
if (legExists[i] != currentState)
{
breakpoints.Add(route.GetParameterizedLocationFromTime(laps[i].Time));
currentState = !currentState;
}
}
if (currentState) breakpoints.Add(route.GetParameterizedLocationFromTime(laps[laps.Count - 1].Time));
int currentBreakpoint = 0;
currentState = false;
foreach (var w in adjustedRoute.GetAllWaypoints())
{
if ((!currentState && w.ParameterizedLocation >= breakpoints[currentBreakpoint])
||
(currentState && w.ParameterizedLocation > breakpoints[currentBreakpoint]))
{
currentState = !currentState;
currentBreakpoint++;
}
if (currentState) vertices.Add(w.Location);
if (currentBreakpoint > breakpoints.Count - 1) break;
}
return vertices;
}
public void AddTimeOffset(TimeSpan offset)
{
route.AddTimeOffset(offset);
laps.AddTimeOffset(offset);
SetLapTimesToRoute();
}
public Route CreateRouteAdaptedToSingleTransformationMatrix(GeneralMatrix transformationMatrix)
{
return CreateRouteAdaptedToSingleTransformationMatrix(this);
}
public Route CreateRouteAdaptedToSingleTransformationMatrix(Session baseSession)
{
var transformationMatrix = baseSession.CalculateAverageTransformation().TransformationMatrix;
var transformationMatrixInverse = transformationMatrix.Inverse();
var routeSegments = new List<RouteSegment>();
foreach (var ars in adjustedRoute.Segments)
{
var routeSegment = new RouteSegment();
foreach (var aw in ars.Waypoints)
{
var newWaypoint = route.CreateWaypointFromParameterizedLocation(aw.ParameterizedLocation);
// create pixel location
var projectedLocation = LinearAlgebraUtil.Transform(aw.Location, transformationMatrixInverse);
newWaypoint.LongLat = LongLat.Deproject(projectedLocation, baseSession.ProjectionOrigin);
routeSegment.Waypoints.Add(newWaypoint);
}
routeSegments.Add(routeSegment);
}
var r = new Route(routeSegments);
SetLapTimesToRoute(r);
r.SmoothingIntervals = route.SmoothingIntervals;
return r;
}
/// <summary>
/// Using linear least squares algorithm described at http://en.wikipedia.org/wiki/Linear_least_squares
/// </summary>
/// <returns></returns>
public Transformation CalculateAverageTransformation()
{
return new SessionCollection { this }.CalculateAverageTransformation();
}
/// <summary>
/// Used to keep internal route lap time list and laps in sync
/// </summary>
public void SetLapTimesToRoute()
{
SetLapTimesToRoute(route);
}
#endregion
#region Private methods
private void UpdateTransformationMatrices(Handle activeHandle)
{
switch (handles.Count)
{
case 0:
break;
case 1:
{
// perform translation of whole route
GeneralMatrix newTransformationMatrix = (GeneralMatrix)initialTransformationMatrix.Clone();
PointD initialProjectedLocation =
route.GetProjectedLocationFromParameterizedLocation(activeHandle.ParameterizedLocation, projectionOrigin);
PointD initialAdjustedLocation = LinearAlgebraUtil.Transform(initialProjectedLocation,
initialTransformationMatrix);
PointD translation = activeHandle.Location - initialAdjustedLocation;
newTransformationMatrix.SetElement(0, 2, newTransformationMatrix.GetElement(0, 2) + translation.X);
newTransformationMatrix.SetElement(1, 2, newTransformationMatrix.GetElement(1, 2) + translation.Y);
activeHandle.TransformationMatrix = newTransformationMatrix;
break;
}
default:
{
// perform scaling and rotation for the handle pairs that the active handle is part of
int activeHandleIndex = handles.IndexOf(activeHandle);
if (activeHandleIndex > 0)
{
Handle firstHandle = handles[activeHandleIndex - 1];
Handle secondHandle = activeHandle;
firstHandle.TransformationMatrix = LinearAlgebraUtil.CalculateTransformationMatrix(
route.GetProjectedLocationFromParameterizedLocation(firstHandle.ParameterizedLocation, projectionOrigin),
firstHandle.Location,
route.GetProjectedLocationFromParameterizedLocation(secondHandle.ParameterizedLocation, projectionOrigin),
secondHandle.Location,
firstHandle.TransformationMatrix,
true
);
}
if (activeHandleIndex < handles.Count - 1)
{
Handle firstHandle = activeHandle;
Handle secondHandle = handles[activeHandleIndex + 1];
firstHandle.TransformationMatrix = LinearAlgebraUtil.CalculateTransformationMatrix(
route.GetProjectedLocationFromParameterizedLocation(firstHandle.ParameterizedLocation, projectionOrigin),
firstHandle.Location,
route.GetProjectedLocationFromParameterizedLocation(secondHandle.ParameterizedLocation, projectionOrigin),
secondHandle.Location,
firstHandle.TransformationMatrix,
true
);
}
}
break;
}
}
private int GetLapIndexFromParameterizedLocation(ParameterizedLocation pl)
{
DateTime time = route.GetTimeFromParameterizedLocation(pl);
if (laps == null || laps.Count == 0 || time < laps[0].Time) return 0;
for (int i = 1; i < laps.Count - 1; i++)
{
if (laps[i].Time >= time) return i - 1;
}
return laps.Count - 2;
}
/// <summary>
/// Reduces the number of vertices by removing "unnecessary" vertices, eg those that do not differ much in color and won't change the direction of the line much.
/// </summary>
private static List<RouteLineVertex> FilterVertices(IList<RouteLineVertex> vertices, AdjustedRoute adjustedRoute)
{
const double colorDistanceThreshold = 32;
const double distanceFromLineThreshold = 0.5;
const int maxSubsequentSkippedVertices = 10;
var filteredVertices = new List<RouteLineVertex>();
var lastIndex = 0;
for (var i = 0; i < vertices.Count; i++)
{
var includeVertex = i == 0 || // always include first vertex
i == vertices.Count - 1 || // always include last vertex
adjustedRoute.IsStartOfSegment(vertices[i].ParameterizedLocation) || // always include first vertex of route segment
adjustedRoute.IsEndOfSegment(vertices[i].ParameterizedLocation) || // always include first vertex of route segment
vertices[i].SecondaryColor != null || // currently no filtering when secondary colors are used
i - lastIndex >= maxSubsequentSkippedVertices; // not too many vertices in a row can be skipped
if (!includeVertex)
{
var colorDistance = ColorDistance(GraphicsUtil.AlphaAdjustColor(vertices[lastIndex].Color, vertices[lastIndex].AlphaAdjustment),
GraphicsUtil.AlphaAdjustColor(vertices[i].Color, vertices[i].AlphaAdjustment));
if(colorDistance >= colorDistanceThreshold)
{
includeVertex = true;
}
else
{
double t;
var distanceFromLine = LinearAlgebraUtil.ClosestDistancePointToLine(vertices[i].Location,
vertices[lastIndex].Location,
vertices[i + 1].Location,
out t);
if (distanceFromLine >= distanceFromLineThreshold) includeVertex = true;
}
}
if (includeVertex)
{
if (filteredVertices.Count > 0 && i - lastIndex > 1)
{
// adjust color of last vertex to an average of the vertex and all skipped vertices
var averageList = new List<Color>();
for(var j = lastIndex; j < i; j++)
{
averageList.Add(vertices[j].Color);
}
vertices[lastIndex].Color = GraphicsUtil.CombineColors(averageList.ToArray());
}
filteredVertices.Add(vertices[i]);
lastIndex = i;
}
}
return filteredVertices;
}
private static double ColorDistance(Color color1, Color color2)
{
return Math.Sqrt(
(color1.A-color2.A)*(color1.A-color2.A) +
(color1.R-color2.R)*(color1.R-color2.R) +
(color1.G-color2.G)*(color1.G-color2.G) +
(color1.B-color2.B)*(color1.B-color2.B));
}
private List<RouteLineVertex> CreateRouteLineVertices(
ParameterizedLocation startPL, ParameterizedLocation endPL,
WaypointAttribute colorCodingAttribute, WaypointAttribute? secondaryColorCodingAttribute)
{
// Points to use:
// 1. Points in adjusted route
// 2. Start and end points
// 3. Points where alpha adjustment changes
// Don't insert points from category 2 if there already is a point with the same PL in category 1
// Don't insert points from category 3 if there already is a point with the same PL in category 1 or 2
// 1. Points in adjusted route
var adjustedWaypoints = new List<AdjustedWaypoint>(new DefaultAdjustedWaypointCreator().Create(adjustedRoute, startPL, endPL, this));
// experimental: dashed route
//var adjustedWaypoints = new List<AdjustedWaypoint>(new DashedAdjustedWaypointCreator().Create(adjustedRoute, startPL, endPL, this));
// 2. Start and end points
AdjustedWaypoint startWaypoint = AdjustedRoute.CreateWaypointFromParameterizedLocation(startPL, AdjustedWaypoint.AdjustedWaypointType.Start);
AdjustedWaypoint endWaypoint = AdjustedRoute.CreateWaypointFromParameterizedLocation(startPL, AdjustedWaypoint.AdjustedWaypointType.End);
adjustedWaypoints.Add(startWaypoint);
adjustedWaypoints.Add(endWaypoint);
// 3. Points where alpha adjustment changes
if (AlphaAdjustmentChanges != null)
{
foreach (AlphaAdjustmentChange aac in AlphaAdjustmentChanges)
{
AdjustedWaypoint w = AdjustedRoute.CreateWaypointFromParameterizedLocation(aac.ParameterizedLocation, AdjustedWaypoint.AdjustedWaypointType.AlphaAdjustmentChange);
adjustedWaypoints.Add(w);
}
}
adjustedWaypoints.Sort();
// Don't insert points from category 2 if there already is a point with the same PL in category 1
// Don't insert points from category 3 if there already is a point with the same PL in category 1 or 2
for (int i = adjustedWaypoints.Count - 1; i >= 1; i--)
{
if (adjustedWaypoints[i].ParameterizedLocation == adjustedWaypoints[i - 1].ParameterizedLocation)
adjustedWaypoints.RemoveAt(i);
}
// create route line vertices
var vertices = new List<RouteLineVertex>();
double currentAlphaAdjustment = 0;
int currentAlphaAdjustmentIndex = -1;
foreach (AdjustedWaypoint aw in adjustedWaypoints)
{
while (AlphaAdjustmentChanges != null &&
currentAlphaAdjustmentIndex + 1 < AlphaAdjustmentChanges.Count &&
AlphaAdjustmentChanges[currentAlphaAdjustmentIndex + 1].ParameterizedLocation <=
aw.ParameterizedLocation)
{
currentAlphaAdjustmentIndex++;
currentAlphaAdjustment = AlphaAdjustmentChanges[currentAlphaAdjustmentIndex].AlphaAdjustment;
}
var vertex = new RouteLineVertex();
vertex.Location = aw.Location;
vertex.Color = GetColorFromParameterizedLocation(aw.ParameterizedLocation, colorCodingAttribute);
// experimental: dashed route
//vertex.Color = GetColorFromParameterizedLocation(aw.ParameterizedLocation, DashedAdjustedWaypointCreator.experimental_dashWaypointAttribute);
if (secondaryColorCodingAttribute.HasValue) vertex.SecondaryColor = GetColorFromParameterizedLocation(aw.ParameterizedLocation, secondaryColorCodingAttribute.Value);
vertex.AlphaAdjustment = currentAlphaAdjustment;
vertex.ParameterizedLocation = aw.ParameterizedLocation;
vertices.Add(vertex);
}
return vertices;
}
/// <summary>
/// Used to keep internal route lap time list and laps in sync
/// </summary>
/// <param name="r"></param>
private void SetLapTimesToRoute(Route r)
{
var lapTimes = new OrderedBag<DateTime>();
foreach (var l in Laps)
{
lapTimes.Add(l.Time.ToUniversalTime());
}
r.LapTimes = lapTimes;
}
#endregion
#region Nested type: RouteLineVertex
private class RouteLineVertex
{
private double alphaAdjustment;
public PointD Location { get; set; }
public Color Color { get; set; }
public Color? SecondaryColor { get; set; }
public ParameterizedLocation ParameterizedLocation { get; set; }
public double AlphaAdjustment
{
get { return alphaAdjustment; }
set
{
if (value < -1 || value > 1)
throw new ArgumentOutOfRangeException("Alpha adjustment must be between -1 and 1, inclusive.");
alphaAdjustment = value;
}
}
}
#endregion
#region Nested type: RouteLine
private class RouteLine
{
public RouteLine(RouteLineVertex startVertex, RouteLineVertex endVertex, RouteLineVertex previousVertex,
RouteLineVertex nextVertex, double lineWidth, double maskWidth, double zoom, bool splitLine)
{
PointD p0 = zoom * (previousVertex ?? startVertex).Location;
PointD p1 = zoom * startVertex.Location;
PointD p2 = zoom * endVertex.Location;
PointD p3 = zoom * (nextVertex ?? endVertex).Location;
PointD directionVector = LinearAlgebraUtil.Normalize(p1 - p0);
if (p0.X == p1.X && p0.Y == p1.Y)
{
p0 = p1 - directionVector;
}
if (p3.X == p2.X && p3.Y == p2.Y)
{
p3 = p2 + directionVector;
}
if(splitLine)
{
LeftLinePath = CreatePath(p1, p2, p1 - p0, p3 - p2, -zoom * lineWidth / 2, 0, previousVertex == null,
nextVertex == null);
RightLinePath = CreatePath(p1, p2, p1 - p0, p3 - p2, zoom * lineWidth / 2, 0, previousVertex == null,
nextVertex == null);
}
else
{
LinePath = CreatePath(p1, p2, p1 - p0, p3 - p2, zoom * lineWidth / 2, -zoom * lineWidth / 2, previousVertex == null,
nextVertex == null);
}
if (zoom * maskWidth > 0)
{
GraphicsPath leftMaskPath = CreatePath(p1, p2, p1 - p0, p3 - p2, zoom * (lineWidth / 2 + maskWidth),
zoom * lineWidth / 2, previousVertex == null, nextVertex == null);
GraphicsPath rightMaskPath = CreatePath(p1, p2, p1 - p0, p3 - p2, zoom * (-lineWidth / 2 - maskWidth),
zoom * -lineWidth / 2, previousVertex == null, nextVertex == null);
MaskPath = new GraphicsPath(FillMode.Winding);
MaskPath.AddPath(leftMaskPath, false);
MaskPath.AddPath(rightMaskPath, false);
}
}
public GraphicsPath LinePath { get; private set; }
public GraphicsPath LeftLinePath { get; private set; }
public GraphicsPath RightLinePath { get; private set; }
public GraphicsPath MaskPath { get; private set; }
// TODO: add support for bool isStartOfLine, bool isEndOfLine
private static GraphicsPath CreatePath(PointD p1, PointD p2, PointD d0, PointD d2, double t0, double t1,
bool isStartOfLine, bool isEndOfLine)
{
const double EPSILON = 0.000001;
PointD d1 = p2 - p1;
PointD n0 = LinearAlgebraUtil.GetNormalVector(d0);
PointD n1 = LinearAlgebraUtil.GetNormalVector(d1);
PointD n2 = LinearAlgebraUtil.GetNormalVector(d2);
PointD c0 = LinearAlgebraUtil.GetNormalVector(LinearAlgebraUtil.Normalize(d0) + LinearAlgebraUtil.Normalize(d1));
PointD c1 = LinearAlgebraUtil.GetNormalVector(LinearAlgebraUtil.Normalize(d1) + LinearAlgebraUtil.Normalize(d2));
bool parallell0 = (Math.Abs(LinearAlgebraUtil.GetAngleR(d0) - LinearAlgebraUtil.GetAngleR(d1)) < EPSILON);
bool parallell1 = (Math.Abs(LinearAlgebraUtil.GetAngleR(d1) - LinearAlgebraUtil.GetAngleR(d2)) < EPSILON);
PointD start;
PointD end;
PointD previousPoint;
// t0
PointD q00e = p1 + t0 * n0;
PointD q01s = p1 + t0 * n1;
PointD q01e = p2 + t0 * n1;
PointD q02s = p2 + t0 * n2;
// t1
PointD q10e = p1 + t1 * n0;
PointD q11s = p1 + t1 * n1;
PointD q11e = p2 + t1 * n1;
PointD q12s = p2 + t1 * n2;
var path = new GraphicsPath(FillMode.Winding);
double i00t;
bool i00 = LinearAlgebraUtil.LineInfiniteLineIntersect(q01s, q01e, q00e, d0, out i00t);
double i01t;
bool i01 = LinearAlgebraUtil.LineInfiniteLineIntersect(q01s, q01e, q02s, d2, out i01t);
double i10t;
bool i10 = LinearAlgebraUtil.LineInfiniteLineIntersect(q11s, q11e, q10e, d0, out i10t);
double i11t;
bool i11 = LinearAlgebraUtil.LineInfiniteLineIntersect(q11s, q11e, q12s, d2, out i11t);
if (i00t < 0 && Math.Abs(t0) > 0)
{
var startAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(t0 * c0));
var sweepAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(c0, n1));
path.AddArc(
new RectangleF((float)(p1.X - Math.Abs(t0)), (float)(p1.Y - Math.Abs(t0)), (float)(2 * Math.Abs(t0)),
(float)(2 * Math.Abs(t0))),
startAngle,
sweepAngle
);
}
if (parallell0) start = q01s;
else if (i00) start = q01s + i00t * (q01e - q01s);
//else if (i00t > 1) start = LinearAlgebraUtil.InfiniteLinesIntersectionPoint(q01s, d1, P0, t0 * n1);
else start = q01s;
if (parallell1) end = q01e;
else if (i01) end = q01s + i01t * (q01e - q01s);
//else if (i01t < 0) end = LinearAlgebraUtil.InfiniteLinesIntersectionPoint(p2, t0 * c1, p1, t0 * c0);
else end = q01e;
path.AddLine((PointF)start, (PointF)end);
if (i01t > 1 && Math.Abs(t0) > 0)
{
var startAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(t0 * n1));
var sweepAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(n1, c1));
path.AddArc(
new RectangleF((float)(p2.X - Math.Abs(t0)), (float)(p2.Y - Math.Abs(t0)), (float)(2 * Math.Abs(t0)),
(float)(2 * Math.Abs(t0))),
startAngle,
sweepAngle
);
previousPoint = p2 + t0 * c1;
}
else
{
previousPoint = end;
}
if (Math.Sign(t0) != Math.Sign(t1) && t0 != 0 && t1 != 0)
{
path.AddLine((PointF)previousPoint, (PointF)p2);
}
if (!parallell0 && i10) start = q11s + i10t * (q11e - q11s);
else start = q11s;
if (!parallell1 && i11) end = q11s + i11t * (q11e - q11s);
else end = q11e;
if (i11t > 1 && Math.Abs(t1) > 0)
{
var startAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(t1 * c1));
var sweepAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(c1, n1));
path.AddArc(
new RectangleF((float)(p2.X - Math.Abs(t1)), (float)(p2.Y - Math.Abs(t1)), (float)(2 * Math.Abs(t1)),
(float)(2 * Math.Abs(t1))),
startAngle,
sweepAngle
);
}
path.AddLine((PointF)end, (PointF)start);
if (i10t < 0 && Math.Abs(t1) > 0)
{
var startAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(t1 * n1));
var sweepAngle = (float)(180 / Math.PI * LinearAlgebraUtil.GetAngleR(n1, c0));
path.AddArc(
new RectangleF((float)(p1.X - Math.Abs(t1)), (float)(p1.Y - Math.Abs(t1)), (float)(2 * Math.Abs(t1)),
(float)(2 * Math.Abs(t1))),
startAngle,
sweepAngle
);
previousPoint = p1 + t1 * c0;
}
else
{
previousPoint = start;
}
if (Math.Sign(t0) != Math.Sign(t1) && t0 != 0 && t1 != 0)
{
path.AddLine((PointF)previousPoint, (PointF)p1);
}
//path.AddEllipse(new RectangleF((float)(p1.X - Math.Abs(t1 / 5)), (float)(p1.Y - Math.Abs(t1 / 5)), (float)(2 * Math.Abs(t1 / 5)), (float)(2 * Math.Abs(t1 / 5))));
//path.AddEllipse(new RectangleF((float)(p2.X - Math.Abs(t1 / 5)), (float)(p2.Y - Math.Abs(t1 / 5)), (float)(2 * Math.Abs(t1 / 5)), (float)(2 * Math.Abs(t1 / 5))));
return path;
}
}
#endregion
private class PLWithKey : ParameterizedLocation, IComparable<PLWithKey>
{
private PLKey key;
public PLWithKey(PLKey key, ParameterizedLocation pl)
: base(pl.SegmentIndex, pl.Value)
{
this.key = key;
}
public PLKey Key
{
get { return key; }
set { key = value; }
}
#region IComparable<PLWithKey> Members
public int CompareTo(PLWithKey other)
{
int value = base.CompareTo(other);
if (value == 0)
{
return key.CompareTo(other.Key);
}
else
{
return value;
}
}
#endregion
}
private enum PLKey
{
Handle,
Waypoint
}
public void InsertIdleTime(DateTime time, TimeSpan duration)
{
if (duration.TotalSeconds < 0) throw new ArgumentException("The duration parameter must be positive.");
if (time < route.FirstWaypoint.Time)
{
AddTimeOffset(duration);
}
else if (time < route.LastWaypoint.Time)
{
// add offset to waypoints
var originalPL = route.GetParameterizedLocationFromTime(time).Ceiling();
var pl = new ParameterizedLocation(originalPL);
while(pl != null)
{
route.Segments[pl.SegmentIndex].Waypoints[(int) pl.Value].Time += duration;
pl = route.GetNextPLNode(pl, ParameterizedLocation.Direction.Forward);
}
// insert "freezing" waypoint just before first moved waypoint to keep
var waypointIndex = (int)originalPL.Value - 1;
if (waypointIndex > 0)
{
// use clone of previous waypoint as freezing waypoint
var freezingWaypoint = route.Segments[originalPL.SegmentIndex].Waypoints[waypointIndex - 1].Clone();
var firstMovedWaypoint = route.Segments[originalPL.SegmentIndex].Waypoints[waypointIndex];
freezingWaypoint.Time = firstMovedWaypoint.Time.AddMilliseconds(-1); // insert one millisecond before
route.Segments[originalPL.SegmentIndex].Waypoints.Insert(waypointIndex, freezingWaypoint);
}
// add offset to laps
foreach(var lap in laps)
{
if (lap.Time >= time) lap.Time += duration;
}
}
SetLapTimesToRoute();
}
}
[Serializable]
public class SessionInfo
{
private SessionPerson person = new SessionPerson();
private string description = "";
public SessionPerson Person
{
get { return person; }
set { person = value; }
}
public string Description
{
get { return description; }
set { description = value; }
}
}
[Serializable]
public class SessionPerson
{
public SessionPerson()
{
Name = "";
Club = "";
}
public string Name { get; set; }
public string Club { get; set; }
public uint Id { get; set; }
public override string ToString()
{
return Name + (!String.IsNullOrEmpty(Club) ? ", " + Club : "");
}
}
// experimental: dashed route
public static class AdjustmentWaypointFactory
{
public static IAdjustedWaypointCreator Create()
{
return new DefaultAdjustedWaypointCreator();
}
}
// experimental: dashed route
public interface IAdjustedWaypointCreator
{
IEnumerable<AdjustedWaypoint> Create(AdjustedRoute adjustedRoute, ParameterizedLocation startPL, ParameterizedLocation endPL, Session session);
}
public class DefaultAdjustedWaypointCreator : IAdjustedWaypointCreator
{
public IEnumerable<AdjustedWaypoint> Create(AdjustedRoute adjustedRoute, ParameterizedLocation startPL, ParameterizedLocation endPL, Session session)
{
var adjustedWaypoints = new List<AdjustedWaypoint>();
for (var i = startPL.SegmentIndex; i <= endPL.SegmentIndex; i++)
{
var ars = adjustedRoute.Segments[i];
for (var j = 0; j < ars.Waypoints.Count; j++)
{
var aw = ars.Waypoints[j];
if (aw.ParameterizedLocation >= startPL && aw.ParameterizedLocation <= endPL)
{
adjustedWaypoints.Add(aw);
}
}
}
return adjustedWaypoints;
}
}
// experimental: dashed route
public class DashedAdjustedWaypointCreator : IAdjustedWaypointCreator
{
public static WaypointAttribute experimental_dashWaypointAttribute = WaypointAttribute.Distance;
public static double experimental_dashLength = 250;
public IEnumerable<AdjustedWaypoint> Create(AdjustedRoute adjustedRoute, ParameterizedLocation startPL, ParameterizedLocation endPL, Session session)
{
var adjustedWaypoints = new List<AdjustedWaypoint>();
for (var i = startPL.SegmentIndex; i <= endPL.SegmentIndex; i++)
{
var ars = adjustedRoute.Segments[i];
var previousDashPL = ars.FirstWaypoint.ParameterizedLocation;
var previousDashValue = session.Route.GetAttributeFromParameterizedLocation(experimental_dashWaypointAttribute, previousDashPL) ?? 0;
var previousDashIndex = previousDashValue / experimental_dashLength;
for (var j = 0; j < ars.Waypoints.Count; j++)
{
var aw = ars.Waypoints[j];
if (aw.ParameterizedLocation >= startPL && aw.ParameterizedLocation <= endPL)
{
var currentDashValue = session.Route.GetAttributeFromParameterizedLocation(experimental_dashWaypointAttribute, aw.ParameterizedLocation) ?? 0;
var currentDashIndex = currentDashValue / experimental_dashLength;
var dashStartPassed = (int) currentDashIndex > (int) previousDashIndex;
if (dashStartPassed)
{
// create dash start points that are between these adjusted route points
for(var k = (int)previousDashIndex+1; k<currentDashIndex; k++)
{
var t = (k - previousDashIndex)/(currentDashIndex - previousDashIndex);
var newDashStartPL = new ParameterizedLocation(i, (1 - t)*previousDashPL.Value + t*aw.ParameterizedLocation.Value);
adjustedWaypoints.Add(adjustedRoute.CreateWaypointFromParameterizedLocation(newDashStartPL, AdjustedWaypoint.AdjustedWaypointType.Normal));
}
previousDashPL = aw.ParameterizedLocation;
previousDashIndex = currentDashIndex;
}
adjustedWaypoints.Add(aw);
}
}
}
return adjustedWaypoints;
}
}
}
|