Automatically obtaining railway maps from a set of historical events

作者：Roanes Lozano Eugenio^*; Martinez Zarzuelo Angelica; Garcia Alvarez Alberto; Wester Michael J; Roanes Macias Eugenio

来源：Revista de la Real Academia de Ciencias Exactas Fisicas y Naturales Serie A-Matematicas, 2011, 105(1): 149-165.

DOI：10.1007/s13398-011-0010-1

• Graph theory (including graph drawing)
• Network models, deterministic
• Programming involving graphs or networks
• Transportation engineering

We present here what, as far as we know, is a real novelty: a computer package that can automatically generate railway maps of a certain network at any (past) date requested, using different colors to show the type of line. The input is: (1) a set of historical events, (2) the graph of the railway network at its maximum extension and (3) a list of geographical coordinates of stations, junctions, loading bays, ... (that are the nodes of the graph). The package processes the set of historical events (affecting whole lines or portions of lines), and assigns a list of dates to each edge of the graph. Then, when a date is given to the system, it computes the right coloring for each edge, and constructs and plots an accurate map of the railway network at that given date according to the geographic coordinates of the nodes of the graph. This piece of software can be really useful for geographers, historians and engineers. What is normally available are maps of certain dates, and they do not always use the same scale, the same level of detail, the same symbols and colors, ..., or are restricted to a certain railway company.

• 出版日期2011