OsmAnd's Faster Offline Navigation

4 hours ago

OsmAnd introduces Highway Hierarchy (HH) Routing for faster offline navigation, achieving up to 100x speed improvements.
Traditional A* algorithm faced performance issues with detailed maps and complex routing demands.
Highway Hierarchy Routing uses a two-level system with 'area clusters' and 'border points' to optimize route calculation.
Ford-Fulkerson algorithm identifies natural bottlenecks to determine optimal border points for clusters.
Pre-calculated shortcuts between border points reduce the computational load, enabling faster routing.
The system supports all routing profiles and parameters without significantly increasing map size (only ~0.5% increase per profile).
Dynamic updates and live changes are handled gracefully, maintaining routing accuracy with minimal performance impact.
Users can still utilize custom routing profiles and settings, with fallback to traditional A* if needed.
HH-Routing requires map files to be from the same generation date for cross-border routing compatibility.
The entire planet's car routing data is compact, around 800MB, making it efficient for offline use.

Hasty Briefsbeta