Audax Mesh

[Lightning Phil]

Came across the audax mesh online today

It’s still on aukweb at http://www.aukweb.net/mesh/index.htm

[alfapete]

Fond memories.
I did my first 150km event on the Mesh in 2009 and the organiser in the midlands at the time was Danial Webb. I recently came across his encouraging words on the validated brevet card telling me I'd easily manage a 200. Two RRTYs later and he turns out to have been right.
Wonder whatever happened to him?

[Tomsk]

I happened to find my original Mesh maps during one of my lockdown loft clearout sessions, happy memories indeed. Most of my rides ended up about 15% overdistance! I did quite a few 200 & 300s around East Anglia in the early Noughties.

[CrazyEnglishTriathlete]

The mesh was more extensive at one point - this connected with Peter Coulson's mesh.  My very first randonnee in 2002 was one of them - Overton - Hungerford - Malmesbury - Faringdon - Goring - Overton - with the joy of Streatley hill at about 110 miles.  And my first SR series was concluded with a 300 - Overton - Romsey -Shaftesbury - Cheddar - Malmesbury - Hungerford - Overton in 2005.

[arabella]

I've got one tucked away somewhere.  But chateau arabella isn't a node on the mesh and DIYs were becoming a thing by the time I ventured on the audax scene so never did one.
Meanwhile I have been looking at bridleways/restricted byways, on foot.  I think it'll stay that way!

[telstarbox]

That ugly MapPoint style takes me back

[Lightning Phil]

I've had a go at generating a modern audax mesh using the controls data gathered for the perms map.




The basic edges of the triangles was done via Delaunay triangulation if anyone is familiar with that. The google walking distance has been calculated for every point to point line (2,906) shown between controls. I've got an idea for some shortest path type logic to calculate route between controls.  But that's for another day.

[davocon]

The poor, neglected Northeast! (This is not a criticism of the map or any perm organisers obviously)

I've had a go at generating a modern audax mesh using the controls data gathered for the perms map.




The basic edges of the triangles was done via Delaunay triangulation if anyone is familiar with that. The google walking distance has been calculated for every point to point line (2,906) shown between controls. I've got an idea for some shortest path type logic to calculate route between controls.  But that's for another day.

[CrazyEnglishTriathlete]

At least the Northeast is on the map....

It does look rather cool though. 

[iroiromono]

Poor Scotland got chopped off!

[Lightning Phil]

Poor Scotland got chopped off!

Oh the mesh goes all the way upto JOG but zoom out so you can see the whole of GB and the mesh merges into a load of red with something below! But it is only the top of Scotland chopped off, not all of it, in the screen snips.

[cygnet]

I've got an idea for some shortest path type logic to calculate route between controls.  But that's for another day.

There's some IvanScience^TM behind his FRRT for stuff like TC, may be worth a discussion.

[Lightning Phil]

Well here is Phil science *

First iteration / test of shortest path routing. At the moment all routes lead to John O' Groats as I'm testing it routing across the country.  The graph data set (I've built for routing) is very compact, at 200 kb, and it takes 18 milliseonds (1/50 second) to calculate a shortest route from Lands End to John 'O' Groats via the known permanent controls. It runs entirely in the browser, not needing a server back end to do the routing.

Note this won't tell you which roads to take but it will give a list of controls to move along, and it knows the Google walking distance between all controls, so can give you a minimum distance, plus a GPX with a list of control waypoints. When I write the later bit anyway.





York Arrow planning example



* Well actually it's Dijkstra's algorithm for the magic. I just generated the audax mesh weighted graph for it to consume. See https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm