Algorithmically-Assisted Schematic Transit Map Design: A System and Algorithmic Core for Fast Layout Iteration.

Area of Science:

• Computational geometry
• Human-computer interaction
• Information visualization

Background:

• Schematic transit maps, like London's iconic tube map, are globally recognized standards.
• Optimizing transit map layouts is computationally intensive and time-consuming.
• Current methods struggle to balance algorithmic optimality with subjective design factors.

Purpose of the Study:

• To develop a framework supporting rapid, iterative design of schematic transit maps.
• To enable human designers to explore a wider range of layouts efficiently.
• To bridge the gap between algorithmic computation and human-led design preferences.

Main Methods:

• Developed a framework utilizing a linear program for network layout computation.
• Integrated a graphical user interface for designer interaction and control over connection directions.
• Implemented features for efficient exploration and iteration of map designs.

Main Results:

• The framework computes network layouts almost instantaneously.
• It allows designers to rapidly iterate on map designs through interactive control.
• The system facilitates exploration of a broader design space than manual methods.

Conclusions:

• Supporting human designers with algorithmic tools enhances the schematic map creation process.
• Rapid layout iteration is more practical than striving for a single, computationally expensive optimal layout.
• The open-source framework offers a flexible and efficient approach to transit map design.