Just for fun, I made a graph of the WaypointQuadtree:
http://yakra.teresco.org/tests/tmg/Quadtree/WaypointQuadtree-good.tmghttp://yakra.teresco.org/tests/tmg/Quadtree/WaypointQuadtree-good.tmg.htmlhttps://github.com/TravelMapping/DataProcessing/pull/126/filesThe WaypointQuadtree has been initialized all these years with the latitude and longitude bounds swapped. It hasn't broken anything, but just led to a sub-optimal distribution of child nodes.
After fixing it, we're down from 42757 to 35165 total nodes with the latest HighwayData.
How does it affect the time to process the total siteupdate.py time, skipping graphs?
Total run time: [394.3] -> [390.1]
Probably not a significant difference.
Edit: Another fun potential project:What are the deepest-level, geographically smallest nodes, and how many of this size are there?
Of these, which contain the most waypoints? The most unique locations?
The smallest refined node I've found with a bit of eyeball scanning is near the Maughan Library in Westminster:
Paste this into wptedit for a visual:
SW_A http://www.openstreetmap.org/?lat=51.503906&lon=-0.131836
NW http://www.openstreetmap.org/?lat=51.525879&lon=-0.131836
NE http://www.openstreetmap.org/?lat=51.525879&lon=-0.087891
SE http://www.openstreetmap.org/?lat=51.503906&lon=-0.087891
SW_B http://www.openstreetmap.org/?lat=51.503906&lon=-0.131836
This node is itself refined into four sub-quadrants.
Which of these contains the most points or unique locations, as well as if there are more nodes of this size (or smaller) elsewhere, will take a programmatic solution.