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
|
package ride
import (
"fmt"
"log/slog"
"math"
"slices"
"time"
"github.com/jftuga/geodist"
"github.com/martinlehoux/kagamigo/kcore"
)
const ClimbDistanceMinimum = 500
// Category is the difficulty class of a climb, ordered from easiest to
// hardest.
type Category int
const (
CategoryNo Category = iota
CategoryFour
CategoryThree
CategoryTwo
CategoryOne
CategoryHC
)
type categoryInfo struct {
label string
minScore float64
}
// categories describes each Category: its display label and the inclusive
// Cotacol score floor at which it starts applying. A score at or above
// CategoryOne's floor is Hors Catégorie; CategoryNo has no floor.
var categories = map[Category]categoryInfo{
CategoryNo: {label: "NO", minScore: math.Inf(-1)},
CategoryFour: {label: "Cat 4", minScore: 35},
CategoryThree: {label: "Cat 3", minScore: 80},
CategoryTwo: {label: "Cat 2", minScore: 180},
CategoryOne: {label: "Cat 1", minScore: 250},
CategoryHC: {label: "HC", minScore: 600},
}
// climbDetectionMinimumScore is the climb-detection score below which a
// candidate segment is not reported as a climb.
const climbDetectionMinimumScore = 35
type Climb struct {
ride Ride
rideStart int
rideEnd int
Name string
}
func (climb Climb) Duration() time.Duration {
return climb.ride.Timestamp(climb.rideEnd).Sub(climb.ride.Timestamp(climb.rideStart))
}
func (climb Climb) Speed() float64 {
return (climb.EndDistanceM() - climb.StartDistanceM()) / climb.Duration().Seconds()
}
func (climb Climb) StartIndex() int { return climb.rideStart }
func (climb Climb) EndIndex() int { return climb.rideEnd }
func (climb Climb) StartDistanceM() float64 {
return climb.ride.DistanceM(climb.rideStart)
}
func (climb Climb) EndDistanceM() float64 {
return climb.ride.DistanceM(climb.rideEnd)
}
func (climb Climb) StartCoord() geodist.Coord {
return climb.ride.Coord(climb.rideStart)
}
func (climb Climb) EndCoord() geodist.Coord {
return climb.ride.Coord(climb.rideEnd)
}
func (climb Climb) PointCoord(index int) geodist.Coord {
kcore.Assert(index >= climb.rideStart && index <= climb.rideEnd, "point is outside climb")
return climb.ride.Coord(index)
}
// TopIndex returns the highest point inside the climb, used as the crest anchor.
func (climb Climb) TopIndex() int {
top := climb.rideStart
for i := climb.rideStart; i <= climb.rideEnd; i++ {
if climb.ride.ElevationM(i) > climb.ride.ElevationM(top) {
top = i
}
}
return top
}
func (climb Climb) TopDistanceM() float64 {
return climb.ride.DistanceM(climb.TopIndex())
}
func (climb Climb) TopElevationM() float64 {
return climb.ride.ElevationM(climb.TopIndex())
}
func (climb Climb) TopCoord() geodist.Coord {
return climb.ride.Coord(climb.TopIndex())
}
func (climb Climb) String() string {
startDistance := climb.StartDistanceM()
endDistance := climb.EndDistanceM()
cotacol := climb.DifficultyScore()
body := fmt.Sprintf("%.1fkm-%.1fkm: %.1fkm at %.1f%% (%d pts - %s)", startDistance/1000, endDistance/1000, (endDistance-startDistance)/1000, Slope(climb.ride, climb.rideStart, climb.rideEnd)*100, int(cotacol), CategoryOf(cotacol))
if climb.Name == "" {
return body
}
return climb.Name + ": " + body
}
func (climb Climb) DifficultyScore() float64 {
return difficultyScore(climb.ride, climb.rideStart, climb.rideEnd)
}
func Slope(r Ride, start, end int) float64 {
return (r.ElevationM(end) - r.ElevationM(start)) / (r.DistanceM(end) - r.DistanceM(start))
}
func climbDetectionScore(r Ride, start, end int) float64 {
kcore.Assert(end > start, "no points for climb detection")
distance := r.DistanceM(end) - r.DistanceM(start)
if distance == 0 {
return 0
}
dElevation := r.ElevationM(end) - r.ElevationM(start)
return math.Abs(dElevation) * dElevation / distance * 100.0 * 100.0 / 1000.0
}
func (c Category) String() string {
return categories[c].label
}
// CategoryOf returns the difficulty class of a Cotacol score: the category
// with the highest floor the score reaches.
func CategoryOf(cotacol float64) Category {
best := CategoryNo
bestMin := math.Inf(-1)
found := false
for category, info := range categories {
if cotacol >= info.minScore && (!found || info.minScore > bestMin) {
best = category
bestMin = info.minScore
found = true
}
}
if !found {
// NaN reaches no floor; preserve the original switch default (HC).
return CategoryHC
}
return best
}
func bestClimbBetween(r Ride, start, end int) Climb {
kcore.Assert(end > start, "empty points")
bestDetectionScore := climbDetectionScore(r, start, end)
bestStart := start
for i := start; i < end; i++ {
detectionScore := climbDetectionScore(r, i, end)
if detectionScore > bestDetectionScore {
bestStart = i
bestDetectionScore = detectionScore
}
}
bestEnd := end
for i := end; i > bestStart; i-- {
detectionScore := climbDetectionScore(r, bestStart, i)
if detectionScore > bestDetectionScore {
bestEnd = i
bestDetectionScore = detectionScore
}
}
for i := bestStart; i < bestEnd; i++ {
detectionScore := climbDetectionScore(r, i, bestEnd)
if detectionScore > bestDetectionScore {
bestStart = i
bestDetectionScore = detectionScore
}
}
kcore.Assert(bestStart < bestEnd, "empty climb")
return Climb{ride: r, rideStart: bestStart, rideEnd: bestEnd}
}
func climbsBetween(r Ride, start, end int) []Climb {
climbs := []Climb{}
if r.DistanceM(end)-r.DistanceM(start) < ClimbDistanceMinimum {
return climbs
}
slog.Debug("Searching climbs between", slog.Int("start", int(r.DistanceM(start))), slog.Int("end", int(r.DistanceM(end))))
highest := start
for i := start; i <= end; i++ {
if r.ElevationM(i) > r.ElevationM(highest) {
highest = i
}
}
// TODO: Use descent to reduce recursion
if r.DistanceM(highest)-r.DistanceM(start) < ClimbDistanceMinimum {
return climbsBetween(r, start+1, end)
}
climb := bestClimbBetween(r, start, highest)
if climbDetectionScore(r, climb.rideStart, climb.rideEnd) >= climbDetectionMinimumScore && climb.EndDistanceM()-climb.StartDistanceM() >= ClimbDistanceMinimum {
slog.Debug("Found climb between", slog.Int("start", int(climb.StartDistanceM())), slog.Int("end", int(climb.EndDistanceM())))
climbs = append(climbs, climb)
}
climbs = append(climbs, climbsBetween(r, start, climb.rideStart)...)
climbs = append(climbs, climbsBetween(r, climb.rideEnd, end)...)
return climbs
}
type Range struct {
Start int
End int
}
func isValidClaim(claim Range, routeLen int) bool {
return claim.Start >= 0 && claim.End < routeLen && claim.Start < claim.End
}
// freeRegions returns the maximal sub-ranges of [rStart, rEnd] that are not
// covered by any claimed range, after discarding claims that fall outside.
func freeRegions(rStart, rEnd int, claimed []Range) []Range {
regions := make([]Range, 0, len(claimed)+1)
current := rStart
for _, claim := range claimed {
if !isValidClaim(claim, rEnd+1) {
continue
}
if claim.End < current {
continue
}
if claim.Start > current {
regions = append(regions, Range{Start: current, End: claim.Start - 1})
}
if claim.End+1 > current {
current = claim.End + 1
}
}
if current <= rEnd {
regions = append(regions, Range{Start: current, End: rEnd})
}
return regions
}
// returns the detected climbs of the whole ride, but never a climb that overlaps
// a claimed range.
func (ride *Ride) DetectClimbs(claimed []Range) []Climb {
climbs := make([]Climb, 0)
for _, region := range freeRegions(0, ride.Len()-1, claimed) {
climbs = append(climbs, climbsBetween(*ride, region.Start, region.End)...)
}
slices.SortFunc(climbs, climbCmpStart)
return climbs
}
func climbCmpStart(a, b Climb) int { return a.rideStart - b.rideStart }
|
