The result from Step 2 is a high-level route – a sequence of shortcuts connecting border points.
Мир Российская Премьер-лига|19-й тур
，这一点在旺商聊官方下载中也有详细论述
The fun and well-photographed interview in Softalk in 1983 starts like this:
N-Closest Algorithm