Differences

This shows you the differences between two versions of the page.

--- graduation_projects [2021/06/06 14:28] – [Cost cues for maps of transportation networks (BM)] administrator
+++ graduation_projects [2021/06/06 14:28] – [Labels-first schematic cartography (M)] administrator
@@ Line 32: / Line 32: @@
-====Labels-first schematic cartography (M)====
-Many algorithms have been designed for the automatic drawing of schematic maps of public transportation networks. Except in a few special cases, these algorithms first attempt to find an optimal drawing of the network, and then try to put the station labels in. This results, practically always, in problems with the labelling that are hard to solve. Alternatively, as suggested by the experienced map drawer [[http://www.tubemapcentral.com/|Maxwell Roberts]], we could first find an arrangement for the labels on the map and then try to find a good network drawing that follows the labels. Our first task in this approach is to formulate boundary conditions and optimization criteria for the arrangement of the labels, taking into account what is needed to ensure that a good network drawing is possible. Second, we need the solve the label arrangement problem according to the specified criteria.
 ====Hierarchical schematic map drawing (BM)====

Herman Haverkort