| 摘要 |
<p>All shortest paths (1,2,3,...) in a route network are calculated, each path comprising a start node (S1,S2,S3,...) and a destination node (Z1,Z2,Z3,...), or a start region (C). From distances between route segment and start node and between segment and destination node, the shortest paths (min1, min2, min3,...) are determined, and a maximum distance is defined as a significant parameter for the segment (e). All route segments are sorted based on their maximum distances, and allocated to route classes. An independent claim is included for a navigation system.</p> |
