graduation_projects
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
| graduation_projects [2021/06/06 14:28] – [Cost cues for maps of transportation networks (BM)] administrator | graduation_projects [2021/06/06 14:29] – [Hierarchical schematic map drawing (BM)] 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, | ||
| - | ====Hierarchical schematic map drawing (BM)==== | ||
| - | Schematic maps of transportation networks in which train/metro lines are depicted as smooth curves can be very effective, as studies by the psychologist Maxwell Roberts have shown. [[# | ||
| - | To bring more structure into the map, we may experiment with the following approach: first identify which metro lines, or which sections thereof, are most important; then adapt the force-directed method such that these lines are drawn straighter or smoother, while allowing less important lines to become more twisted. | ||
| =====Past projects (TUE) ===== | =====Past projects (TUE) ===== | ||
graduation_projects.txt · Last modified: 2021/06/06 14:30 by administrator
Page Tools
