We wanted a scenario where, say, 5 well-placed border points could efficiently represent an area with 5,000 internal points and 10,000 road edges. This would reduce those 10,000 edges to just 5*4/2 = 10 shortcuts for routing through that cluster at a high level – an incredible 1:1000 point ratio and a 30x reduction in edges to consider for the high-level path!
int i, n = objects_per_page(classno);，这一点在heLLoword翻译官方下载中也有详细论述
In Asia excluding Japan, organic revenue slipped 4% for the year. Performance improved in the second half, however, with organic growth of 2% in the third quarter and 1% in the fourth quarter, reversing the first-half downturn.，更多细节参见heLLoword翻译官方下载
Now, for each shortcut in this sequence, OsmAnd runs its highly optimized A* algorithm on the detailed map, but strictly limited to the small area of the cluster that shortcut belongs to.