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
|
package ride
import (
"fmt"
"log/slog"
"math"
"slices"
"time"
"github.com/jftuga/geodist"
"github.com/martinlehoux/kagamigo/kcore"
)
const ClimbDistanceMinimum = 500
type Climb struct {
start int
end int
points []Point
}
func (climb Climb) String() string {
start := climb.points[0]
end := climb.points[len(climb.points)-1]
score := Score(climb.points, 0, len(climb.points)-1)
return fmt.Sprintf("%.1fkm-%.1fkm: %.1fkm at %.1f%% (%d pts - %s)", start.DistanceM/1000, end.DistanceM/1000, (end.DistanceM-start.DistanceM)/1000, Slope(start, end)*100, int(score), Category(score))
}
type Point struct {
DistanceM float64
ElevationM float64
Coord geodist.Coord
Timestamp time.Time
}
func Slope(start, end Point) float64 {
return (end.ElevationM - start.ElevationM) / (end.DistanceM - start.DistanceM)
}
func Score(points []Point, start int, end int) float64 {
kcore.Assert(end > start, "no points for score")
distance := points[end].DistanceM - points[start].DistanceM
if distance == 0 {
return 0
}
dElevation := points[end].ElevationM - points[start].ElevationM
return math.Abs(dElevation) * dElevation / distance * 100.0 * 100.0 / 1000.0
}
func Category(score float64) string {
switch {
case score < 35:
return "NO"
case score < 80:
return "Cat 4"
case score < 180:
return "Cat 3"
case score < 250:
return "Cat 2"
case score < 600:
return "Cat 1"
default:
return "HC"
}
}
func bestClimbBetween(points []Point, start int, end int) Climb {
kcore.Assert(end > start, "empty points")
bestScore := Score(points, start, end)
bestStart := start
for i := start; i < end; i++ {
score := Score(points, i, end)
if score > bestScore {
bestStart = i
bestScore = score
}
}
bestEnd := end
for i := end; i > bestStart; i-- {
score := Score(points, bestStart, i)
if score > bestScore {
bestEnd = i
bestScore = score
}
}
for i := bestStart; i < bestEnd; i++ {
score := Score(points, i, bestEnd)
if score > bestScore {
bestStart = i
bestScore = score
}
}
climb := Climb{start: bestStart, end: bestEnd, points: points[bestStart : bestEnd+1]}
kcore.Assert(climb.start < climb.end, "empty climb")
return climb
}
func climbsBetween(points []Point, start int, end int) []Climb {
climbs := []Climb{}
if points[end].DistanceM-points[start].DistanceM < ClimbDistanceMinimum {
return climbs
}
slog.Debug("Searching climbs between", slog.Int("start", int(points[start].DistanceM)), slog.Int("end", int(points[end].DistanceM)))
highest := start
for i := start; i <= end; i++ {
if points[i].ElevationM > points[highest].ElevationM {
highest = i
}
}
// TODO: Use descent to reduce recursion
if points[highest].DistanceM-points[start].DistanceM < ClimbDistanceMinimum {
return climbsBetween(points, start+1, end)
}
climb := bestClimbBetween(points, start, highest)
if Score(points, climb.start, climb.end) >= 35 && points[climb.end].DistanceM-points[climb.start].DistanceM >= ClimbDistanceMinimum {
slog.Debug("Found climb between", slog.Int("start", int(points[climb.start].DistanceM)), slog.Int("end", int(points[climb.end].DistanceM)))
climbs = append(climbs, climb)
}
climbs = append(climbs, climbsBetween(points, start, climb.start)...)
climbs = append(climbs, climbsBetween(points, climb.end, end)...)
return climbs
}
func (ride *Ride) AllClimbs() []Climb {
climbs := climbsBetween(ride.points, 0, len(ride.points)-1)
slices.SortFunc(climbs, climbCmpStart)
return climbs
}
func climbCmpStart(a, b Climb) int { return a.start - b.start }
|